The surveillance-evasion game of degree

1975 ◽  
Vol 16 (3-4) ◽  
pp. 339-353 ◽  
Author(s):  
J. Lewin ◽  
J. V. Breakwell
Keyword(s):  
Evasion Game ◽  
Surveillance Evasion

scholarly journals An efficient algorithm for a visibility-based surveillance-evasion game

2014 ◽  
Vol 12 (7) ◽  
pp. 1303-1327 ◽  
Author(s):  
Ryo Takei ◽  
Richard Tsai ◽  
Zhengyuan Zhou ◽  
Yanina Landa
Keyword(s):  
Efficient Algorithm ◽  
Evasion Game ◽  
Surveillance Evasion

An Efficient Algorithm for a Visibility-Based Surveillance-Evasion Game

2012 ◽  
Author(s):  
Ryo Takei ◽  
Richard Tsai ◽  
Zhengyuan Zhou ◽  
Yanina Landa
Keyword(s):  
Efficient Algorithm ◽  
Evasion Game ◽  
Surveillance Evasion

LEVEL SETS OF THE VALUE FUNCTION IN DIFFERENTIAL GAMES WITH THE HOMICIDAL CHAUFFEUR DYNAMICS

2001 ◽  
Vol 03 (01) ◽  
pp. 67-112 ◽  
Author(s):  
V. S. PATSKO ◽  
V. L. TUROVA
Keyword(s):  
Differential Games ◽  
Level Sets ◽  
Value Functions ◽  
Capture Time ◽  
Evasion Game ◽  
Homicidal Chauffeur ◽  
Turn Radius ◽  
The Value Function ◽  
Maximal Time ◽  
Surveillance Evasion

Three differential games with the dynamics of the homicidal chauffeur are considered. The first problem is the Isaacs' homicidal chauffeur differential game. In this game, a pursuer P minimises the capture time of an evader E. The objective of the evader is to prevent the capture or to maximise the capture time. The magnitude of the velocity is constant for the pursuer, and his maneuverability is bounded through a minimal turn radius. The maneuverability of the evader is not bounded. The pursuer's control is the rate of turn; the evader steers by choosing directions of his velocity. The main difference of the second problem is that the size of the constraint on the control parameter of the evader depends on the position of the game. The idea of such a modification was suggested by Bernhard. The third problem is a conic surveillance-evasion game studied by Lewin and Olsder. In this game, the dynamics is the same as in the Isaacs' problem, but the goals of the players differ from the classic formulation: an evader E minimises the time of escaping from a detection set that is a two-dimensional semiinfinite cone. The detection set is attached to the velocity vector of a pursuer P whose objective is to keep the evader within the detection set for maximal time. The paper describes the computation of level sets of the value functions for these games. The algorithm proposed by the authors is used. An analysis of families of semipermeable curves is carried out. The results of this analysis are used to check the correctness of the computation of level sets and to explain the appearance of holes in victory domains of the pursuer in the second problem.

scholarly journals Predictive pursuit-evasion game control method for approaching space non-cooperative target

2020 ◽  
Vol 53 (2) ◽  
pp. 14882-14887
Author(s):  
Yuan Chai ◽  
Jianjun Luo ◽  
Mingming Wang ◽  
Min Yu
Keyword(s):  
Control Method ◽  
Pursuit Evasion ◽  
Evasion Game

scholarly journals Collaborative Pursuit-Evasion Strategy of UAV/UGV Heterogeneous System in Complex Three-Dimensional Polygonal Environment

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Xiao Liang ◽  
Honglun Wang ◽  
Haitao Luo
Keyword(s):  
Visual Field ◽  
Heterogeneous System ◽  
Three Dimensional ◽  
Unmanned Ground Vehicle ◽  
Worst Case ◽  
Ground Vehicle ◽  
Pursuit Evasion ◽  
Evasion Game ◽  
Evasion Strategy ◽  
Aerial Vehicle

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.

Sign in / Sign up

Export Citation Format

Share Document