Bridging Planning and Execution: Multi-Agent Path Finding Under Real-World Deadlines
The Multi-Agent Path Finding (MAPF) problem aims to find collision-free paths for multiple agents while optimizing objectives such as the sum of costs or makespan. MAPF has wide …
Jingtian Yan*