1 paper
Takahiro Suzuki, Yuma Tamura, Keisuke Okumura
We study a graph pathfinding problem Distance-r Independent Unlabeled Multi-Agent Pathfinding, finding a set of collision-free paths between two sets where agents must stay at pa…