Geodesic Parallel Pursuit Strategy in a Simple Motion Pursuit Game on the Sphere

2000 ◽  
pp. 97-113
Author(s):  
A. M. Kovshov
Keyword(s):  
Simple Motion ◽  
Pursuit Game ◽  
Pursuit Strategy

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

2016 ◽  
Vol 2016 ◽  
pp. 1-8 ◽  
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.

Collaboration Strategy Simulation of Multi-Agents for Pursuit-Evasion in Wireless Sensor Networks

2010 ◽  
Vol 29-32 ◽  
pp. 2238-2242
Author(s):  
Li Xin Guo ◽  
Lei Ping Zhao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Field Boundary ◽  
Pursuit Evasion ◽  
Continuous Map ◽  
Evasion Strategy ◽  
Statistical Results ◽  
Pursuit Strategy ◽  
Multi Agents

In this study, we used Cricket equipments based on wireless sensor networks to study the pursuit-evasion strategy of multi-robots in a continuous map. In order to improve the efficiency, two new pursuit-evasion strategies were proposed. To meet the need of a continuous map, a greedy algorithm was utilized to deal with boundary problem when a pursuer or an evader was near the field boundary. The statistical results show the converging-attack pursuit strategy outperforms in pursuing the evader with different escaping strategies, such as randomly moving, active escaping strategy and vector-wards escaping strategy. The vector-wards escaping strategy is also effective in delaying the capture of evaders.

The difficulty of interpreting simple motion graphs

2000 ◽  
Vol 38 (2) ◽  
pp. 69-70
Author(s):  
David Groh
Keyword(s):  
Simple Motion ◽  
Motion Graphs

scholarly journals Two-Stage Pursuit Strategy for Incomplete-Information Impulsive Space Pursuit-Evasion Mission Using Reinforcement Learning

Aerospace ◽  
2021 ◽  
Vol 8 (10) ◽  
pp. 299
Author(s):  
Bin Yang ◽  
Pengxuan Liu ◽  
Jinglang Feng ◽  
Shuang Li
Keyword(s):  
Reinforcement Learning ◽  
Incomplete Information ◽  
Trajectory Optimization ◽  
Game Problem ◽  
Gradient Algorithm ◽  
Two Stage ◽  
Pursuit Evasion ◽  
Evasion Game ◽  
Close Distance ◽  
Pursuit Strategy

This paper presents a novel and robust two-stage pursuit strategy for the incomplete-information impulsive space pursuit-evasion missions considering the J2 perturbation. The strategy firstly models the impulsive pursuit-evasion game problem into a far-distance rendezvous stage and a close-distance game stage according to the perception range of the evader. For the far-distance rendezvous stage, it is transformed into a rendezvous trajectory optimization problem and a new objective function is proposed to obtain the pursuit trajectory with the optimal terminal pursuit capability. For the close-distance game stage, a closed-loop pursuit approach is proposed using one of the reinforcement learning algorithms, i.e., the deep deterministic policy gradient algorithm, to solve and update the pursuit trajectory for the incomplete-information impulsive pursuit-evasion missions. The feasibility of this novel strategy and its robustness to different initial states of the pursuer and evader and to the evasion strategies are demonstrated for the sun-synchronous orbit pursuit-evasion game scenarios. The results of the Monte Carlo tests show that the successful pursuit ratio of the proposed method is over 91% for all the given scenarios.

Sign in / Sign up

Export Citation Format

Share Document