SEAR:一种多项式时间的多机器人路径规划算法
SEAR: A Polynomial-Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee
摘要:
我们研究了连续的2D和3D域中的标记多机器人路径规划问题,在没有障碍物的机器人必须不相互碰撞。对于任意数量的机器人在任意的初始和目标安排,我们推导出一个多项式时间,完整的算法,产生的解决方案与常数因子的最优保证的最大完工时间和距离最优,在预期中,假设机器人标签均匀随机分布。我们的算法只需要一个小的常数因子扩展的初始和目标配置的足迹来解决这个问题,即,该问题可以在相当小的有界区域内求解。除了理论保证,我们提出了一个彻底的计算评估所提出的解决方案。除了基线实现,适应一个有效的(但非多项式时间)路由子例程,我们还提供了一个高效的实现,快速计算接近最优的解决方案。在由非完整机器人组成的microMVP平台上进行的硬件实验证实了算法流水线的实用性。
英文摘要:
We study the labeled multi-robot path planning problem in continuous 2D and 3D domains in the absence of obstacles where robots must not collide with each other. For an arbitrary number of robots in arbitrary initial and goal arrangements, we derive a polynomial time, complete algorithm that produces solutions with constant-factor optimality guarantees on both makespan and distance optimality, in expectation, under the assumption that the robot labels are uniformly randomly distributed. Our algorithm only requires a small constant factor expansion of the initial and goal configuration footprints for solving the problem, i.e., the problem can be solved in a fairly small bounded region. Beside theoretical guarantees, we present a thorough computational evaluation of the proposed solution. In addition to the baseline implementation, adapting an effective (but non-polynomial time) routing subroutine, we also provide a highly efficient implementation that quickly computes near-optimal solutions. Hardware experiments on the microMVP platform composed of non-holonomic robots confirms the practical applicability of our algorithmic pipeline.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。