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

强连通有向图上MAPF的小解假设成立

The Small Solution Hypothesis for MAPF on Strongly Connected Directed Graphs Is True

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

Bernhard Nebel

摘要:

多智能体有向图寻路算法(diMAPF)的计算复杂性的确定是一个开放的研究问题。虽然diMAPF已被证明是多项式的一些特殊情况下,只是最近,它已被确定,该问题是NP-困难的一般。进一步证明了,如果强连通有向图的短解假设是正确的,则diMAPF是NP问题。在本文中,它表明,这一假设确实是正确的,即使当一个允许同步旋转。

英文摘要:

The determination of the computational complexity of multi-agent pathfinding on directed graphs (diMAPF) has been an open research problem for many years. While diMAPF has been shown to be polynomial for some special cases, only recently, it has been established that the problem is NP-hard in general. Further, it has been proved that diMAPF will be in NP if the short solution hypothesis for strongly connected directed graphs is correct. In this paper, it is shown that this hypothesis is indeed true, even when one allows for synchronous rotations.

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

↑