DeepAI AI Chat
Log In Sign Up

Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality

by   Chenning Yu, et al.

Conflict-Based Search is one of the most popular methods for multi-agent path finding. Though it is complete and optimal, it does not scale well. Recent works have been proposed to accelerate it by introducing various heuristics. However, whether these heuristics can apply to non-grid-based problem settings while maintaining their effectiveness remains an open question. In this work, we find that the answer is prone to be no. To this end, we propose a learning-based component, i.e., the Graph Transformer, as a heuristic function to accelerate the planning. The proposed method is provably complete and bounded-suboptimal with any desired factor. We conduct extensive experiments on two environments with dense graphs. Results show that the proposed Graph Transformer can be trained in problem instances with relatively few agents and generalizes well to a larger number of agents, while achieving better performance than state-of-the-art methods.


page 2

page 6


CBS-Budget (CBSB): A Complete and Bounded Suboptimal Search for Multi-Agent Path Finding

Multi-Agent Path Finding (MAPF) is the problem of finding a collection o...

Introducing Delays in Multi-Agent Path Finding

We consider a Multi-Agent Path Finding (MAPF) setting where agents have ...

Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming

We study a dynamic version of multi-agent path finding problem (called D...

CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces

Multi-agent path planning (MAPP) in continuous spaces is a challenging p...

Learning Control Admissibility Models with Graph Neural Networks for Multi-Agent Navigation

Deep reinforcement learning in continuous domains focuses on learning co...

Neurosymbolic Transformers for Multi-Agent Communication

We study the problem of inferring communication structures that can solv...

TransPath: Learning Heuristics For Grid-Based Pathfinding via Transformers

Heuristic search algorithms, e.g. A*, are the commonly used tools for pa...