Complete Coverage Path Planning for Multi-Robots
Sang‐Hyun Nam, Ik-Sang Shin, Jae-Jun Kim, Soon‐Geul Lee · Journal of the Korean Society for Precision Engineering · 2009
This paper describes a path planning algorithm, which is the minimal turning path based on the shape and size of the cell to clean up the whole area with two cleaning robots. Our method divides the whole cleaning area with each cell by cellular decomposition, and then provides some path plans among of the robots to reduce the rate of energy consumption and cleaning time of it. In addition we suggest how to plan between the robots especially when they are cleaning in the same cell. Finally simulation results demonstrate the effectiveness of the algorithm in an unknown area with multiple robots. And then we compare the performance index of two algorithms such as total of turn, total of time.