MAPF

Robots do not move through warehouses as clean little dots on a grid. They rotate. They accelerate. They wait behind other robots. They lose time in corners. They obey controllers, not PowerPoint arrows. This is the small operational fact that makes a large amount of path-planning optimism look slightly overdressed. Multi-Agent Path Finding, or MAPF, usually asks a neat question: given many agents, each with a start and goal location, can we find collision-free paths for all of them? In the standard version, the world is a graph, time advances in discrete steps, and each robot either moves to a neighboring vertex or waits. It is elegant, measurable, and algorithmically productive. It is also not how a differential-drive robot actually behaves when squeezed through a congested warehouse aisle. ...