TY - JOUR
AU - Kaduri, Omri
AU - Boyarski, Eli
AU - Stern, Roni
PY - 2020/06/01
Y2 - 2021/06/18
TI - Algorithm Selection for Optimal Multi-Agent Pathfinding
JF - Proceedings of the International Conference on Automated Planning and Scheduling
JA - ICAPS
VL - 30
IS - 1
SE - Main Track
DO -
UR - https://ojs.aaai.org/index.php/ICAPS/article/view/6657
SP - 161-165
AB - <p>The challenge of finding an optimal solution to a multi-agent path finding (MAPF) problem has attracted significant academic and industrial interest in recent years. While the problem is NP-Hard, modern optimal MAPF algorithms can scale to solve problems with hundreds of agents. Nevertheless, no single optimal MAPF algorithm dominates all benchmarks problems, and there are no clear, provable, guidelines for when each algorithm should be used. To address this, we present the first successful Algorithm Selection (AS) model for optimal MAPF. We propose two approaches for learning an AS model. The first approach uses a standard supervised learning algorithm with a set of handcrafted MAPF-specific features. The second approach, casts a MAPF problem to an image and applies a deep Convolutional Neural Network to classify it. We evaluate both approaches over a large dataset and show that using an AS model to select which algorithm to use for each instance results in solving more problems and in a shorter runtime compared to the state of the art.</p>
ER -