Abstract Purpose of Review This review summarizes the broad roles that communication
formats and technologies have played in enabling multi-robot systems. We approach this …

Recent years have shown a large increase in applications and research of problems that
include moving a fleet of physical robots. One particular application that is currently a multi …

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 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 Path Finding (MAPF), ie, finding collision-free paths for multiple robots,
is important for many applications where small runtimes are necessary, including the kind of …

Multi-agent path finding (MAPF) is an indispensable component of large-scale robot
deployments in numerous domains ranging from airport management to warehouse …

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 …

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 …

We study the offline Multi-Agent Pickup-and-Delivery (MAPD) problem, where a team of
agents has to execute a batch of tasks with release times in a known environment. To …