arXiv:2607. 17724v1 Announce Type: cross Abstract: Coordinating payload transfers between subsystems is a critical challenge in lifelong Multi-Agent Pickup and Delivery (MAPD).
By Chuanlong Zang, Isabelle Barz, Anna Mannucci, Philipp Schillinger, Florian Lier, Wolfgang H\"onig
arXiv:2608. 06702v1 Announce Type: cross Abstract: Lifelong Multi-Agent Path Finding (LMAPF) requires generating collision-free paths for large agent fleets under strict real-time constraints.
By Vaibhav Sanjay, Jiaoyang Li
arXiv:2608. 07734v1 Announce Type: cross Abstract: Automated warehouses face a fundamental trade-off between maximizing storage density and achieving high retrieval throughput.
By William Zhang, Tzvika Geft, Jingjin Yu, Kostas Bekris
The paper presents a theoretical analysis of the Rolling‑Horizon Collision Resolution (RHCR) framework for Lifelong Multi‑Agent Path Finding (L‑MAPF), proving its near‑optimality in a discounted MDP setting. Building on this, the authors introduce Group Decentralized RHCR (GD‑RHCR), which partitions agents via a transitive communication scheme and plans each partition in parallel, achieving similar optimality guarantees while reducing per‑plan computational cost. Experiments across various maps demonstrate that GD‑RHCR scales to higher agent counts with high throughput and lower cost compared to vanilla RHCR.
By Alex DeWeese, Jiaoyang Li, Guannan Qu
arXiv:2606. 30694v1 Announce Type: cross Abstract: Traffic signal control at urban intersections inherently introduces stop-and-go behavior, resulting in increased delays and reduced traffic efficiency, especially under high traffic demand.
By Qian Hu, Haoyang Peng, Songan Zhang, Ming Yang, Hongtei Eric Tseng
arXiv:2601. 04884v3 Announce Type: replace Abstract: Executing a multi-agent plan can be challenging when an agent is delayed, because this typically creates conflicts with other agents.
By Issa Hanou, Eric Kemmeren, Devin Wild Thomas, Mathijs de Weerdt