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 …

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 each agent reaches its goal and the agents do not collide. In recent years, variants …

Multi-agent pathfinding (MAPF) is the problem of moving a group of agents to a set of target
destinations while avoiding collisions. In this work, we study the online version of MAPF …

The challenge of finding an optimal solution to a multi-agent path finding (MAPF) problem
has attracted significant academic and industrial interest in recent years. While the problem …

We address the problem of routing a team of drones and trucks over large-scale urban road
networks. To conserve their limited flight energy, drones can use trucks as temporary modes …

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 …

In many real-world scenarios, the time it takes for a mobile agent, eg, a robot, to move from
one location to another may vary due to exogenous events and be difficult to predict …

There are many practical situations, where a set of agents (robots, cars, etc.) is moving in a
shared environment, while each agent is heading for its desired goal position. The …

Multi-Agent Path Finding (MAPF) is a well studied problem with many existing optimal
algorithms capable of solving a wide variety of instances, each with its own strengths and …