Multi-agent pathfinding (MAPF) is a well-studied abstract model for navigation in a multi-
robot system, where every robot finds the path to its goal position without any collision. Due …

Abstract Purpose of Review Planning collision-free paths for multiple robots is important for
real-world multi-robot systems and has been studied as an optimization problem on graphs …

Abstract Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents to their
goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where …

Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where a team of
robots is tasked with transporting a set of tasks, each from an initial location and each to a …

Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that each agent reaches its goal and the agents do not collide. In recent years, variants …

The SAT Competitions constitute a well-established series of yearly open international
algorithm implementation competitions, focusing on the Boolean satisfiability (or …

Abstract Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem that asks
us to plan collision-free paths for a team of cooperative agents. In this work, we show that …

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 …

We introduce a new problem formulation, Double-Deck Multi-Agent Pickup and Delivery (DD-
MAPD), which models the multi-robot shelf rearrangement problem in automated …