2 papers
cs.MA2025
Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds
Yimin Tang, Zhenghong Yu, Jiaoyang Li +1
Multi-Agent Path Finding (MAPF) involves finding collision-free paths for multiple agents while minimizing a cost function--an NP-hard problem. Bounded suboptimal methods like Enha…
cs.RO2025
Enhancing Lifelong Multi-Agent Path Finding with Cache Mechanism
Yimin Tang, Zhenghong Yu, Yi Zheng +3
Multi-Agent Path Finding (MAPF), which focuses on finding collision-free paths for multiple robots, is crucial in autonomous warehouse operations. Lifelong MAPF (L-MAPF), where age…