Verifying contact hypotheses of planar, polyhedral objects using penetration growth distance

Barry B. Goeree, Ernest D. Fasse, Michael M. Marefat

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

The contact between two planar, polyhedral objects can be represented with a set of elementary contacts - face-vertex contacts. However, not all possible contact representations are geometrically possible. Verification of whether a set of elementary contacts is geometrically feasible is in particular difficult if the elementary contacts do not fully constrain the relative configuration of the objects. These are exactly the contact descriptions that allow the objects to move compliantly with respect to each other and are therefore important for motion planning. An equivalent optimization problem is posed to verify geometric feasibility of contact descriptions that do not fully constrain the relative configuration. A trajectory following algorithm has been implemented and applied to test feasible and infeasible contact representations. The results of this work can be used to implement a predicate that verifies whether a contact representation is geometrically possible.

Original languageEnglish (US)
Pages (from-to)233-246
Number of pages14
JournalRobotics and Computer-Integrated Manufacturing
Volume17
Issue number3
DOIs
StatePublished - Jun 1 2001

Keywords

  • Assembly planning
  • Contact
  • Nonconvex polyhedra

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Mathematics(all)
  • Computer Science Applications
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Verifying contact hypotheses of planar, polyhedral objects using penetration growth distance'. Together they form a unique fingerprint.

  • Cite this