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žené v:
Podrobná bibliografia
Vydané v:Proceedings of the ... IEEE/RSJ International Conference on Intelligent Robots and Systems s. 1782 - 1789
Hlavní autori: Stiffler, Nicholas M., O'Kane, Jason M.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.09.2014
Predmet:
Abstracts
Complexity theory
Design automation
Games
Generators
Joints
Polynomials
ISSN:2153-0858
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
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