Linear non-stationary differential pursuit games with several evaders. (Russian. English summary) Zbl 1299.91008
Summary: A linear non-stationary differential pursuit game with a group of pursuers and a group of evaders is considered. The pursuers’ goal is to catch all evaders and the evaders’ goal is at least for one of them to avoid contact with pursuers. All players have equal dynamic capabilities, geometric constraints on the control are strictly convex compact set with smooth boundary. The point in question is the minimum number of evaders that is sufficient to evade a given number of pursuers from any initial position. Sufficient conditions for the solvability of the global problem of evasion are used as an upper estimate of this minimum. We assume that to capture one evader it suffices that the initial position of this evader lie in the interior of convex hull of initial positions of pursuers. Using this assumption we find a lower estimate of this minimum. The obtained two-sided estimate of the number of evaders sufficient to avoid contact with a given number of pursuers from any initial position is illustrated by examples.
MSC:
91A23 | Differential games (aspects of game theory) |
49N70 | Differential games and control |
49N75 | Pursuit and evasion games |