Abstract Deep Reinforcement Learning has made significant progress in multi-agent
systems in recent years. The aim of this review article is to provide an overview of recent …

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 …

Multi-agent path finding (MAPF) is an essential component of many large-scale, real-world
robot deployments, from aerial swarms to warehouse automation. However, despite the …

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 …

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 …

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 …

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 …

We study the TAPF (combined target-assignment and path-finding) problem for teams of
agents in known terrain, which generalizes both the anonymous and non-anonymous multi …