A Decentralized Multi-Agent Path Planning Approach Based on Imitation Learning and Selective Communication

被引:1
|
作者
Feng, Bohan [1 ]
Bi, Youyi [1 ]
Li, Mian [2 ]
Lin, Liyong [3 ]
机构
[1] Shanghai Jiao Tong Univ, Univ Michigan Shanghai Jiao Tong Univ Joint Inst, 800 Dongchuan Rd, Shanghai 200240, Peoples R China
[2] Shanghai Jiao Tong Univ, Global Inst Future Technol, 800 Dongchuan Rd, Shanghai 200240, Peoples R China
[3] Contemporary Amperex Technol Co Ltd, 2 Xingang Rd, Ningde 352100, Fujian, Peoples R China
基金
国家重点研发计划;
关键词
decentralized control; multi-agent path planning; mobile robot; selective communication; machine learning for engineering applications;
D O I
10.1115/1.4065167
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Multi-agent path planning (MAPP) is crucial for large-scale mobile robot systems to work safely and properly in complex environments. Existing learning-based decentralized MAPP approaches allow each agent to gather information from nearby agents, leading to more efficient coordination among agents. However, these approaches often struggle with reasonably handling local information inputs for each agent, and their communication mechanisms between agents need to be further refined to treat those congested traffic scenarios effectively. To address these issues, we propose a decentralized MAPP approach based on imitation learning and selective communication. Our approach adopts an imitation learning architecture that enables agents to rapidly learn complex behaviors from expert planning experience. The information extraction layer is integrated with convolutional neural network (CNN) and gated recurrent unit (GRU) for capturing features from local field-of-view observations. A two-stage selective communication process based on graph attention neural network (GAT) is developed to reduce the required neighbor agents in inter-agent communication. In addition, an adaptive strategy switching mechanism utilizing local expert-planned paths is designed to support robots to escape from local traps. The effectiveness of our proposed approach is evaluated in simulated grid environments with varying map sizes, obstacle densities, and numbers of agents. Experimental results show that our approach outperforms other decentralized path planning methods in success rate while maintaining the lowest flowtime variation and communication frequency. Furthermore, our approach is computationally efficient and scalable, making it suitable for real-world applications.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] A DECENTRALIZED MULTI-AGENT PATH PLANNING APPROACH BASED ON IMITATION LEARNING AND GLOBAL STATIC FEATURE EXTRACTION
    Feng, Bohan
    Bi, Youyi
    Li, Mian
    Lin, Liyong
    PROCEEDINGS OF ASME 2023 INTERNATIONAL MECHANICAL ENGINEERING CONGRESS AND EXPOSITION, IMECE2023, VOL 6, 2023,
  • [2] Learning Selective Communication for Multi-Agent Path Finding
    Ma, Ziyuan
    Luo, Yudong
    Pan, Jia
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2022, 7 (02) : 1455 - 1462
  • [3] Decentralized path planning for multi-agent teams with complex constraints
    Vishnu R. Desaraju
    Jonathan P. How
    Autonomous Robots, 2012, 32 : 385 - 403
  • [4] Decentralized path planning for multi-agent teams with complex constraints
    Desaraju, Vishnu R.
    How, Jonathan P.
    AUTONOMOUS ROBOTS, 2012, 32 (04) : 385 - 403
  • [5] Planning and Learning in Multi-Agent Path Finding
    K. S. Yakovlev
    A. A. Andreychuk
    A. A. Skrynnik
    A. I. Panov
    Doklady Mathematics, 2022, 106 : S79 - S84
  • [6] Planning and Learning in Multi-Agent Path Finding
    Yakovlev, K. S.
    Andreychuk, A. A.
    Skrynnik, A. A.
    Panov, A. I.
    DOKLADY MATHEMATICS, 2022, 106 (SUPPL 1) : S79 - S84
  • [7] Multi-agent reinforcement learning as a rehearsal for decentralized planning
    Kraemer, Landon
    Banerjee, Bikramjit
    NEUROCOMPUTING, 2016, 190 : 82 - 94
  • [8] A Decentralized Token-Based Negotiation Approach for Multi-Agent Path Finding
    Eran, Cihan
    Keskin, M. Onur
    Canturk, Furkan
    Aydogan, Reyhan
    MULTI-AGENT SYSTEMS, EUMAS 2021, 2021, 12802 : 264 - 280
  • [9] Multi-agent Coverage Path Planning Based on Security Reinforcement Learning
    Li S.
    Ma Z.
    Zhang Y.
    Shao J.
    Binggong Xuebao/Acta Armamentarii, 2023, 44 : 101 - 113
  • [10] Multi-Agent Path Finding with Prioritized Communication Learning
    Li, Wenhao
    Chen, Hongjun
    Jin, Bo
    Tan, Wenzhe
    Zha, Hongyuan
    Wang, Xiangfeng
    2022 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, ICRA 2022, 2022, : 10695 - 10701