ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding: Extended Abstract∗

A Multi-Agent Path Finding (MAPF) problem is defined by a graph, G = (V,E) and a set of k agents labeled a1... ak, where each agent ai has a start position si ∈ V and a goal position gi ∈ V. At each time step an agent can either mov