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 …

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 The Multi-Agent Pickup and Delivery (MAPD) problem models applications where a
large number of agents attend to a stream of incoming pickup-and-delivery tasks. Token …

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 …

Given a set of agents, the multi-agent pathfinding problem consists in determining, for each
agent, a path from its start location to its assigned goal while avoiding collisions with other …

In this work, we consider the Multi-Agent Pickup-and-Delivery (MAPD) problem, where
agents constantly engage with new tasks and need to plan collision-free paths to execute …

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 …

Abstract In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph
must reach their own respective destinations without inter-agent collisions. In practical MAPF …

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 Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that every agent reaches its goal and the agents do not collide. In recent years, there …