Automatic Generation of High-Level Contact State Space

A divide-and-merge approach is introduced for automatic generation of high-level, discrete contact state space, represented as contact state graphs, between two contacting polyhedral solids from their geometric models. Based on the fact that a contact state graph is the union of the subgraphs called...

Full description

Saved in:
Bibliographic Details
Published in:The International journal of robotics research 2001-07, Vol.20 (7), p.584-606
Main Authors: Xiao, Jing, Ji, Xuerong
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A divide-and-merge approach is introduced for automatic generation of high-level, discrete contact state space, represented as contact state graphs, between two contacting polyhedral solids from their geometric models. Based on the fact that a contact state graph is the union of the subgraphs called a goal-contact relaxation (GCR) graph, the approach consists of algorithms (1) to generate a complete GCR graph automatically given the most constrained contact state in the GCR graph and (2) to merge GCR graphs automatically. The algorithms arplemented for cases in which the most constrained contact state in a GCR graph consists of up to three principal contacts. The ability to capture and represent contact state information effectively and efficiently is essential for robotic operations involving compliant motions, for simulation of contact motions, and for haptic interactions.
ISSN:0278-3649
1741-3176
DOI:10.1177/02783640122067552