6 citations · 9 across the 7 of their papers we have counts for
Showing cs.MAShow all
2 papers · 1 filter
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.MA2024★ 1 cited
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search
Shao-Hung Chan, Zhe Chen, Dian-Lun Lin +5
Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths for multiple agents in a shared environment while minimizing the sum of travel time. Since s…