Message-Aware Graph Attention Networks for Large-Scale Multi-Robot Path Planning

被引:74
|
作者
Li, Qingbiao [1 ]
Lin, Weizhe [2 ]
Liu, Zhe [1 ]
Prorok, Amanda [1 ]
机构
[1] Univ Cambridge, Dept Comp Sci & Technol, Cambridge CB3 0FD, England
[2] Univ Cambridge, Dept Engn, Cambridge CB2 1PZ, England
基金
欧洲研究理事会; 英国工程与自然科学研究理事会;
关键词
Robot learning; path planning; mobile robots; multicast communication; cooperative communication; REINFORCEMENT;
D O I
10.1109/LRA.2021.3077863
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
The domains of transport and logistics are increasingly relying on autonomous mobile robots for the handling and distribution of passengers or resources. At large system scales, finding decentralized path planning and coordination solutions is key to efficient system performance. Recently, Graph Neural Networks (GNNs) have become popular due to their ability to learn communication policies in decentralized multi-agent systems. Yet, vanilla GNNs rely on simplistic message aggregation mechanisms that prevent agents from prioritizing important information. To tackle this challenge, in this letter, we extend our previous work that utilizes GNNs in multi-agent path planning by incorporating a novel mechanism to allow for message-dependent attention. Our Message-Aware Graph Attention neTwork (MAGAT) is based on a key-query-like mechanism that determines the relative importance of features in the messages received from various neighboring robots. We show that MAGAT is able to achieve a performance close to that of a coupled centralized expert algorithm. Further, ablation studies and comparisons to several benchmark models show that our attention mechanism is very effective across different robot densities and performs stably in different constraints in communication bandwidth. Experiments demonstrate that our model is able to generalize well in previously unseen problem instances, and that it achieves a 47% improvement over the benchmark success rate, even in very large-scale instances that are x100 larger than the training instances.
引用
收藏
页码:5533 / 5540
页数:8
相关论文
共 50 条
  • [31] An Optimization Variant of Multi-Robot Path Planning is Intractable
    Surynek, Pavel
    PROCEEDINGS OF THE TWENTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-10), 2010, : 1261 - 1263
  • [32] A complete multi-robot path-planning algorithm
    Alotaibi, Ebtehal Turki Saho
    Al-Rawi, Hisham
    AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2018, 32 (05) : 693 - 740
  • [33] Exploiting subgraph structure in multi-robot path planning
    Ryan, Malcolm R.K.
    Journal of Artificial Intelligence Research, 1600, 31 : 497 - 542
  • [34] Global Path Planning for Multi-Robot with Cellular Automata
    Santoso, J.
    Trilaksono, Bambang Riyanto
    Santoso, O. Setiono
    Adiprawita, W.
    2013 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS, BIOMIMETICS, AND INTELLIGENT COMPUTATIONAL SYSTEMS (ROBIONETICS), 2013, : 19 - 23
  • [35] A complete multi-robot path-planning algorithm
    Ebtehal Turki Saho Alotaibi
    Hisham Al-Rawi
    Autonomous Agents and Multi-Agent Systems, 2018, 32 : 693 - 740
  • [36] Path planning protocol for collaborative multi-robot systems
    Chen, JH
    Li, LR
    2005 IEEE INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN ROBOTICS AND AUTOMATION, PROCEEDINGS, 2005, : 721 - 726
  • [37] HTN-based multi-robot path planning
    Zeng, Suying
    Zhu, Yuancheng
    Qi, Chao
    PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, : 4719 - 4723
  • [38] CONTINUOUS PATH PLANNING FOR MULTI-ROBOT IN INTELLIGENT WAREHOUSE
    Shen, G. C.
    Liu, J.
    Ding, Y. L.
    Zhang, C.
    Duo, J. Y.
    INTERNATIONAL JOURNAL OF SIMULATION MODELLING, 2024, 23 (02)
  • [39] Constraint-based multi-robot path planning
    Ryan, Malcolm
    2010 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2010, : 922 - 928
  • [40] Multi-robot Path Planning Using Petri Nets
    Zhang, Hongbin
    Luo, Jiliang
    Long, Jinjun
    Huang, Yisheng
    Wu, Weimin
    VERIFICATION AND EVALUATION OF COMPUTER AND COMMUNICATION SYSTEMS, VECOS 2020, 2020, 12519 : 15 - 26