协调运动规划:密集填充有界域中的多智能体路径寻找
Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
AI总结:
本文研究简单多格骨牌中每格一个智能体的密集多智能体路径寻找,刻画可重构性与 makespan 形状参数,并给出在严重受限机动空间下渐近最坏情况最优的协调算法。
摘要:
我们研究在单连通域内部对带标签智能体排列进行的多智能体路径寻找(Multi-Agent Path Finding):给定每个智能体唯一的起始位置和目标位置,目标是找到一系列并行、无碰撞的智能体运动,使所有智能体到达各自目标之前的总时间(即 makespan,完工时间)最小。一个自然情形是具有轴平行边界和整数坐标的单连通多边形域,即简单多格骨牌(simple polyomino),它等价于格点单位正方形或单元的单连通并集。我们关注尤其具有挑战性的密集填充智能体设置,即每个单元中有一个智能体,这会强烈限制智能体的移动性,并需要复杂的运动协调。我们为该问题提供了一系列新颖结果,包括:(1)刻画保证存在重构计划的多格骨牌;(2)刻画会诱导 makespan 最坏情况界的形状参数;(3)提出一套算法,对于机动空间严重受限的情形,在可实现的拉伸比方面达到渐近最坏情况最优性能。这对应于界定所得 makespan 与下界之间的比率,该下界由任意智能体起始位置和目标位置之间的最大-最小距离以及我们的形状参数给出。我们的结果扩展了 Demaine 等人(SIAM Journal on Computing,2019)的发现,他们研究了实心矩形域上的该问题;同时也扩展了密切相关的置换路由领域中的成果,如 Alpert 等人(Computational Geometry,2022)针对网格图凸块所呈现的工作。
英文摘要:
We study Multi-Agent Path Finding for arrangements of labeled agents in the interior of a simply connected domain: Given a unique start and target position for each agent, the goal is to find a sequence of parallel, collision-free agent motions that minimizes the overall time (the makespan) until all agents have reached their respective targets. A natural case is that of a simply connected polygonal domain with axis-parallel boundaries and integer coordinates, i.e., a simple polyomino, which amounts to a simply connected union of lattice unit squares or cells. We focus on the particularly challenging setting of densely packed agents, i.e., one per cell, which strongly restricts the mobility of agents, and requires intricate coordination of motion. We provide a variety of novel results for this problem, including (1) a characterization of polyominoes in which a reconfiguration plan is guaranteed to exist; (2) a characterization of shape parameters that induce worst-case bounds on the makespan; (3) a suite of algorithms to achieve asymptotically worst-case optimal performance with respect to the achievable stretch for cases with severely limited maneuverability. This corresponds to bounding the ratio between obtained makespan and the lower bound provided by the max-min distance between the start and target position of any agent and our shape parameters. Our results extend findings by Demaine et al. (SIAM Journal on Computing, 2019) who investigated the problem for solid rectangular domains, and in the closely related field of Permutation Routing, as presented by Alpert et al. (Computational Geometry, 2022) for convex pieces of grid graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。