אריאל פלנר

Several variants of A* have been recently proposed for finding optimal solutions for the multi-agent pathfinding (MAPF) problem. We describe the application of the new enhanced partial-expansion technique to MAPF, show how pattern databases can be applied on top of this technique and compare the different A* variants experimentally.