Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding

Authors

  • Hongzhi Zang Institute for Interdisciplinary Information Sciences, Tsinghua University
  • Yulun Zhang Robotics Institute, Carnegie Mellon University
  • He Jiang Robotics Institute, Carnegie Mellon University
  • Zhe Chen Department of Data Science and AI, Monash University
  • Daniel Harabor Department of Data Science and AI, Monash University
  • Peter J. Stuckey Department of Data Science and AI, Monash University
  • Jiaoyang Li Robotics Institute, Carnegie Mellon University

DOI:

https://doi.org/10.1609/aaai.v39i14.33614

Abstract

We study the problem of optimizing a guidance policy capable of dynamically guiding the agents for lifelong Multi-Agent Path Finding based on real-time traffic patterns. Multi-Agent Path Finding (MAPF) focuses on moving multiple agents from their starts to goals without collisions. Its lifelong variant, LMAPF, continuously assigns new goals to agents. In this work, we focus on improving the solution quality of PIBT, a state-of-the-art rule-based LMAPF algorithm, by optimizing a policy to generate adaptive guidance. We design two pipelines to incorporate guidance in PIBT in two different ways. We demonstrate the superiority of the optimized policy over both static guidance and human-designed policies. Additionally, we explore scenarios where task distribution changes over time, a challenging yet common situation in real-world applications that is rarely explored in the literature.

Published

2025-04-11

How to Cite

Zang, H., Zhang, Y., Jiang, H., Chen, Z., Harabor, D., Stuckey, P. J., & Li, J. (2025). Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding. Proceedings of the AAAI Conference on Artificial Intelligence, 39(14), 14726–14735. https://doi.org/10.1609/aaai.v39i14.33614

Issue

Section

AAAI Technical Track on Intelligent Robots