Solving the Multi-Agent Path Finding Problem Using a Hierarchical Multi-Resolution Planner
Multi-Agent Path Finding (MAPF) studies how to compute collision-free routes for multiple robots moving simultaneously on a shared map, a setting in which naive shortest-path behavior often leads to bottlenecks, deadlocks, and costly replanning. This paper proposes a hierarchical, reservation-based, multi-resolution pl...