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 …

Robustness is key to engineering, automation, and science as a whole. However, the
property of robustness is often underpinned by costly requirements such as over …

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

Abstract Multi-Agent Path Finding has been widely studied in the past few years due to its
broad application in the field of robotics and AI. However, previous solvers rely on several …

Abstract Purpose of Review Planning collision-free paths for multiple robots is important for
real-world multi-robot systems and has been studied as an optimization problem on graphs …

Abstract Multi-Agent Motion Planning (MAMP) is the task of finding conflict-free
kinodynamically feasible plans for agents from start to goal states. While MAMP is of …

(Dis) Appearables is an approach for actuated Tangible User Interfaces (TUIs) to appear
and disappear. This technique is supported by Stages: physical platforms inspired by …

We envision a warehouse in which dozens of mobile robots and human pickers work
together to collect and deliver items within the warehouse. The fundamental problem we …