🤖 AI Summary
Real-time computation of near-optimal solutions remains challenging in dense multi-agent pathfinding (MAPF). Method: This paper proposes a tightly integrated learning-and-search hybrid framework. It innovatively embeds a multi-agent graph attention network (MAGAT) into the LaCAM search framework to construct a neural-augmented heuristic model; introduces a pretraining-fine-tuning paradigm to enhance generalization; and incorporates a lightweight deadlock detection mechanism to mitigate uncertainty arising from neural guidance. Contribution/Results: Experiments demonstrate that the framework significantly outperforms both pure search and pure learning baselines in highly coupled, dense scenarios, achieving a superior trade-off between solution quality and runtime efficiency. The results validate the effectiveness and robustness of learning-guided search for complex cooperative pathfinding tasks.
📝 Abstract
Finding near-optimal solutions for dense multi-agent pathfinding (MAPF) problems in real-time remains challenging even for state-of-the-art planners. To this end, we develop a hybrid framework that integrates a learned heuristic derived from MAGAT, a neural MAPF policy with a graph attention scheme, into a leading search-based algorithm, LaCAM. While prior work has explored learning-guided search in MAPF, such methods have historically underperformed. In contrast, our approach, termed LaGAT, outperforms both purely search-based and purely learning-based methods in dense scenarios. This is achieved through an enhanced MAGAT architecture, a pre-train-then-fine-tune strategy on maps of interest, and a deadlock detection scheme to account for imperfect neural guidance. Our results demonstrate that, when carefully designed, hybrid search offers a powerful solution for tightly coupled, challenging multi-agent coordination problems.