We study the TAPF (combined target-assignment and path-finding) problem for teams of
agents in known terrain, which generalizes both the anonymous and non-anonymous multi …

We consider a variant of the Multi-Agent Path-Finding problem that seeks both task
assignments and collision-free paths for a set of agents navigating on a graph, while …

Real-time planning for a combined problem of target assignment and path planning for
multiple agents, also known as the unlabeled version of multi-agent path finding (MAPF), is …

We study the problem of sequential task assignment and collision-free routing for large
teams of robots in applications with inter-task precedence constraints (eg, task A and task B …

Multi-robot task assignment is one of the main processes in an intelligent warehouse. This
paper models multi-robot task assignment in an intelligent warehouse as an open-path multi …

In many real-world applications of multi-agent systems, teams of agents must assign targets
among themselves and plan paths to the targets. The agents must avoid collisions with each …

Executing time-sensitive multi-robot missions involves two distinct problems: Multi-Robot
Task Assignment (MRTA) and Multi-Agent Path Finding (MAPF). Computing safe paths that …

Multi-Agent Path Finding (MAPF) is the problem of finding collision-free paths for multiple
agents from their start locations to end locations. We consider an extension to this problem …

This thesis presents algorithms for multi-agent robotic assembly planning in automated
manufacturing contexts. Our work touches on many pieces of the" factory autonomy stack." …

Using multiple robots is important for search-and-rescue, mining, entertainment, and
warehouse automation, where robots must operate in constrained, perhaps even maze-like …