Multi-robot exploration and rendezvous on graphs

We address the problem of arranging a meeting (or rendezvous) between two or more robots in an unknown bounded topological environment, starting at unknown locations, without any communication. The goal is to rendezvous in minimum time such that the robots can share resources for performing any global task. We specifically consider a global exploration task executed by two or more robots. Each robot explores the environment simultaneously, for a specified time, then selects potential rendezvous locations, where it expects to find other robots, and visits them. We propose a ranking criterion for selecting the order in which potential rendezvous locations will be visited. This ranking criterion associates a cost for visiting a rendezvous location and gives an expected reward of finding other agents. We evaluate the time taken to rendezvous by varying a set of conditions including: world size, number of robots, starting location of each robot and the presence of sensor noise. We present simulation results to quantify the effect of the aforementioned factors on the rendezvous time.

[1]  Gregory Dudek,et al.  Collaborative Robot Exploration and Rendezvous: Algorithms, Performance Bounds and Observations , 2001, Auton. Robots.

[2]  Steve Alpern,et al.  How to hide information for later use on networks , 2009, 2009 International Conference on Game Theory for Networks.

[3]  Wolfram Burgard,et al.  Emergent Task Allocation for Mobile Robots , 2008 .

[4]  Shmuel Gal,et al.  The theory of search games and rendezvous , 2002, International series in operations research and management science.

[5]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003 .

[6]  Michael R. M. Jenkin,et al.  Map validation and robot self-location in a graph-like world , 1997, Robotics Auton. Syst..

[7]  Kurt Konolige,et al.  Distributed multirobot exploration, mapping, and task allocation , 2008, Annals of Mathematics and Artificial Intelligence.

[8]  Wolfram Burgard,et al.  Collaborative multi-robot exploration , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[9]  Howie Choset,et al.  Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach , 2008, Annals of Mathematics and Artificial Intelligence.

[10]  Gregory Dudek,et al.  Multi-robot collaboration for robust exploration , 2004, Annals of Mathematics and Artificial Intelligence.

[11]  Stephen Cameron,et al.  Selection of Rendezvous Points for Multi−Robot Exploration in Dynamic Environments , 2010 .

[12]  Gregory Dudek,et al.  Combining Multi-robot Exploration and Rendezvous , 2011, 2011 Canadian Conference on Computer and Robot Vision.

[13]  Evangelos Kranakis,et al.  Mobile Agent Rendezvous: A Survey , 2006, SIROCCO.