arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.02735cs.RO
收藏

多项式时间近时间最优三维多机器人路径规划及其在大规模UAV协调中的应用

Polynomial Time Near-Time-Optimal Multi-Robot Path Planning in Three Dimensions with Applications to Large-Scale UAV Coordination

Rutgers, the State University of New Jersey(罗格斯大学(新泽西州立大学))

Teng Guo, Siwei Feng, Jingjin Yu

摘要:

为了实现高效,大规模的协调无人机(UAV)的标签设置下,在这项工作中,我们开发了第一个多项式时间算法的重新配置的许多移动机构在三维空间中,可证明$1.x$渐近最大完工时间最优保证下的高机器人密度。更确切地说,在一个$m_1\times m_2 \times m_3$网格,$m_1\ge m_2\ge m_3$,我们的方法计算路由到$\frac{m_1m_2m_3}{3}$唯一标记的机器人均匀随机分布的开始和目标配置内的$m_1 + 2m_2 +2m_3+o(m_1)$的完工时间的解决方案,具有很高的概率。由于此类实例的最大完工时间下限是$m_1 + m_2+m_3 - o(m_1)$,与$m_1 \to \infty$一样具有高概率,因此实现了$\frac{m_1+2m_2+2m_3}{m_1+m_2+m_3}$最优性保证。$\frac{m_1+2m_2+2m_3}{m_1+m_2+m_3} \in (1, \frac{5}{3}]$,产生$1.x$最优性。与此相反,众所周知,多机器人路径规划是NP-难的最佳解决方案。在数值评估中,我们的方法很容易扩展,以支持在3D的$100,000$机器人的运动规划,同时实现$1.x$最优。我们证明了我们的方法在协调许多四轴飞行器在仿真和硬件实验中的应用。

英文摘要:

For enabling efficient, large-scale coordination of unmanned aerial vehicles (UAVs) under the labeled setting, in this work, we develop the first polynomial time algorithm for the reconfiguration of many moving bodies in three-dimensional spaces, with provable $1.x$ asymptotic makespan optimality guarantee under high robot density. More precisely, on an $m_1\times m_2 \times m_3$ grid, $m_1\ge m_2\ge m_3$, our method computes solutions for routing up to $\frac{m_1m_2m_3}{3}$ uniquely labeled robots with uniformly randomly distributed start and goal configurations within a makespan of $m_1 + 2m_2 +2m_3+o(m_1)$, with high probability. Because the makespan lower bound for such instances is $m_1 + m_2+m_3 - o(m_1)$, also with high probability, as $m_1 \to \infty$, $\frac{m_1+2m_2+2m_3}{m_1+m_2+m_3}$ optimality guarantee is achieved. $\frac{m_1+2m_2+2m_3}{m_1+m_2+m_3} \in (1, \frac{5}{3}]$, yielding $1.x$ optimality. In contrast, it is well-known that multi-robot path planning is NP-hard to optimally solve. In numerical evaluations, our method readily scales to support the motion planning of over $100,000$ robots in 3D while simultaneously achieving $1.x$ optimality. We demonstrate the application of our method in coordinating many quadcopters in both simulation and hardware experiments.

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

↑