Some pursuit methods in linear discrete many person games. I (Q912011)

The author considers a pursuit-evasion game with \(m+1\) participants. The dynamics of the game is described by linear discrete equations with ``geometrical'' restrictions on the players' control functions. Some sufficient conditions of completing the game in a finite number of steps are proposed. The method is based on the division of m pursuers onto two teams, one of which restricts the evader's trajectory to a certain domain, while the second one captures it in this state space region. The ideas and approaches developed in earlier papers which are given in the list of references are used.