DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path Planning

• Published in: Journal of intelligent & robotic systems Vol. 86; no. 3-4; pp. 663 - 680
• Main Authors: Kapoutsis, Athanasios Ch, Chatzichristofis, Savvas A., Kosmatopoulos, Elias B.
• Format: Journal Article
• Language: English
• Published: Dordrecht Springer Netherlands 01.06.2017; Springer Nature B.V
• Subjects: Algorithms; Artificial Intelligence; Complexity; Control; Electrical Engineering; Engineering; Mathematical analysis; Mathematical models; Mechanical Engineering; Mechatronics; Optimization; Path planning; Polynomials; Robotics; Robots; Minimum coverage paths; Terrain sub-division; Complete coverage; mCPP; Multi-robots
• ISSN: 0921-0296; 1573-0409
• DOI: 10.1007/s10846-016-0461-x

This paper deals with the path planning problem of a team of mobile robots, in order to cover an area of interest, with prior-defined obstacles. For the single robot case, also known as single robot coverage path planning (CPP), an 𝓞( n ) optimal methodology has already been proposed and evaluated in the literature, where n is the grid size. The majority of existing algorithms for the multi robot case (mCPP), utilize the aforementioned algorithm. Due to the complexity, however, of the mCPP, the best the existing mCPP algorithms can perform is at most 16 times the optimal solution, in terms of time needed for the robot team to accomplish the coverage task, while the time required for calculating the solution is polynomial. In the present paper, we propose a new algorithm which converges to the optimal solution, at least in cases where one exists. The proposed technique transforms the original integer programming problem (mCPP) into several single-robot problems (CPP), the solutions of which constitute the optimal mCPP solution, alleviating the original mCPP explosive combinatorial complexity. Although it is not possible to analytically derive bounds regarding the complexity of the proposed algorithm, extensive numerical analysis indicates that the complexity is bounded by polynomial curves for practical sized inputs. In the heart of the proposed approach lies the DARP algorithm, which divides the terrain into a number of equal areas each corresponding to a specific robot, so as to guarantee complete coverage , non-backtracking solution , minimum coverage path , while at the same time does not need any preparatory stage (video demonstration and standalone application are available on-line http://tinyurl.com/DARP-app ).