A* Variants for Optimal Multi-Agent Pathfinding
DOI:
https://doi.org/10.1609/socs.v3i1.18259Keywords:
partial expansion, pattern databasesAbstract
Several variants of A* have been recently proposed for find-ing optimal solutions for the multi-agent pathfinding (MAPF)problem. We describe the application of the new enhancedpartial-expansion technique to MAPF, show how patterndatabases can be applied on top of this technique and com-pare the different A* variants experimentally.
Downloads
Published
2021-08-20
Issue
Section
Short Papers