arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.12219cs.ROcs.CG
收藏

无碰撞构型空间的认证多面体分解

Certified Polyhedral Decompositions of Collision-Free Configuration Space

Massachusetts Institute of Technology (MIT)(麻省理工学院(MIT));Toyota Research Institute(丰田研究院)

Hongkai Dai, Alexandre Amice, Peter Werner, Annan Zhang, Russ Tedrake

AI总结:

本文提出 C-IRIS 方法,利用半定规划在有理参数化构型空间中生成经严格认证的无碰撞凸多面体区域,并验证了其在多自由度机械手上的可扩展性。

摘要:

在任务空间障碍物存在的情况下理解无碰撞构型空间(C-free)的几何结构,是无碰撞运动规划的一个基本要素。虽然可以使用标准算法在单个点上检查碰撞,但迄今为止,由于通过运动学将任务空间障碍物映射到构型空间的复杂性,尚不存在计算具有严格认证的 C-free 区域的实用方法。在这项工作中,据我们所知,我们提出了第一种严格方法,用于将 C-free 的有理参数化近似分解为经认证的多面体区域。我们的方法称为 C-IRIS(C-space Iterative Regional Inflation by Semidefinite programming,基于半定规划的构型空间迭代区域膨胀),在构型空间的有理参数化中生成大型凸多面体,这些多面体经过严格认证为无碰撞。已有研究表明,此类区域对于基于优化的运动规划和随机运动规划都很有用。基于凸优化,我们的方法适用于任意维度,仅对任务空间中障碍物的凸性作出假设,并且速度足够快,可以扩展到操作中的现实问题。我们在若干个 2 自由度示例中展示了算法填充非平凡数量无碰撞 C-space 的能力,这些示例中的 C-space 可以被可视化;同时展示了算法在 7 自由度 KUKA iiwa、6 自由度 UR3e 和 12 自由度双臂机械手上的可扩展性。我们的算法实现已在 Drake 中开源。此外,我们还在交互式 Python notebook 中提供了算法示例。

英文摘要:

Understanding the geometry of collision-free configuration space (C-free) in the presence of task-space obstacles is an essential ingredient for collision-free motion planning. While it is possible to check for collisions at a point using standard algorithms, to date no practical method exists for computing C-free regions with rigorous certificates due to the complexity of mapping task-space obstacles through the kinematics. In this work, we present the first to our knowledge rigorous method for approximately decomposing a rational parametrization of C-free into certified polyhedral regions. Our method, called C-IRIS (C-space Iterative Regional Inflation by Semidefinite programming), generates large, convex polytopes in a rational parameterization of the configuration space which are rigorously certified to be collision-free. Such regions have been shown to be useful for both optimization-based and randomized motion planning. Based on convex optimization, our method works in arbitrary dimensions, only makes assumptions about the convexity of the obstacles in the task space, and is fast enough to scale to realistic problems in manipulation. We demonstrate our algorithm's ability to fill a non-trivial amount of collision-free C-space in several 2-DOF examples where the C-space can be visualized, as well as the scalability of our algorithm on a 7-DOF KUKA iiwa, a 6-DOF UR3e and 12-DOF bimanual manipulators. An implementation of our algorithm is open-sourced in Drake. We furthermore provide examples of our algorithm in interactive Python notebooks.

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

↑