On the Complexity of Optimal Parallel Cooperative Path-Finding

Pavel Surynek. On the Complexity of Optimal Parallel Cooperative Path-Finding. Fundamenta Informaticae, 137(4):517-548, 2015. [doi]

Abstract

Abstract is missing.