A game of optimal pursuit of one object by several

Abstract A differential game in which m dynamical objects pursue a single one is investigated. All the players perform simple motions. The termination time of the game is fixed. The controls of the first k ( k ⩽ m ) pursuers are subject to integral constraints and the controls of the other pursuers and the evader are subject to geometric constraints. The payoff of the game is the distance between the evader and the closest pursuer at the instant the game is over. Optimal strategies for the players are constructed and the value of the game is found.