Abstract
Several variants of A* have been recently proposed for finding optimal solutions for the multi-agent pathfinding (MAPF) problem. However, these variants have not been deeply compared either quantitatively or qualitatively. In this paper we aim to fill this gap. In addition to obtaining a deeper understanding of the existing algorithms, we describe in detail the application of the new enhanced partial-expansion technique to MAPF and show how pattern databases can be applied on top of this technique.
| Original language | American English |
|---|---|
| Pages | 19-25 |
| Number of pages | 7 |
| State | Published - 1 Dec 2012 |
| Event | 2012 AAAI Workshop - Toronto, ON, Canada Duration: 22 Jul 2012 → 22 Jul 2012 |
Conference
| Conference | 2012 AAAI Workshop |
|---|---|
| Country/Territory | Canada |
| City | Toronto, ON |
| Period | 22/07/12 → 22/07/12 |
All Science Journal Classification (ASJC) codes
- General Engineering