Optimal Multirobot Coverage Path Planning: Ideal-Shaped Spanning Tree

The present paper attempts to find the optimal coverage path for multiple robots in a given area including obstacles. For single robot coverage path planning (CPP) problem, an improved ant colony optimization (ACO) algorithm is proposed to construct the best spanning tree and then obtain the optimal path, which contributes to minimizing the energy/time consumption. For the multirobot case, first the DARP (Divide Areas based on Robots Initial Positions) algorithm is utilized to divide the area into separate equal subareas, so much so that it transforms the mCPP problem into several CPP problems, degrading the computation complexity. During the second phase, spanning tree in each subarea is constructed by the aforementioned algorithm. In the last phase, the specific end nodes are exchanged among subareas to achieve ideal-shaped spanning trees, which can also decrease the number of turns in coverage path. And the complete algorithms are proven to be approximately polynomial algorithms. Finally, the simulation confirms the complete algorithms’ advantages: complete coverage, nonbacktracks, minimum length, zero preparation time, and the least number of turns.

[1]  Agathoniki Trigoni,et al.  Supporting Search and Rescue Operations with UAVs , 2010, 2010 International Conference on Emerging Security Technologies.

[2]  A. Rubinstein.  Perfect Equilibrium in a Bargaining Model , 1982 .

[3]  Howie Choset,et al.  Morse Decompositions for Coverage Tasks , 2002, Int. J. Robotics Res..

[4]  Noa Agmon,et al.  Constructing spanning trees for efficient multi-robot coverage , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[5]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[6]  Hannah Bast,et al.  The Area Partitioning Problem , 2000, CCCG.

[7]  Ken Goldberg,et al.  Robotics: Countering singularity sensationalism , 2015, Nature.

[8]  P. B. Sujit,et al.  Multiple UAV area decomposition and coverage , 2013, 2013 IEEE Symposium on Computational Intelligence for Security and Defense Applications (CISDA).

[9]  Wolfram Burgard,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[10]  Timothy W. McLain,et al.  Cooperative forest fire surveillance using a team of small unmanned air vehicles , 2006, Int. J. Syst. Sci..

[11]  Vladimir J. Lumelsky,et al.  Polygon Area Decomposition for Multiple-Robot Workspace Division , 1998, Int. J. Comput. Geom. Appl..

[12]  A. Ollero,et al.  Multiple UAV cooperative searching operation using polygon area decomposition and efficient coverage algorithms , 2004, DARS.

[13]  M. Er,et al.  Coverage path planning for UAVs based on enhanced exact cellular decomposition method , 2011 .

[14]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[15]  R. Siegwart,et al.  A UAV system for inspection of industrial facilities , 2013, 2013 IEEE Aerospace Conference.

[16]  Howie Choset,et al.  Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .

[17]  Sonal Jain,et al.  Multi-robot forest coverage , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[18]  Noa Agmon,et al.  Multi-Robot Area Patrol under Frequency Constraints , 2007, ICRA.

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

[20]  Elias B. Kosmatopoulos,et al.  DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path Planning , 2017, J. Intell. Robotic Syst..

[21]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[22]  Howie Choset,et al.  Exact cellular decompositions in terms of critical points of Morse functions , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

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

[24]  Noa Agmon,et al.  Multi-robot area patrol under frequency constraints , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

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

[26]  Elon Rimon.  Spanning-Tree Based Cov erage of Contin uousAreas b ya Mobile Robot , 2001 .