On the Complexity of Optimal Parallel Cooperative Path-Finding
Pavel Surynek · Fundamenta Informaticae · 2015
A parallel version of the problem of cooperative path-finding (pCPF) is introduced in this paper. The task in CPF is to determine a spatio-temporal plan for each member of a group of agents. Each agent is given its initial location in the environment