A Flooding Algorithm for Multirobot Exploration

In this paper, we present a multirobot exploration algorithm that aims at reducing the exploration time and to minimize the overall traverse distance of the robots by coordinating the movement of the robots performing the exploration. Modeling the environment as a tree, we consider a coordination model that restricts the number of robots allowed to traverse an edge and to enter a vertex during each step. This coordination is achieved in a decentralized manner by the robots using a set of active landmarks that are dropped by them at explored vertices. We mathematically analyze the algorithm on trees, obtaining its main properties and specifying its bounds on the exploration time. We also define three metrics of performance for multirobot algorithms. We simulate and compare the performance of this new algorithm with those of our multirobot depth first search (MR-DFS) approach presented in our recent paper and classic single-robot DFS.

[1]  Andreas Birk,et al.  Multi-robot exploration under the constraints of wireless networking , 2007 .

[2]  Albert Solé Ribalta,et al.  Voronoi-based space partitioning for coordinated multi-robot exploration , 2007 .

[3]  Gregorio Toscano Pulido,et al.  Multi-robot Exploration and Mapping Using Self Biddings and Stop Signals , 2008, MICAI.

[4]  Sven Koenig,et al.  Robot exploration with combinatorial auctions , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[5]  Gaurav S. Sukhatme,et al.  The Design and Analysis of an Efficient Local Algorithm for Coverage and Exploration Based on Sensor Network Deployment , 2007, IEEE Transactions on Robotics.

[6]  Hans P. Moravec.  Sensor Fusion in Certainty Grids for Mobile Robots , 1988, AI Mag..

[7]  Xiaotie Deng,et al.  Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[9]  Xiaotie Deng,et al.  How to learn an unknown environment. I: the rectilinear case , 1998, JACM.

[10]  Jizhong Xiao,et al.  Multi-robot flooding algorithm for the exploration of unknown indoor environments , 2010, 2010 IEEE International Conference on Robotics and Automation.

[11]  Baruch Schieber,et al.  Navigating in unfamiliar geometric terrain , 1991, STOC '91.

[12]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[13]  Michael A. Bender,et al.  The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.

[14]  Ning Xi,et al.  Coordinated multi-robot real-time exploration with connectivity and bandwidth awareness , 2010, 2010 IEEE International Conference on Robotics and Automation.

[15]  Anthony Stentz,et al.  Multi-robot exploration controlled by a market economy , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[16]  M. Ani Hsieh,et al.  Maintaining network connectivity and performance in robot teams , 2008, J. Field Robotics.

[17]  Jindong Tan,et al.  Distributed multi-robot coordination in area exploration , 2006, Robotics Auton. Syst..

[18]  Robin R. Murphy,et al.  Rescue robots for mudslides: A descriptive study of the 2005 La Conchita mudslide response , 2008, J. Field Robotics.

[19]  Andrea Gasparri,et al.  Multirobot Tree and Graph Exploration , 2011, IEEE Transactions on Robotics.

[20]  Brian Yamauchi,et al.  Frontier-based exploration using multiple robots , 1998, AGENTS '98.

[21]  Wolfram Burgard,et al.  Coordinated multi-robot exploration , 2005, IEEE Transactions on Robotics.

[22]  Friedhelm Meyer auf der Heide,et al.  Smart Robot Teams Exploring Sparse Trees , 2006, MFCS.

[23]  Andrzej Pelc,et al.  Optimal graph exploration without good maps , 2002, Theor. Comput. Sci..

[24]  V. S. Anil Kumar,et al.  Optimal constrained graph exploration , 2001, SODA '01.

[25]  Mona Singh,et al.  Piecemeal Graph Exploration by a Mobile Robot , 1999, Inf. Comput..

[26]  Noury Bouraqadi,et al.  Distributed Constraint Reasoning Applied to Multi-robot Exploration , 2009, 2009 21st IEEE International Conference on Tools with Artificial Intelligence.

[27]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[28]  Andrzej Pelc,et al.  Impact of topographic information on graph exploration efficiency , 2000, Networks.

[29]  Andrzej Pelc,et al.  Exploring unknown undirected graphs , 1999, SODA '98.

[30]  Michael Jenkin,et al.  Robotic exploration as graph construction , 1991, IEEE Trans. Robotics Autom..

[31]  Anthony Stentz,et al.  Opportunistic optimization for market-based multirobot control , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.