On differential games of evasion from many pursuers (Q799512)

This paper contains a survey of some results regarding differential games of evasion from many pursuers. This class of games presents special difficulties and usually cannot be treated by standard methods. The approach developed consists of constructing piecewise program strategies for the evader, based on certain maneuvers of evasion from one pursuer. These strategies satisfy one additional condition (state constraint); the evader's motion does not leave a given neighborhood of a prescribed nominal motion. An upper estimate for the number of program pieces of the evader's control and a lower estimate for the minimal distance between the evader and the pursuers are also obtained. These results are given for several types of equations of the game.