The multi-agent pathfinding problem (MAPF) is the fundamental problem of planning paths
for multiple agents, where the key constraint is that the agents will be able to follow these …

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 …

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 …

The multi-agent path-finding (MAPF) problem has recently received a lot of attention.
However, it does not capture important characteristics of many real-world domains, such as …

Multi-agent pathfinding (MAPF) is an area of expanding research interest. At the core of this
research area, numerous diverse search-based techniques were developed in the past 6 …

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 …

Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans,
that is, solutions to planning problems, that transform a given state of the world to another …

Abstract Conflict-Based Search (CBS) and its enhancements are among the strongest
algorithms for the multi-agent path-finding problem. However, existing variants of CBS do …

Multi-agent path finding (MAPF) is a well-studied problem in artificial intelligence that can be
solved quickly in practice when using simplified agent assumptions. However, real-world …

Abstract Multi-Agent Path Finding (MAPF) is the combinatorial problem of finding collision-
free paths for multiple agents on a graph. This paper describes MAPF-based software for …