With the advancement of the autonomous mobile robots applied to Warehouses and the
creation of the Robotic Mobile Fulfillment System after the market implementation of the Kiva …

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 …

Abstract Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents to their
goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where …

Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where a team of
robots is tasked with transporting a set of tasks, each from an initial location and each to a …

Multi-agent path finding (MAPF) is an indispensable component of large-scale robot
deployments in numerous domains ranging from airport management to warehouse …

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 …

We consider the problem of routing a large fleet of drones to deliver packages
simultaneously across broad urban areas. Besides flying directly, drones can use public …

This paper studies the multi-robot task assignment problem in which a fleet of dispersed
robots needs to efficiently transport a set of dynamically appearing packages from their initial …

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 Conflict-Based Search (CBS) and its enhancements are among the strongest
algorithms for Multi-Agent Path Finding. Recent work introduced an admissible heuristic to …