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

被引:90
作者
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
相关论文
共 23 条
  • [1] Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem
    Barer, Max
    Sharon, Guni
    Stern, Roni
    Felner, Ariel
    [J]. 21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 961 - +
  • [2] Best G, 2018, IEEE INT CONF ROBOT, P1050
  • [3] Enright J., 2011, AUTOMATED ACTION PLA, P33
  • [4] Foerster J., 2016, P ADV NEUR INF PROC, P2137
  • [5] Fowler M, 2018, IEEE INT CONF ROBOT, P3701
  • [6] Sparse Discrete Communication Learning for Multi-Agent Cooperation Through Backpropagation
    Freed, Benjamin
    James, Rohan
    Sartoretti, Guillaume
    Choset, Howie
    [J]. 2020 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2020, : 7993 - 7998
  • [7] Stability Properties of Graph Neural Networks
    Gama, Fernando
    Bruna, Joan
    Ribeiro, Alejandro
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2020, 68 : 5680 - 5695
  • [8] Convolutional Neural Network Architectures for Signals Supported on Graphs
    Gama, Fernando
    Marques, Antonio G.
    Leus, Geert
    Ribeiro, Alejandro
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2019, 67 (04) : 1034 - 1049
  • [9] Isufi E., 2020, ARXIV200107620
  • [10] When2com: Multi-Agent Perception via Communication Graph Grouping
    Liu, Yen-Cheng
    Tian, Junjiao
    Glaser, Nathaniel
    Kira, Zsolt
    [J]. 2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2020, : 4105 - 4114