We study the computational complexity of multi-agent path finding (MAPF). Given a graph $
G $ and a set of agents, each having a start and target vertex, the goal is to find collision-free …

We introduce the multi-agent transportation (MAT) problem, where agents have to transport
containers from their starting positions to their designated goal positions. Movement takes …

The determination of the computational complexity of multi-agent pathfinding on directed
graphs has been an open problem for many years. For undirected graphs, solvability can be …

In this paper, we formalize and study the Moving Agents in Formation (MAiF) problem, that
combines the tasks of finding short collision-free paths for multiple agents and keeping them …

The authors present an overview of a hierarchical framework for coordinating task-and
motion-level operations in multirobot systems. Their framework is based on the idea of using …

A warehouse delivery problem consists of a set of robots that undertake delivery jobs within
a warehouse. Items are moved around the warehouse in response to events. A solution to a …

Prioritized planning is a popular approach to multi-agent pathfinding. It prioritizes the agents
and then repeatedly invokes a single-agent pathfinding algorithm for each agent such that it …

Purpose With the rapid development of e-commerce, logistics demand is increasing day by
day. The modern warehousing with a multi-agent system as the core comes into being. This …

Although the multi-agent pickup and delivery (MAPD) problem, wherein multiple agents
iteratively carry materials from some storage areas to the respective destinations without …

In this paper, we study the one-shot and lifelong versions of the Target Assignment and Path
Finding problem in automated sortation centers, where each agent needs to constantly …