Efficient global penetration depth computation for articulated models

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

3 Scopus Citations
View graph of relations

Author(s)

  • Hao Tian
  • Xinyu Zhang
  • Changbo Wang
  • Jia Pan
  • Dinesh Manocha

Detail(s)

Original languageEnglish
Pages (from-to)116-125
Journal / PublicationCAD Computer Aided Design
Volume70
Publication statusPublished - 1 Jan 2016
Externally publishedYes

Abstract

We present an algorithm for computing the global penetration depth between an articulated model and an obstacle or between the distinctive links of an articulated model. In so doing, we use a formulation of penetration depth derived in configuration space. We first compute an approximation of the boundary of the obstacle regions using a support vector machine in a learning stage. Then, we employ a nearest neighbor search to perform a runtime query for penetration depth. The computational complexity of the runtime query depends on the number of support vectors, and its computational time varies from 0.03 to 3 milliseconds in our benchmarks. We can guarantee that the configuration realizing the penetration depth is penetration free, and the algorithm can handle general articulated models. We tested our algorithm in robot motion planning and grasping simulations using many high degree of freedom (DOF) articulated models. Our algorithm is the first to efficiently compute global penetration depth for high-DOF articulated models.

Research Area(s)

  • Articulated models, Configuration space, Penetration depth, Support vector machine

Citation Format(s)

Efficient global penetration depth computation for articulated models. / Tian, Hao; Zhang, Xinyu; Wang, Changbo; Pan, Jia; Manocha, Dinesh.

In: CAD Computer Aided Design, Vol. 70, 01.01.2016, p. 116-125.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review