arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1911.04871cs.AIcs.CC
收藏

有向图上多智能体寻路的计算复杂性研究

On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs

Albert-Ludwigs-Universität(阿尔伯特-路德维希大学)

Bernhard Nebel

摘要:

多智能体有向图寻路的计算复杂性的确定是一个悬而未决的问题。对于无向图,可解性可以在多项式时间内确定,正如80年代已经证明的那样。此外,最近已经表明,一个特殊的情况下,有向图是可解的多项式时间。在本文中,我们证明了该问题是NP-困难的一般情况下。此外,一些上界被证明。

英文摘要:

The determination of the computational complexity of multi-agent pathfinding on directed graphs has been an open problem for many years. For undirected graphs, solvability can be decided in polynomial time, as has been shown already in the eighties. Further, recently it has been shown that a special case on directed graphs is solvable in polynomial time. In this paper, we show that the problem is NP-hard in the general case. In addition, some upper bounds are proven.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑