On pursuit and evasion game problems with Gr$$\ddot{\text {o}}$$nwall-type constraints

Abstract

We study a fixed duration pursuit-evasion differential game problem of one pursuer and one evader with Grönwall-type constraints (recently introduced in the work of Samatov et al. (Ural Math J 6:95–107, 2020b)) imposed on all players’ control functions. The players’ dynamics are governed by a generalized dynamic equation. The payoff is the greatest lower bound of the distances between the evader and the pursuers when the game is terminated. The pursuers’ goal, which contradicts that of the evader, is to minimize the payoff. We obtained sufficient conditions for completion of pursuit and evasion as well. To this end, players’ attainability domain and optimal strategies are constructed.