低多项式时间复杂度下网格上期望$1.x$-Makespan最优的多智能体路径规划(MAPF)
Expected $1.x$-Makespan-Optimal MAPF on Grids in Low-Poly Time
AI总结:
针对多智能体路径规划最优求解难、现有常数因子最优算法因子大的问题,提出分层整合RTA的低多项式时间算法,在高/全密度网格下获接近1.5的最优性保证且可扩展性强。
摘要:
多智能体路径规划(Multi-Agent Path Finding, MAPF)的最优求解是NP难问题,即便在图结构上也是如此,这意味着不存在多项式时间算法能计算出其精确最优解。这自然引出一个问题:多项式时间算法能达到怎样的最优程度?目前已有能计算常数因子最优解的算法,但常数因子通常很大,限制了其应用潜力。\n在本研究的诸多突破中,我们提出了首个低多项式时间的MAPF算法,在高达1/3的智能体密度下,针对随机实例,能以高概率为二维(对应三维)网格提供1-1.5(对应1-1.67)的渐近makespan(完工时间)最优性保证。此外,当引入规则分布的障碍物时,我们的方法性能不会下降。这些方法可推广至支持100%的智能体密度。\n无论维度和密度如何,我们的高质量方法都得益于两个关键模块的独特分层整合。高层我们采用带标记的Grid Rearrangement Algorithm(网格重排算法,RTA),它能通过行/列洗牌在网格上执行高效重构。低层我们设计了新方法,能高效模拟RTA返回的行/列洗牌操作。\n我们基于RTA的算法实现在大量数值评估中表现极佳,与其他SOTA(当前最优)方法相比展现出出色的可扩展性。例如,在三维场景中,基于RTA的算法可轻松扩展到拥有超过37万个顶点和超过12万个智能体的网格,并且始终能达到接近1.5的保守makespan最优性,与我们的理论分析预测一致。
英文摘要:
Multi-Agent Path Finding (MAPF) is NP-hard to solve optimally, even on graphs, suggesting no polynomial-time algorithms can compute exact optimal solutions for them. This raises a natural question: How optimal can polynomial-time algorithms reach? Whereas algorithms for computing constant-factor optimal solutions have been developed, the constant factor is generally very large, limiting their application potential. In this work, among other breakthroughs, we propose the first low-polynomial-time MAPF algorithms delivering $1$-$1.5$ (resp., $1$-$1.67$) asymptotic makespan optimality guarantees for 2D (resp., 3D) grids for random instances at a very high $1/3$ agent density, with high probability. Moreover, when regularly distributed obstacles are introduced, our methods experience no performance degradation. These methods generalize to support $100\%$ agent density. Regardless of the dimensionality and density, our high-quality methods are enabled by a unique hierarchical integration of two key building blocks. At the higher level, we apply the labeled Grid Rearrangement Algorithm (RTA), capable of performing efficient reconfiguration on grids through row/column shuffles. At the lower level, we devise novel methods that efficiently simulate row/column shuffles returned by RTA. Our implementations of RTA-based algorithms are highly effective in extensive numerical evaluations, demonstrating excellent scalability compared to other SOTA methods. For example, in 3D settings, \rta-based algorithms readily scale to grids with over $370,000$ vertices and over $120,000$ agents and consistently achieve conservative makespan optimality approaching $1.5$, as predicted by our theoretical analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。