A Hierarchical Approach to Multi-Agent Path Finding

Solving Multi-Agent Path Finding (MAPF) instances optimally is NP-hard, and existing optimal and bounded suboptimal MAPF solvers thus usually do not scale to large MAPF instances. Greedy MAPF solvers scale to large MAPF instances, but their solution qualities are often bad. In this paper, we therefore propose a novel MAPF solver, Hierarchical Multi-Agent Path Planner (HMAPP), which creates a spatial hierarchy by partitioning the environment into multiple regions and decomposes a MAPF instance into smaller MAPF sub-instances for each region. For each sub-instance, it uses a bounded-suboptimal MAPF solver to solve it with good solution quality. Our experimental results show that HMAPP is able to solve as large MAPF instances as greedy MAPF solvers while achieving better solution qualities on various maps.

Authors

• Han Zhang 0018
• Mingze Yao
• Ziang Liu 0002
• Jiaoyang Li 0001
• Lucas Terr
• Shao-Hung Chan
• T. K. Satish Kumar
• Sven Koenig

Keywords

• Problem Solving Using Search