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

Author:

Feng Bohan1,Bi Youyi1,Li Mian2,Lin Liyong3

Affiliation:

1. Shanghai Jiao Tong University University of Michigan—Shanghai Jiao Tong University Joint Institute, , 800 Dongchuan Road, Minhang District, Shanghai 200240 , China

2. Shanghai Jiao Tong University Global Institute of Future Technology, , 800 Dongchuan Road, Minhang District, Shanghai 200240 , China

3. Contemporary Amperex Technology Co., Limited , 2 Xingang Road, Zhangwan Town, Jiaocheng District, Ningde, Fujian 352100 , China

Abstract

Abstract 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.

Funder

Ministry of Science and Technology of the People's Republic of China

Publisher

ASME International

Reference28 articles.

1. Automated Guided Vehicle Systems, State-of-the-Art Control Algorithms and Techniques;De Ryck;J. Manuf. Syst.,2020

2. A Heuristic Scaling Strategy for Multi-Robot Cooperative Three-Dimensional Printing;Poudel;ASME J. Comput. Inf. Sci. Eng.,2020

3. An Extended Bayesian Optimization Approach to Decentralized Swarm Robotic Search;Ghassemi;ASME J. Comput. Inf. Sci. Eng.,2020

4. Conflict-Based Search for Optimal Multi-agent Pathfinding;Sharon;Artif. Intell.,2015

5. M*: A Complete Multirobot Path Planning Algorithm With Performance Bounds;Wagner,2011

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3