3 papers
cs.MA2025
Dynamic Agent Grouping ECBS: Scaling Windowed Multi-Agent Path Finding with Completeness Guarantees
Tiannan Zhang, Rishi Veerapaneni, Shao-Hung Chan +2
Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths for a team of agents. Although several MAPF methods which solve full-horizon MAPF have compl…
cs.AI2025
New Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding
Shao-Hung Chan, Thomy Phan, Jiaoyang Li +1
Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths, one for each agent in a shared environment. Its objective is to minimize the sum of path co…
cs.AI2024
Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic
Thomy Phan, Benran Zhang, Shao-Hung Chan +1
Anytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in multi-agent systems. MAPF-LNS, based on Large Neighborhood Search (LNS), is the cur…