改良DARPアルゴリズムに基づくマルチロボット被覆経路計画
A Multi-robot Coverage Path Planning Algorithm Based on Improved DARP Algorithm
A*ベースの改良DARPでタスクを割り当て、Up-FirstベースのSTCで領域を完全被覆するマルチロボット経路計画手法を提案し、従来のDARPより高効率・高被覆率を実現した。
著者: Yufan Huang, Man Li, Tao Zhao
分類: cs.RO
原文アブストラクト
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.
