Coordinated exploration of unknown labyrinthine environments applied to the pursuit evasion problem

Authors:
Damien Pellier;Humbert Fiorino
Affiliations:
Laboratoire Leibniz (CNRS - INPG - IMAG), Equipe MAGMA, Grenoble;Laboratoire Leibniz (CNRS - INPG - IMAG), Equipe MAGMA, Grenoble
Venue:
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Year:
2005

Citing 8
Cited 4

Min cut is NP-complete for edge weighted trees

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Monotonicity in graph searching

Journal of Algorithms
The two guards problem

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Searching for a mobile intruder in a polygonal region

SIAM Journal on Computing
Recontamination does not help to search a graph

Journal of the ACM (JACM)
A game theoretic approach to distributed artificial intelligence and the pursuit problem (abstract)

ACM SIGOIS Bulletin
An optimal algorithm for the two-guard problem

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Visibility-based pursuit-evasion with limited field of view

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence

Agent-based coordination of human-multirobot teams in complex environments

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: Industry track
Resolving the pursuit evasion problem in known environment using graph theory

International Journal of Bio-Inspired Computation
Algorithms and complexity results for graph-based pursuit evasion

Autonomous Robots
A graph search algorithm for indoor pursuit/evasion

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a multi-robot cooperation approach to solve the pursuit evasion problem for mobile robots that have omnidirectional vision sensors in unknown environments. The main characteristic of this approach is based on the robots cooperation by sharing knowledge and making them work as a team: a complete algorithm for computing robots motion strategy is presented as well as the deliberation protocol which distributes the exploration task among the team and takes the best possible outcome from the robots resources.