Neural Formation A*: A Knowledge-Data Hybrid-Driven Path Planning Algorithm for Multi-agent Formation Cooperation

被引:0
|
作者
Cai, Qi'ang [1 ,2 ]
Ai, Xiaolin [2 ]
Liu, Tianqi [1 ,2 ]
Pu, Zhiqiang [1 ,2 ]
Yi, Jianqiang [1 ,2 ]
Lv, Feng [3 ]
机构
[1] Univ Chinese Acad Sci, Sch Artificial Intelligence, Beijing 100049, Peoples R China
[2] Chinese Acad Sci, Inst Automat, Beijing 100190, Peoples R China
[3] J Elephant Technol Co, Beijing 100080, Peoples R China
来源
ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING-ICANN 2024, PT IV | 2024年 / 15019卷
基金
中国国家自然科学基金;
关键词
path planning; multi-agent systems; knowledge-data hybrid-driven;
D O I
10.1007/978-3-031-72341-4_19
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Efficient path planning method is crucial for multi-agent coordination tasks, such as cooperative transportation. The knowledge-driven approach has been widely employed. However, in problems with complex constraint conditions, the solution time of the knowledge-driven approach increases, accompanied by a degradation in solution quality. Motivated by this practical challenge, a knowledge-data hybrid-driven path planning algorithm named Neural Formation A* (NFA*) is proposed in this paper. It first utilizes a feature extraction network to transform the given environment map into a feature map. Path planning problem instances with ground-truth path are utilized to train the feature extraction network. Then, a map reconfiguration module is designed to inflate the area of obstacles in the environment to exclude infeasible nodes for multi-agent formation. Finally, a differentiable A* module is designed to generate feasible path for the multi-agent formation from start location to goal location. By combining data-driven techniques with knowledge, NFA* provides a promising solution for multi-agent formation path planning problems. Evaluations under different path planning scenarios demonstrate that NFA* outperforms a state-of-the-art path planner in terms of path feasibility.
引用
收藏
页码:276 / 290
页数:15
相关论文
共 50 条
  • [1] Path planning and formation control for multi-agent system using ergodic exploration
    Chen, Zhulei
    Xiao, Li
    Wang, Qi
    Wang, Zhuo
    Sun, Zhigang
    2020 IEEE 18TH INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS (INDIN), VOL 1, 2020, : 200 - 205
  • [2] Multi-Agent Coverage Path Planning via Proximity Interaction and Cooperation
    Jiao, Lei
    Peng, Zhihong
    Xi, Lele
    Ding, Shuxin
    Cui, Jinqiang
    IEEE SENSORS JOURNAL, 2022, 22 (06) : 6196 - 6207
  • [3] Random sampling algorithm for multi-agent cooperation planning
    Kamio, S
    Iba, H
    2005 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-4, 2005, : 1676 - 1681
  • [4] Optimal Multi-Agent Map Coverage Path Planning Algorithm
    Zheng, Yangxing
    Tu, Xiaowei
    Yang, Qinghua
    2020 CHINESE AUTOMATION CONGRESS (CAC 2020), 2020, : 6055 - 6060
  • [5] An Extended Any-angle Path Planning Algorithm for Maintaining Formation of Multi-agent Jellyfish Elimination Robot System
    Kim, Hanguen
    Kim, Donghoon
    Kim, Hyungjin
    Shin, Jae-Uk
    Myung, Hyun
    INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS, 2016, 14 (02) : 598 - 607
  • [6] An extended any-angle path planning algorithm for maintaining formation of multi-agent jellyfish elimination robot system
    Hanguen Kim
    Donghoon Kim
    Hyungjin Kim
    Jae-Uk Shin
    Hyun Myung
    International Journal of Control, Automation and Systems, 2016, 14 : 598 - 607
  • [7] Cooperation based Dynamic Team Formation in Multi-Agent Auctions
    Pippin, Charles E.
    Christensen, Henrik
    GROUND/AIR MULTISENSOR INTEROPERABILITY, INTEGRATION, AND NETWORKING FOR PERSISTENT ISR III, 2012, 8389
  • [8] A Multi-agent Path Planning Algorithm Based on Hierarchical Reinforcement Learning and Artificial Potential Field
    Zheng, Yanbin
    Li, Bo
    An, Deyu
    Li, Na
    2015 11TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2015, : 363 - 369
  • [9] A stochastic algorithm for makespan minimized multi-agent path planning in discrete space
    Wang, Wenjie
    Goh, Wooi Boon
    APPLIED SOFT COMPUTING, 2015, 30 : 287 - 304
  • [10] Congestion-Aware Multi-Agent Path Planning: Distributed Algorithm and Applications
    Lim, Sejoon
    Rus, Daniela
    COMPUTER JOURNAL, 2014, 57 (06) : 825 - 839