Abstract
We construct an evasion strategy in a general evasion differential game, played on the Euclidean space, with one evader and any finite number of pursuers where the dynamics of the objects are given by a system of linear differential equations. Our construction of the evasion strategy is based on the ai-τi method. We show that if the evader can successfully implement this strategy, then it can win the game against all possible strategy choices of the pursuers.
Original language | English |
---|---|
Article number | 114992 |
Number of pages | 16 |
Journal | Dynamic Games and Applications |
DOIs | |
Publication status | Published - 4 Jan 2025 |
Keywords
- Differential game theory
- Linear differential equations
- Pursuit-evasion
ASJC Scopus subject areas
- Statistics and Probability
- Economics and Econometrics
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Computational Theory and Mathematics
- Computational Mathematics
- Applied Mathematics