Neuroscience

Balance (ability)

Theoretical computer science

Archaeology

Set (abstract data type)

Computer science

Solver

Distributed computing

Digraph

Psychology

Graph

Mathematics

Pathfinding

Combinatorics

Programming language

Shortest path problem

Plan (archaeology)

History

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 where new agents appear over time. Several variants of online MAPF are defined and analyzed theoretically, showing that it is not possible to create an optimal online MAPF solver. Nevertheless, we propose effective online MAPF algorithms that balance solution quality, runtime, and the number of plan changes an agent makes during execution.

Online Multi-Agent Pathfinding