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 …

Abstract In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph
must reach their own respective destinations without inter-agent collisions. In practical MAPF …

This study extends the recently-developed LaCAM algorithm for multi-agent pathfinding
(MAPF). LaCAM is a sub-optimal search-based algorithm that uses lazy successor …

Real-time planning for a combined problem of target assignment and path planning for
multiple agents, also known as the unlabeled version of multi-agent path finding (MAPF), is …

The Multi-Agent Path Finding (MAPF) problem, ie, the scheduling of multiple agents to reach
their destinations, has been widely investigated. Testing MAPF systems is challenging, due …

Multi-agent path planning (MAPP) in continuous spaces is a challenging problem with
significant practical importance. One promising approach is to first construct graphs …

Abstract Multi-Agent Path Finding (MAPF) is NP-hard to solve optimally, even on graphs,
suggesting no polynomial-time algorithms can compute exact optimal solutions for them …

This paper addresses the challenges of real-time, large-scale, and near-optimal multi-agent
pathfinding (MAPF) through enhancements to the recently proposed LaCAM* algorithm …

We propose a novel algorithm to solve multi-robot motion planning (MRMP) rapidly, called
Simultaneous Sampling-and-Search Planning (SSSP). Conventional MRMP studies mostly …

Efficient multi-agent pathfinding (MAPF) is becoming increasingly relevant in real-world
scenarios. MAPF aims to minimize the travel time for robots operating in a shared …