f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search

Conflict-Based Search (CBS) is a leading two-level algorithm for optimal Multi-Agent Path Finding (MAPF). The main step of CBS is to expand nodes by resolving conflicts (where two agents collide). Choosing the ‘right’ conflict to resolve can greatly speed up the search. CBS first resolves conflicts where the costs (g-values) of the resulting child nodes are larger than the cost of the node to be split. However, the recent addition of high-level heuristics to CBS and expanding nodes according to f = g + h reduces the relevance of this conflict prioritization method. Therefore, we introduce an expanded categorization of conflicts, which first resolves conflicts where the f -values of the child nodes are larger than the f -value of the node to be split, and present a method for identifying such conflicts. We also enhance all known heuristics for CBS by using information about the cost of resolving certain conflicts with only a small computational overhead. Finally, we experimentally demonstrate that both the expanded categorization of conflicts and the improved heuristics contribute to making CBS even more efficient.

[1]  David Tolpin,et al.  ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding , 2015, SOCS.

[2]  Nathan R. Sturtevant,et al.  Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges , 2021, SOCS.

[3]  Keisuke Otaki,et al.  Multi-Agent Path Finding with Priority for Cooperative Automated Valet Parking , 2019, 2019 IEEE Intelligent Transportation Systems Conference (ITSC).

[4]  Roni Stern,et al.  Don't Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding , 2015, ICAPS.

[5]  Peter J. Stuckey,et al.  New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding , 2020, ICAPS.

[6]  Nathan R. Sturtevant,et al.  Conflict-based search for optimal multi-agent pathfinding , 2012, Artif. Intell..

[7]  Ariel Felner,et al.  Improved Heuristics for Multi-Agent Pathfinding with Conflict-Based Search∗ , 2019 .

[8]  David Silver,et al.  Cooperative Pathfinding , 2005, AIIDE.

[9]  Roni Stern,et al.  Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks , 2019, SOCS.

[10]  T. K. Satish Kumar,et al.  Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers , 2019, AAAI.

[11]  Hong Xu,et al.  Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios , 2017, ArXiv.

[12]  Roni Stern,et al.  Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem , 2014, SOCS.

[13]  Raffaello D'Andrea,et al.  Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses , 2007, AI Mag..

[14]  Peter J. Stuckey,et al.  Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding , 2019, SOCS.

[15]  Peter J. Stuckey,et al.  Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search , 2019, ICAPS.

[16]  Sven Koenig,et al.  Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding , 2018, ICAPS.