Certificate-Driven Closed-Loop Multi-Agent Path Finding with Inheritable Factorization
Jiarui Li, Runyu Zhang, Gioele Zardini

TL;DR
This paper introduces a novel framework for multi-agent pathfinding that uses certificates and inheritable factorization to improve solution consistency and scalability in dense, dynamic environments.
Contribution
It proposes a new mechanism for filtering updates using certificates and a budget-limited factorization to enhance closed-loop MAPF algorithms.
Findings
CDCBS outperforms ACCBS in dense environments.
The factorization reduces effective group size.
The framework provides conflict-free fallback plans with cost bounds.
Abstract
Multi-agent coordination in automated warehouses and logistics is commonly modeled as the Multi-Agent Path Finding (MAPF) problem. Closed-loop MAPF algorithms improve scalability by planning only the next movement and replanning online, but this finite-horizon viewpoint can be shortsighted and makes it difficult to preserve global guarantees and exploit compositional structure. This issue is especially visible in Anytime Closed-Loop Conflict-Based Search (ACCBS), which applies Conflict-Based Search (CBS) over dynamically extended finite horizons but, under finite computational budgets, may terminate with short active prefixes in dense instances. We introduce certificate trajectories and their associated fleet budget as a general mechanism for filtering closed-loop updates. A certificate provides a conflict-free fallback plan and a monotone upper bound on the remaining cost; accepting…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
