Improved analysis of a multirobot graph exploration strategy

In this paper, we present an algorithm for exploring an unknown graph with opaque edges by multiple robots. We show that this algorithm is near optimal on graphs with n vertices and superlinear number of edges (i.e., ω(n) edges), and give an adversarial construction to show that the algorithm does n...

Full description

Saved in:
Bibliographic Details
Published in2014 13th International Conference on Control Automation Robotics & Vision (ICARCV) pp. 1906 - 1910
Main Authors Brass, Peter, Vigan, Ivo, Ning Xu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2014
Subjects
Bipartite graph
Collision avoidance
Computer science
Electronic mail
Graph Exploration
Mapping
Mobile robots
On-line Algorithm
Path Planning for Multiple Mobile Robot Systems
Upper bound
Online AccessGet full text
DOI10.1109/ICARCV.2014.7064607

Cover

More Information
Summary:In this paper, we present an algorithm for exploring an unknown graph with opaque edges by multiple robots. We show that this algorithm is near optimal on graphs with n vertices and superlinear number of edges (i.e., ω(n) edges), and give an adversarial construction to show that the algorithm does not perform well on cyclic graphs with O(n) edges.
DOI:10.1109/ICARCV.2014.7064607