arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.08707cs.ROcs.AIcs.LGmath.DG
收藏

约束运动规划网络X

Constrained Motion Planning Networks X

University of California San Diego(加州大学圣地亚哥分校)

Ahmed H. Qureshi, Jiangeng Dong, Asfiya Baig, Michael C. Yip

摘要:

受约束的运动规划是一个具有挑战性的研究领域,旨在寻找计算效率高的方法,可以在给定的起始和目标配置之间的约束流形上找到无碰撞路径。这些规划问题经常出现,例如在机器人操作执行日常生活辅助任务。然而,很少有约束运动规划的解决方案是可用的,并且那些存在的解决方案在寻找流形上的路径解决方案时与高计算时间复杂度作斗争。为了解决这一挑战,我们提出了约束运动规划网络X(CoMPNetX)。它是一种神经规划方法,包括条件深度神经生成器和基于神经梯度的快速投影算子。我们还介绍了神经任务和场景表示的条件下,CoMPNetX生成隐式流形配置涡轮增压任何底层的经典规划,如基于采样的运动规划方法,快速解决复杂的约束规划任务。我们表明,在各种具有挑战性的场景中,我们的方法比最先进的传统路径查找工具能够以更高的成功率和更低的计算时间找到路径解决方案。

英文摘要:

Constrained motion planning is a challenging field of research, aiming for computationally efficient methods that can find a collision-free path on the constraint manifolds between a given start and goal configuration. These planning problems come up surprisingly frequently, such as in robot manipulation for performing daily life assistive tasks. However, few solutions to constrained motion planning are available, and those that exist struggle with high computational time complexity in finding a path solution on the manifolds. To address this challenge, we present Constrained Motion Planning Networks X (CoMPNetX). It is a neural planning approach, comprising a conditional deep neural generator and discriminator with neural gradients-based fast projection operator. We also introduce neural task and scene representations conditioned on which the CoMPNetX generates implicit manifold configurations to turbo-charge any underlying classical planner such as Sampling-based Motion Planning methods for quickly solving complex constrained planning tasks. We show that our method finds path solutions with high success rates and lower computation times than state-of-the-art traditional path-finding tools on various challenging scenarios.

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

↑