Anytime computation algorithms for stochastically parametric approach-evasion differential games
We consider an approach-evasion differential game where the inputs of one of the players are upper bounded by a random variable. The game enjoys the order preserving property where a larger relaxation of the random variable induces a smaller value function. Two numerical computation algorithms are p...
Main Authors: | Mueller, Erich, Frazzoli, Emilio, Yong, Sze Zheng, Zhu, Minghui |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2015
|
Online Access: | http://hdl.handle.net/1721.1/96938 https://orcid.org/0000-0002-2104-3128 https://orcid.org/0000-0002-0505-1400 https://orcid.org/0000-0002-4399-8742 |
Similar Items
-
Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games
by: Karaman, Sertac, et al.
Published: (2013) -
Anytime computation of time-optimal off-road vehicle maneuvers using the RRT*
by: Jeon, Jeong hwan, et al.
Published: (2013) -
Anytime Motion Planning using the RRT*
by: Karaman, Sertac, et al.
Published: (2011) -
Real-time game theoretic coordination of competitive mobility-on-demand systems
by: Zhu, Minghui, et al.
Published: (2013) -
Pursuit and evasion differential games in Hilbert Space
by: Ibragimov, Gafurjan I., et al.
Published: (2010)