DeepAI AI Chat
Log In Sign Up

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

by   Keisuke Okumura, et al.

We propose a novel complete algorithm for multi-agent pathfinding (MAPF) called lazy constraints addition search for MAPF (LaCAM). MAPF is a problem of finding collision-free paths for multiple agents on graphs and is the foundation of multi-robot coordination. LaCAM uses a two-level search to find solutions quickly, even with hundreds of agents or more. At the low-level, it searches constraints about agents' locations. At the high-level, it searches a sequence of all agents' locations, following the constraints specified by the low-level. Our exhaustive experiments reveal that LaCAM is comparable to or outperforms state-of-the-art sub-optimal MAPF algorithms in a variety of scenarios, regarding success rate, planning time, and solution quality of sum-of-costs.


Optimal Multi-Agent Path Finding for Precedence Constrained Planning Tasks

Multi-Agent Path Finding (MAPF) is the problem of finding collision-free...

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...

Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding

This study extends the recently-developed LaCAM algorithm for multi-agen...

Iterative Refinement for Real-Time Multi-Robot Path Planning

We study the iterative refinement of path planning for multiple robots, ...

When is social computation better than the sum of its parts?

Social computation, whether in the form of searches performed by swarms ...

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

Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for ...