Planning over MAPF Agent Dependencies via Multi-Dependency PIBT
DGX agentarXiv:2603.23405v2 Announce Type: replace-cross Abstract: Modern Multi-Agent Path Finding (MAPF) algorithms must plan for hundreds to thousands of agents in congested environments within a second, req