A* Variants for Optimal Multi-Agent Pathfinding

Authors

  • Meir Goldenberg Ben-Gurion University
  • Ariel Felner Ben-Gurion University
  • Roni Stern Ben-Gurion University
  • Jonathan Schaeffer University of Alberta

DOI:

https://doi.org/10.1609/socs.v3i1.18259

Keywords:

partial expansion, pattern databases

Abstract

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.

SoCS 2012 Proceedings Cover

Downloads

Published

2021-08-20

Issue

Vol. 3 No. 1 (2012): Fifth Annual Symposium on Combinatorial Search

Section

Short Papers