We study transportation problems where robots have to deliver packages and can transfer
the packages among each other. Specifically, we study the package-exchange robot-routing …

Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical
computer science and operations research. We discuss issues that arise when generalizing …

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 …

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 …

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 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 …

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 Pathfinding is a relevant problem in a wide range of domains, for example in
robotics and video games research. Formally, the problem considers a graph consisting of …

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 …

Multi-agent pathfinding (MAPF) is a well-studied abstract model for navigation in a multi-
robot system, where every robot finds the path to its goal position without any collision. Due …