Pursuit-Evasion Differential Game with Many Inertial Players
نویسندگان
چکیده
We consider pursuit-evasion differential game of countable number inertial players in Hilbert space with integral constraints on the control functions of players. Duration of the game is fixed. The payoff functional is the greatest lower bound of distances between the pursuers and evader when the game is terminated. The pursuers try to minimize the functional, and the evader tries to maximize it. In this paper, we find the value of the game and construct optimal strategies of the players.
منابع مشابه
Optimal pursuit time for a differential game in the Hilbert space l2
ABSTRACT: We consider a two-person zero-sum pursuit-evasion differential game in the Hilbert space l2. The control functions of the players are subject to integral constraints. It is assumed that the control resource of the pursuer is greater than that of the evader. The pursuer tries to force the state of the system towards the origin of the space l2, and the evader tries to avoid this. We giv...
متن کاملOn Some Pursuit and Evasion Differential Game Problems for an Infinite Number of First-Order Differential Equations
We study pursuit and evasion differential game problems described by infinite number of firstorder differential equations with function coefficients in Hilbert space l2. Problems involving integral, geometric, and mix constraints to the control functions of the players are considered. In each case, we give sufficient conditions for completion of pursuit and for which evasion is possible. Conseq...
متن کاملGame of Defending a Target: A Linear Quadratic Differential Game Approach
Pursuit-evasion (PE) differential games have recently received much attention in military applications involving adversaries. We extend the PE game problem to a problem of defending target, where the roles of the players are changed. The evader is to attack some fixed target, whereas the pursuer is to defend the target by intercepting the evader. We propose a practical strategy design approach ...
متن کاملA Dijkstra-Type Algorithm for Dynamic Games
We study zero-sum dynamic games with deterministic transitions and alternating moves of the players. Player 1 aims at reaching a terminal set and minimising a running and final cost. We propose and analyse an algorithm that computes the value function of these games extending Dijkstra’s algorithm for shortest paths on graphs. We also show the connection of these games with numerical schemes for...
متن کاملGame Theory Models for Pursuit Evasion Games
In a pursuit evasion game, the pursuer tries to capture the evader while the evader tries to prevent this capture. A classical approach is to model this game as an infinite differential game. In this report, we model a pursuit-evasion game as a finite extensive form game, and show that the differential game is a generalization of this game. We prove that a pure-strategy Nash equilibrium always ...
متن کامل