Cooperative Pursuit with Multi-Pursuer and One Faster Free-moving Evader
About
This paper addresses a multi-pursuer single-evader pursuit-evasion game where the free-moving evader moves faster than the pursuers. Most of the existing works impose constraints on the faster evader such as limited moving area and moving direction. When the faster evader is allowed to move freely without any constraint, the main issues are how to form an encirclement to trap the evader into the capture domain, how to balance between forming an encirclement and approaching the faster evader, and what conditions make the capture possible. In this paper, a distributed pursuit algorithm is proposed to enable pursuers to form an encirclement and approach the faster evader. An algorithm that balances between forming an encirclement and approaching the faster evader is proposed. Moreover, sufficient capture conditions are derived based on the initial spatial distribution and the speed ratios of the pursuers and the evader. Simulation and experimental results on ground robots validate the effectiveness and practicability of the proposed method.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Target Capture | Scenario I | Success Rate100 | 6 | |
| Target Capture | Scenario III | Success Rate20 | 6 | |
| Target Capture | Scenario II | Success Rate40 | 6 | |
| Pursuit-Evasion | Real-world Pursuit-Evasion vs. AMSPBH Evader | Capture Count (C)0.00e+0 | 4 |