Abstract Multi-Agent Path Finding (MAPF) is the problem of planning collision-free paths for
multiple agents in a shared environment. In this paper, we propose a novel algorithm MAPF …

Abstract Multi-Agent Path Finding (MAPF) is the planning problem of finding collision-free
paths for a team of agents. We focus on Conflict-Based Search (CBS), a two-level tree …

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 Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free
paths for a team of agents in a common environment. MAPF is NP-hard to solve optimally …

Abstract Conflict-Based Search (CBS) is a recently introduced algorithm for Multi-AgentPath
Finding (MAPF) whose runtime is exponential in the number of conflictsfound between the …

Abstract Multi-Agent Path Finding (MAPF) is the challenging problem of computing collision-
free paths for multiple agents. Algorithms for solving MAPF can be categorized on a …

Abstract Multi-Agent Path Finding (MAPF) has been widely studied in the AI community. For
example, Conflict-Based Search (CBS) is a state-of-the-art MAPF algorithm based on a …

We describe a new way of reasoning about symmetric collisions for Multi-Agent Path Finding
(MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking constraint to resolve …

Multi-agent pathfinding (MAPF) is the problem of moving a group of agents to a set of target
destinations while avoiding collisions. In this work, we study the online version of MAPF …

We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF
algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed …