RP-MSTC*: Multi-Agent Coverage Path Planning Algorithm Emphasizing Local Area Updates

Compared to traditional area coverage algorithms, this paper proposes a re-plannable multi-agent coverage path planning algorithm to address issues such as low coverage rate of multiple agents in large-scale scenarios like warehouses and inability to cope with local environmental changes. Initially, the MSTC
^*
algorithm is utilized to create the coverage path based on the available map information. To address scenarios like idle areas for material placement, the method introduces local area detection and path re-planning to enhance the coverage rate. This paper verifies the feasibility and effectiveness of the algorithm under different maps through simulation experiments. Compared with the coverage situation of other coverage path planning algorithms in environments with local area updates, the algorithm proposed in this paper has a higher coverage rate in this scenario.