The research on multi-robot coverage path planning (CPP) has been attracting more and more attention. In order to achieve efficient coverage, this paper proposes an improved DARP coverage algorithm. The improved DARP algorithm based on A* algorithm is used to assign tasks to robots and then combined with STC algorithm based on Up-First algorithm to achieve full coverage of the task area. Compared with the initial DARP algorithm, this algorithm has higher efficiency and higher coverage rate.
翻译:多机器人覆盖路径规划(CPP)的研究越来越受到关注。为了实现高效的覆盖,本文提出了一种改进的DARP覆盖算法。该算法基于A*算法的改进型DARP算法用于将任务分配给机器人,然后与基于Up-First算法的STC算法相结合,实现了任务区域的全面覆盖。与初始DARP算法相比,该算法具有更高的效率和更高的覆盖率。