A Graph Partitioning Approach for Fast Exploration with Multi-Robot Coordination

A multi-robot exploration approach is suggested in this paper that works on the premise that the topo-metric map of the indoor environment is known a priori. Genetic Algorithms (GAs) are used for spatial partitioning of the topo-metric graph of the environment. Each spatial partition, which represents the sub-graph, is apportioned to a unique robot by using the Hungarian method for task assignment in conjunction with Bully Algorithm for leader election. In the case of robot(s) failure, graph re-partitioning and single item auctions are used for re-assigning the remaining task(s) of the failed robot(s) to other robots. The proposed approach performs better than a recent state-of-the-art strategy that employs Delaunay triangulation and multi-prim algorithm for multi-robot exploration. Empirical results obtained in simulation by varying the number of robots in two different and complex environments prove the efficacy of the proposed approach.

[1]  Philippe Pasquier,et al.  Complete and robust cooperative robot area coverage with limited range , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[2]  Wolfram Burgard,et al.  Speeding-Up Robot Exploration by Exploiting Background Information , 2016, IEEE Robotics and Automation Letters.

[3]  Wolfram Burgard,et al.  Speeding-up multi-robot exploration by considering semantic place information , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

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

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

[6]  Nicola Basilico,et al.  Exploration strategies based on multi-criteria decision making for searching environments in rescue operations , 2011, Auton. Robots.

[7]  Hoon Choi,et al.  The Fast Bully Algorithm: For Electing a Coordinator Process in Distributed Systems , 2002, ICOIN.

[8]  Thomas Hellström,et al.  Kinematics Equations for Differential Drive and Articulated Steering , 2011 .

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

[10]  R. C. Coulter,et al.  Implementation of the Pure Pursuit Path Tracking Algorithm , 1992 .

[11]  V. Cutello,et al.  Graph partitioning using genetic algorithms with ODPX , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[12]  Dilip Kumar Pratihar,et al.  Task allocation and collision-free path planning of centralized multi-robots system for industrial plant inspection using heuristic methods , 2016, Robotics Auton. Syst..

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

[14]  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.

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

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

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

[18]  Byung Ro Moon,et al.  A Hybrid Genetic Algorithm for Multiway Graph Partitioning , 2000, GECCO.

[19]  Janka Chlebíková,et al.  Approximating the Maximally Balanced Connected Partition Problem in Graphs , 1996, Inf. Process. Lett..

[20]  M. Masar A biologically inspired swarm robot coordination algorithm for exploration and surveillance , 2013, 2013 IEEE 17th International Conference on Intelligent Engineering Systems (INES).

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