mlsanityData to 13 Oct 2026

Cooperative Pursuit with Multi-Pursuer and One Faster Free-moving Evader

arXiv 2001.04731 ↗First posted 14 Jan 2020eess.SY cs.SYcited by 8

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 8 papers in the map (data through 13 Oct 2026). First posted on arXiv 14 Jan 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 3; 2024: 2; 2025: 2.

8 papers.