Efficient Decomposition of Multi-Agent Path Finding (MAPF) Instances to Improve Computational Performance

A novel approach to decompose MAPF instances into smaller solvable subproblems without compromising the overall solvability, enabling general MAPF algorithms to solve each subproblem independently and merge their solutions into a conflict-free final solution.