FAST - Synchronous Frontier Allocation for Scalable Online Multi-Robot Terrain Coverage

We propose Frontier Allocation Synchronized by Token passing (FAST), a distributed algorithm for online terrain coverage using multiple mobile robots, ensuring mutually exclusive selection of frontier cells. Many existing approaches cover the terrain in an irregular fashion, without considering the usability of the already covered region. For instance, in the task of floor cleaning in an office building, these approaches do not guarantee the cleanliness of large unbroken areas until a majority of the task is complete. FAST on the other hand, incrementally traverses the terrain generating structured trajectories for each robot. Following a structured trajectory for coverage path planning is proven to be a very powerful approach in literature. This renders large portions of the terrain usable even before the completion of the coverage task. The novel map representation techniques used in FAST render it scalable to large terrains, without affecting the volume of communication among robots. Moreover, the distributed nature of FAST allows incorporation of fault-tolerance mechanisms. Empirical investigations on maps of varied complexities and sizes both in simulation and on an A. Gautam ( ) · B. Jha · G. Kumar · J. K. Murthy · SP A. Ram · S. Mohan INSPIRE (Integrated Swarm Planning and Intelligent Robotics Engineering) Lab Birla Institute of Technology and Science, Pilani, India e-mail: avinash@pilani.bits-pilani.ac.in experimental test-bed demonstrate that the proposed algorithm performs better than some of the benchmark approaches in terms of coverage completion time and less redundant coverage.

[1]  Kamal Kant Bharadwaj,et al.  Multi-robot exploration and terrain coverage in an unknown environment , 2012, Robotics Auton. Syst..

[2]  Sven Koenig,et al.  Building Terrain-Covering Ant Robots: A Feasibility Study , 2004, Auton. Robots.

[3]  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).

[4]  François Charpillet,et al.  Multi-robot exploration of unknown environments with identification of exploration completion and post-exploration rendezvous using ant algorithms , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Barbara Webb,et al.  Simulated and situated models of chemical trail following in ants , 1998 .

[6]  Gourav Kumar,et al.  Cluster, Allocate, Cover: An Efficient Approach for Multi-robot Coverage , 2015, 2015 IEEE International Conference on Systems, Man, and Cybernetics.

[7]  Sonal Jain,et al.  Multirobot Forest Coverage for Weighted and Unweighted Terrain , 2010, IEEE Transactions on Robotics.

[8]  Noam Hazon,et al.  Redundancy, Efficiency and Robustness in Multi-Robot Coverage , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[9]  K. Madhava Krishna,et al.  A two phase recursive tree propagation based multi-robotic exploration framework with fixed base station constraint , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[10]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[11]  Enrique Gonzalez,et al.  Multirobot Cooperative Model Applied to Coverage of Unknown Regions , 2011 .

[12]  L. Wu,et al.  A new global optimization strategy for coordinated multi-robot exploration: Development and comparative evaluation , 2011, Robotics Auton. Syst..

[13]  Prithviraj Dasgupta,et al.  A Repartitioning Algorithm to Guarantee Complete, Non-overlapping Planar Coverage with Multiple Robots , 2014, DARS.

[14]  Marc Carreras,et al.  A survey on coverage path planning for robotics , 2013, Robotics Auton. Syst..

[15]  Alan C. Schultz,et al.  Mobile robot exploration and map-building with continuous localization , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

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

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

[18]  Mark Levene,et al.  Rapid exploration of unknown areas through dynamic deployment of mobile and stationary sensor nodes , 2009, Autonomous Agents and Multi-Agent Systems.

[19]  Wolfram Burgard,et al.  Coordinated multi-robot exploration using a segmentation of the environment , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[20]  Enrique González,et al.  BSA: a coverage algorithm , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

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

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

[23]  Arturo Gil,et al.  A comparison of path planning strategies for autonomous exploration and mapping of unknown environments , 2012, Auton. Robots.

[24]  Arian Maleki,et al.  Geodesic K-means clustering , 2008, 2008 19th International Conference on Pattern Recognition.

[25]  Mark Levene,et al.  Brick& Mortar: an on-line multi-agent exploration algorithm , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.