A sampling-based algorithm for multi-robot visibility-based pursuit-evasion

We introduce a probabilistically complete algorithm for solving a visibility-based pursuit-evasion problem in two-dimensional polygonal environments with multiple pursuers. The inputs for our algorithm are an environment and the initial positions of the pursuers. The output is a joint strategy for t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the ... IEEE/RSJ International Conference on Intelligent Robots and Systems s. 1782 - 1789
Hlavní autoři: Stiffler, Nicholas M., O'Kane, Jason M.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2014
Témata:
Abstracts
Complexity theory
Design automation
Games
Generators
Joints
Polynomials
ISSN:2153-0858
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We introduce a probabilistically complete algorithm for solving a visibility-based pursuit-evasion problem in two-dimensional polygonal environments with multiple pursuers. The inputs for our algorithm are an environment and the initial positions of the pursuers. The output is a joint strategy for the pursuers that guarantees that the evader has been captured. We create a Sample-Generated Pursuit-Evasion Graph (SG-PEG) that utilizes an abstract sample generator to search the pursuers' joint configuration space for a pursuer solution strategy that captures the evaders. We implemented our algorithm in simulation and provide results.
ISSN:2153-0858
DOI:10.1109/IROS.2014.6942796