EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding

by   Jiaoyang Li, et al.

Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for multiple robots, is important for many applications where small runtimes are important, including the kind of automated warehouses operated by Amazon. CBS is a leading two-level search algorithm for solving MAPF optimally. ECBS is a bounded-suboptimal variant of CBS that uses focal search to speed up CBS by sacrificing optimality and instead guaranteeing that the costs of its solution are within a given factor of optimal. In this paper, we study how to decrease its runtime even further using inadmissible heuristics. Motivated by Explicit Estimation Search (EES), we propose Explicit Estimation CBS (EECBS), a new bounded-suboptimal variant of CBS, that uses online learning to inadmissibly estimate the cost of the solution under each high-level node and uses EES to choose which high-level node to expand next. We also investigate recent improvements to CBS and adapt them to EECBS. We find that EECBS with the improvements runs significantly faster than the MAPF algorithms ECBS, BCP-7, and eMDD-SAT on a variety of MAPF instances. We hope that the scalability of EECBS enables wider adoption of MAPF formulations in practical applications.


page 1

page 2

page 3

page 4


Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants

In multi-agent path finding (MAPF) the task is to find non-conflicting p...

CBS-Budget (CBSB): A Complete and Bounded Suboptimal Search for Multi-Agent Path Finding

Multi-Agent Path Finding (MAPF) is the problem of finding a collection o...

Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding

We formalize and study the multi-goal task assignment and path finding (...

LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding

We propose a novel complete algorithm for multi-agent pathfinding (MAPF)...

Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search

Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem t...

Analysis Of The Anytime MAPF Solvers Based On The Combination Of Conflict-Based Search (CBS) and Focal Search (FS)

Conflict-Based Search (CBS) is a widely used algorithm for solving multi...

Effective Integration of Weighted Cost-to-go and Conflict Heuristic within Suboptimal CBS

Conflict-Based Search (CBS) is a popular multi-agent path finding (MAPF)...

Please sign up or login with your details

Forgot password? Click here to reset