Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding

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.

Authors

Institutions

Publication Details

Journal
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2025-04-11
DOI
https://doi.org/10.1609/aaai.v39i14.33614
Citations
5
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
2.16

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding

He Jiang, Daniel Harabor, Peter J. Stuckey, Hongzhi Zang et al.
5 citations
Proceedings of the AAAI Conference on Artificial Intelligence
Robotic Path Planning Algorithms
2.16
article

Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding

He Jiang, Daniel Harabor, Peter J. Stuckey, Hongzhi Zang, Zhe Chen, Jiaoyang Li, Yulun Zhang
article en
5 citations

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.

Proceedings of the AAAI Conference on Artificial IntelligenceVol. 39(14)
Monash University (AU), Carnegie Mellon University (US), Tsinghua University (CN)
National Science Foundation, Carnegie Mellon University, Office of Advanced Cyberinfrastructure
Openalex Percentile: Top 12%
Robotic Path Planning Algorithms
2.16
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.