A Pursuit–Evasion Differential Game with Slow Pursuers on the Edge Graph of a Simplex. I

2021 ◽  
Vol 82 (11) ◽  
pp. 1996-2005
Author(s):  
A. A. Azamov ◽  
T. T. Ibaydullayev
2020 ◽  
Vol 12 (4) ◽  
pp. 7-23
Author(s):  
Абдулла Азамов ◽  
Abdulla Azamov ◽  
Толанбай Ибайдуллаев ◽  
Tolanbay Ibaydullayev

We consider the differential game between several pursuing points and one evading point moving along the graph of edges of a simplex when maximal quantities of velocities are given. The normalization of the game in the sense of J. von Neumann including the description of classes of admissible strategies is exposed. In the present part of the paper the qualitative problem for the full graph of three dimensional simplex is solved using the strategy of parallel pursuit for a slower pursuer and some numerical coefficient of a simplex characterizing its proximity to the regular one. Next part will be devoted to higher dimensional cases.


2020 ◽  
Vol 5 (6) ◽  
pp. 7467-7479
Author(s):  
Jamilu Adamu ◽  
◽  
Kanikar Muangchoo ◽  
Abbas Ja’afaru Badakaya ◽  
Jewaidu Rilwan ◽  
...  

2014 ◽  
Vol 687-691 ◽  
pp. 260-264
Author(s):  
Feng Tian ◽  
Ji Feng Zou ◽  
Tong Zhang

In this paper, a method of the UAV path planing in the complex environment by using artificial potential field and differential game theory is introduced. This article studies the pursuit evasion game of the dynamic path planing for the UAV. The fly zone of either the pursuer or the evader is divided into two categories, namely the obstacle areas and the obstacle-free areas. So we can use the artificial potential field in the obstacle areas,and we use differential game theory in the obstacle-free areas for the UAV. This method can apply to pursuit-evasion game in the complex environment for the UAV path planing.Not only the UAV can avoid obstacles but also they can find the best capture path.Finally,the simulation results verify its correctness and validity .


Sign in / Sign up

Export Citation Format

Share Document