An Optimal Pursuit Differential Game Problem with One Evader and Many Pursuers

The objective of this paper is to study a pursuit differential game with finite or countably number of pursuers and one evader. The game is described by differential equations in l2-space, and integral constraints are imposed on the control function of the players. The duration of the game is fixed and the payoff functional is the greatest lower bound of distances between the pursuers and evader when the game is terminated. However, we discuss the condition for finding the value of the game and construct the optimal strategies of the players which ensure the completion of the game. An important fact to note is that we relaxed the usual conditions on the energy resources of the players. Finally, some examples are provided to illustrate our result.