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: | , , , |
|---|---|
| Other Authors: | |
| 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 |
| Summary: | 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 proposed to asymptotically recover the expected value function. The performance of the proposed algorithms is compared via a stochastically parametric homicidal chauffeur game. The algorithms are also applied to the scenario of merging lanes in urban transportation. |
|---|