cs.MA, cs.RO

Decoupling Geometric Planning and Execution in Scalable Multi-Agent Path Finding

arXiv:2603.26684v2 Announce Type: replace-cross
Abstract: Multi-Agent Path Finding (MAPF) requires collision-free trajectories for multiple agents on a shared graph, often with the objective of minimizing the sum-of-costs (SOC). Many optimal and bound…