The computational complexity of multi-agent pathfinding on directed graphs

Bernhard Nebel. The computational complexity of multi-agent pathfinding on directed graphs. Artificial Intelligence, 328:104063, March 2024. [doi]

Abstract

Abstract is missing.