MAPFASTER: A Faster and Simpler take on Multi-Agent Path Finding Algorithm Selection
Jean-Marc Alkazzi,Anthony Rizk,Michel Salomon,Abdallah Makhoul,Jean-Marc Alkazzi,Anthony Rizk,Michel Salomon,Abdallah Makhoul
Portfolio-based algorithm selection can help in choosing the best suited algorithm for a given task while leveraging the complementary strengths of the candidates. Solving the Multi-Agent Path Finding (MAPF) problem optimally has been proven to be NP-Hard. Furthermore, no single optimal algorithm has been shown to have the fastest runtime for all MAPF problem instances, and there are no proven app...
