Automatic Optimal Multi-Agent Path Finding Algorithm Selector (Student Abstract)

Solving Multi-Agent Path Finding (MAPF) problems optimally is known to be NP-Hard for both make-span and total arrival time minimization. Many algorithms have been developed to solve MAPF problems optimally and they all have different strengths and weaknesses. There is no dominating MAPF algorithm that works well in all types of problems and no standard guidelines for when to use which algorithm. Therefore, there is a need for developing an automatic algorithm selector that suggests the best optimal algorithm to use given a MAPF problem instance. We propose a model based on convolutions and inception modules by treating the input MAPF instance as an image. We further show that techniques such as single-agent shortest path annotation and graph embedding are very effective for improving training quality. We evaluate our model and show that it outperforms all individual algorithms in its portfolio, as well as an existing state-of-theart MAPF algorithm selector.

Authors

• Jingyao Ren
• Vikraman Sathiyanarayanan
• Eric Ewing
• Baskin Senbaslar
• Nora Ayanian

Keywords

No keywords are indexed for this paper.