Control Strategies in Multi-Player Pursuit and Evasion Game

In this paper we visit the problem of pursuit and evasion and specifically, the collision avoidance during the problem. Two distinct tasks are visited: the first is a scenario when the agents can communicate with each other online, meanwhile in the second scenario they have to only rely on the state information and the knowledge about other agents' actions. We propose a method combining the already existing Minimax-Q and Nash-Q algorithms to provide a solution that can better take the enemy as well as friendly agents' actions into consideration. This combination is a simple weighting of the two algorithms with the Minimax-Q algorithm being based on a linear programming problem.

Download Full-text

A guidance strategy for multi-player pursuit and evasion game in maneuvering target interception

2013 9th Asian Control Conference (ASCC) ◽

10.1109/ascc.2013.6606182 ◽

2013 ◽

Cited By ~ 2

Author(s):

Ting-Kuo Wang ◽

Li-Chen Fu

Keyword(s):

Maneuvering Target ◽

Pursuit And Evasion ◽

Evasion Game ◽

Target Interception

Download Full-text

Pursuit and Evasion Game under Uncertainty

American Journal of Applied Mathematics and Statistics ◽

10.12691/ajams-1-2-1 ◽

2013 ◽

Vol 1 (2) ◽

pp. 21-26

Author(s):

Bankole Abiola ◽

R.K. Ojikutu

Keyword(s):

Pursuit And Evasion ◽

Evasion Game

Download Full-text

Simple Motion Pursuit and Evasion Differential Games with Many Pursuers on Manifolds with Euclidean Metric

Discrete Dynamics in Nature and Society ◽

10.1155/2016/1386242 ◽

2016 ◽

Vol 2016 ◽

pp. 1-8 ◽

Cited By ~ 2

Author(s):

Atamurat Kuchkarov ◽

Gafurjan Ibragimov ◽

Massimiliano Ferrara

Keyword(s):

Euclidean Space ◽

Differential Games ◽

Differential Game ◽

Finite Time ◽

The State ◽

Simple Motion ◽

Euclidean Metric ◽

Pursuit Game ◽

Pursuit And Evasion ◽

Evasion Game

We consider pursuit and evasion differential games of a group ofmpursuers and one evader on manifolds with Euclidean metric. The motions of all players are simple, and maximal speeds of all players are equal. If the state of a pursuer coincides with that of the evader at some time, we say that pursuit is completed. We establish that each of the differential games (pursuit or evasion) is equivalent to a differential game ofmgroups of countably many pursuers and one group of countably many evaders in Euclidean space. All the players in any of these groups are controlled by one controlled parameter. We find a condition under which pursuit can be completed, and if this condition is not satisfied, then evasion is possible. We construct strategies for the pursuers in pursuit game which ensure completion the game for a finite time and give a formula for this time. In the case of evasion game, we construct a strategy for the evader.

Download Full-text