基于顶点枚举的多面体碰撞检测
Polyhedral Collision Detection via Vertex Enumeration
AI总结:
本文提出一种基于凸区域顶点枚举的多面体碰撞检测框架,将符号距离转化为双层优化约束,在可靠性和速度上优于现有方法。
摘要:
碰撞检测是机器人技术中的一项关键功能。对于除球体以外的任何形状,物体碰撞的程度无法表示为连续可微函数。本文提出了一个处理多面体形状之间碰撞检测的框架。我们将两个多面体之间的有符号距离构造为一个凸优化问题的最优值,并考虑在双层优化问题中约束该有符号距离。为了避免依赖专门的双层求解器,我们的方法利用了有符号距离是与两个物体相关的凸区域的最小点这一事实。我们的方法枚举该区域所有极值点处取得的值,并将它们作为约束列入上层问题中。在使用相同的混合互补问题求解器求解时,我们将我们的公式与现有方法在可靠性和速度方面进行了比较。我们证明,与其他方法相比,我们的方法能更可靠地解决具有多个障碍物的困难碰撞检测问题,并且在某些情况下比现有方法更快。
英文摘要:
Collision detection is a critical functionality for robotics. The degree to which objects collide cannot be represented as a continuously differentiable function for any shapes other than spheres. This paper proposes a framework for handling collision detection between polyhedral shapes. We frame the signed distance between two polyhedral bodies as the optimal value of a convex optimization, and consider constraining the signed distance in a bilevel optimization problem. To avoid relying on specialized bilevel solvers, our method exploits the fact that the signed distance is the minimal point of a convex region related to the two bodies. Our method enumerates the values obtained at all extreme points of this region and lists them as constraints in the higher-level problem. We compare our formulation to existing methods in terms of reliability and speed when solved using the same mixed complementarity problem solver. We demonstrate that our approach more reliably solves difficult collision detection problems with multiple obstacles than other methods, and is faster than existing methods in some cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。