SOURCE-LINKED INTELLIGENCE

Pivot-and-Station Multi-Agent Path Finding: Solvability, Complexity, and Algorithms

arXiv · AI, language, vision and robotics · article · Aug 25, 2026 · UTC

Automated high-density storage systems (warehouses, robotic parking, plant logistics, etc.) require fleets of agents to move through scarce task-critical resources and then park without obstructing future operations. We introduce Pivot-and-Station Multi-Agent Path Finding (PS-MAPF), a MAPF variant in which a subset of tasked agents must each visit one of a set of interchangeable pivots (e.g., workstations) before the entire fleet terminates at anonymous stations, one agent per station. We characterize solvability completely: every instance on a 2-edge-connected graph is solvable, and, on arbit

Read original source ↗ Open in workspace

recordType

paper

region

Global