Inertial space optimal trajectories of aerial three-dimensional pursuit-evasion differential game

1996 ◽  
Vol 19 (3) ◽  
pp. 612-620 ◽  
Author(s):  
A. Segal ◽  
T. Miloh
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.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Xiao Liang ◽  
Honglun Wang ◽  
Haitao Luo

The UAV/UGV heterogeneous system combines the air superiority of UAV (unmanned aerial vehicle) and the ground superiority of UGV (unmanned ground vehicle). The system can complete a series of complex tasks and one of them is pursuit-evasion decision, so a collaborative strategy of UAV/UGV heterogeneous system is proposed to derive a pursuit-evasion game in complex three-dimensional (3D) polygonal environment, which is large enough but with boundary. Firstly, the system and task hypothesis are introduced. Then, an improved boundary value problem (BVP) is used to unify the terrain data of decision and path planning. Under the condition that the evader knows the position of collaborative pursuers at any time but pursuers just have a line-of-sight view, a worst case is analyzed and the strategy between the evader and pursuers is studied. According to the state of evader, the strategy of collaborative pursuers is discussed in three situations: evader is in the visual field of pursuers, evader just disappears from the visual field of pursuers, and the position of evader is completely unknown to pursuers. The simulation results show that the strategy does not guarantee that the pursuers will win the game in complex 3D polygonal environment, but it is optimal in the worst case.


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