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…