2016
DOI: 10.1016/j.automatica.2016.05.007
|View full text |Cite
|
Sign up to set email alerts
|

Cooperative pursuit with Voronoi partitions

Abstract: This work considers a pursuit-evasion game in which a number of pursuers are attempting to capture a single evader. Cooperation among multiple agents can be difficult to achieve, as it may require the selection of actions in the joint input space of all agents. This work presents a decentralized, real-time algorithm for cooperative pursuit of a single evader by multiple pursuers in bounded, simply-connected planar domains. The algorithm is based on minimizing the area of the generalized Voronoi partition of th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

1
74
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 169 publications
(75 citation statements)
references
References 25 publications
1
74
0
Order By: Relevance
“…An alternative is to exploit special simplified settings to derive a specific strategy that guarantees capture (not necessarily optimizing any specific criterion). One approach, taken by Zhou et al (22), is to compute the Voronoi cell of the evader, i.e., the set of points that the evader can reach before the pursuer. The control law derived by Zhou et al (22) minimizes the instantaneous time rate of change of the area of the evader's Voronoi cell.…”
Section: Approximate Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…An alternative is to exploit special simplified settings to derive a specific strategy that guarantees capture (not necessarily optimizing any specific criterion). One approach, taken by Zhou et al (22), is to compute the Voronoi cell of the evader, i.e., the set of points that the evader can reach before the pursuer. The control law derived by Zhou et al (22) minimizes the instantaneous time rate of change of the area of the evader's Voronoi cell.…”
Section: Approximate Methodsmentioning
confidence: 99%
“…One approach, taken by Zhou et al (22), is to compute the Voronoi cell of the evader, i.e., the set of points that the evader can reach before the pursuer. The control law derived by Zhou et al (22) minimizes the instantaneous time rate of change of the area of the evader's Voronoi cell. The authors went on to derive the minimizing control law and establish that this control law guarantees eventual capture, where capture is defined as the proximity condition x p − x e ≤ δ for some capture radius δ.…”
Section: Approximate Methodsmentioning
confidence: 99%
“…For example, Voronoi diagrams, dividing a plane into regions of points that are closest to a predetermined set of seed points, are widely used for generating strategies in pursuit-evasion games, usually when each player possesses the same speed. Especially in group pursuit of a single evader or multiple evaders, Voronoi-based approaches can provide very constructive cooperative strategies, such as minimizing the area of the generalized Voronoi partition of the evader [34], [35] or pursuing the evader in a relay way [36]. As for unequal speed scenarios, the Apollonius circle, first introduced by Isaacs, is a useful tool for analyzing the capture of a high-speed evader by using multiple pursuers [37], [38].…”
Section: Introductionmentioning
confidence: 99%
“…Specific applications of Voronoi-based coverage techniques to the problem of target tracking tend to focus on pursuer-evader games. Huang et al (2011) and Zhou et al (2016) consider the multiple-pursuers, single-evasion problem and formulate a decentralized algorithm to guarantee capture. Pan et al (2012) consider an interesting modification to this problem where some pursuers act as guards to prevent the evader from leaving the environment.…”
Section: Introductionmentioning
confidence: 99%