A Fast and Practical Algorithm for Generalized Penetration Depth Computation

— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the minimal translational and rotational motion that separates the two objects. We formulate the PDg computation based on modeldependent distance metrics using displacement vectors. As a result, our formulation is independent of the choice of inertial and body-fixed reference frames, as well as specific representation of the configuration space. Furthermore, we show that the optimum answer lies on the boundary of the contact space and pose the computation as a constrained optimization problem. We use global approaches to find an initial guess and present efficient techniques to compute a local approximation of the contact space for iterative refinement. We highlight the performance of our algorithm on many complex models.

• Type: Conference
• Year: 2007
• Where: RSS
• Authors: Liangjun Zhang, Young J. Kim, Dinesh Manocha
• Keywords: Algorithm, Compute, Contact Space, Robotics, RSS 2007