Name
Abstract | ||
|---|---|---|
We study computability-theoretic aspects of differential games. Our focus is on pursuit and evasion games played in Euclidean spaces in the tradition of Radou0027s Lion versus game. In some ways, these games can be viewed as continuous versions of reachability games. We prove basic undecidability of differential games, and study natural classes of pursuit-evasion games in Euclidean spaces where the winners can win via computable strategies. The winning strategy for Man found by Besicovitch for the traditional Lion versus is not computable. We show how to modify it to yield a computable non-deterministic winning strategy, and raise the question whether Man can win in a computable and deterministic way. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Optimization and Control | Journal |
Volume | Citations | PageRank |
abs/1903.00688 | 0 | 0.34 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gafurjan I. Ibragimov | 1 | 21 | 6.25 |
| Bakh Khoussainov | 2 | 21 | 4.85 |
| Arno Pauly | 3 | 5 | 1.81 |