APF-CPP: An Artificial Potential Field Based Multi-Robot Online Coverage Path Planning Approach

被引:7
作者
Wang, Zikai [1 ]
Zhao, Xiaoqi [1 ]
Zhang, Jiekai [2 ]
Yang, Nachuan [1 ]
Wang, Pengyu [1 ,3 ]
Tang, Jiawei [1 ]
Zhang, Jiuzhou [1 ]
Shi, Ling [1 ]
机构
[1] Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Clear Water Bay, Hong Kong, Peoples R China
[2] Hong Kong Appl Sci & Technol Res Inst Co Ltd, Hong Kong, Peoples R China
[3] Southern Univ Sci & Technol, Dept Elect & Elect Engn, Shenzhen Key Lab Robot Percept & Intelligence, Shenzhen 518055, Peoples R China
关键词
Robots; Robot kinematics; Task analysis; Path planning; Multi-robot systems; Planning; Resource management; Autonomous agents; multi-robot systems; path planning for multiple mobile robots or agents; planning; planning under uncertainty; scheduling and coordination;
D O I
10.1109/LRA.2024.3432351
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Multi-robot coverage planning has gained significant attention in recent years. In this letter, we introduce a novel approach called APF-CPP (Artificial Potential Field Based Multi-Robot Online Coverage Path Planning) to enhance the collaboration of multi-robot systems to accomplish coverage tasks in unknown dynamic environments. Our approach presents a unique coverage policy that leverages the concept of artificial potential field (APF). In contrast to the conventional APF-based path planning methods that directly generate paths based on the field gradient, we utilize the APF to derive coverage policies for individual robots within a multi-robot system to achieve efficient task allocation and maintain regular coverage patterns. We have developed a policy update mechanism that allows the system to adapt its task allocation policy based on real-time conditions while minimizing the impact caused by policy changes. To better handle dead-end conditions, we use the APF concept to allocate tasks better during the dead-end recovery process. We also show that our algorithm has a low computational complexity and guarantees complete coverage in a finite time. We conduct extensive comparisons with other state-of-the-art (SOTA) approaches and validate our method through simulations and real-world experiments. The experimental results demonstrate the advantages of our proposed method over existing approaches and confirm the effectiveness and robustness of real-world implementation.
引用
收藏
页码:9199 / 9206
页数:8
相关论文
共 27 条
[1]   Coordinated multi-robot exploration [J].
Burgard, W ;
Moors, M ;
Stachniss, C ;
Schneider, FE .
IEEE TRANSACTIONS ON ROBOTICS, 2005, 21 (03) :376-386
[2]   Scalable Coverage Path Planning of Multi-Robot Teams for Monitoring Non-Convex Areas [J].
Collins, Leighton ;
Ghassemi, Payam ;
Esfahani, Ehsan T. ;
Doermann, David ;
Dantu, Karthik ;
Chowdhury, Souma .
2021 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA 2021), 2021, :7393-7399
[3]  
Galceran E, 2014, IEEE INT CONF ROBOT, P6586, DOI 10.1109/ICRA.2014.6907831
[4]  
Ghassemi Payam, 2019, 2019 International Symposium on Multi-Robot and Multi-Agent Systems (MRS), P83, DOI 10.1109/MRS.2019.8901062
[5]  
Harabor D., 2011, P AAAI C ART INT AUG, V25, P1114, DOI DOI 10.1609/AAAI.V25I1.7994
[6]   PPCPP: A Predator-Prey-Based Approach to Adaptive Coverage Path Planning [J].
Hassan, Mahdi ;
Liu, Dikai .
IEEE TRANSACTIONS ON ROBOTICS, 2020, 36 (01) :284-301
[7]   Dec-PPCPP: A Decentralized Predator-Prey-based Approach to Adaptive Coverage Path Planning Amid Moving Obstacles [J].
Hassan, Mandi ;
Mustafic, Daut ;
Liu, Dikai .
2020 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2020, :11732-11739
[8]  
Hazon N, 2005, IEEE INT CONF ROBOT, P735
[9]   Voronoi-Based Multi-Robot Autonomous Exploration in Unknown Environments via Deep Reinforcement Learning [J].
Hu, Junyan ;
Niu, Hanlin ;
Carrasco, Joaquin ;
Lennox, Barry ;
Arvin, Farshad .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2020, 69 (12) :14413-14423
[10]  
Ianenko A, 2020, IEEE DECIS CONTR P, P4099, DOI 10.1109/CDC42340.2020.9304030