Show simple item record

dc.contributor.advisorMarefat, Michael M.en_US
dc.contributor.authorYang, Fan
dc.creatorYang, Fanen_US
dc.date.accessioned2011-12-06T13:44:02Z
dc.date.available2011-12-06T13:44:02Z
dc.date.issued2009en_US
dc.identifier.urihttp://hdl.handle.net/10150/195237
dc.description.abstractThis dissertation focuses on compliant motion planning designed for robotic assembly. A Discrete Complaint Motion Planner (DCMP) reacts to detected discrete contact state transitions and issues compliant motion command to the underlying continuous robot system. It consists of a Qualitative Contact Model, a Compliant Motion Strategy Planner (CMSP) and a Compliant Motion Command Planner (CMCP).How to model and characterize a contact state is a major issue. In this dissertation, contact states are described using the qualitative configuration representation called Feature Interaction Matrix (FIM). A FIM encodes not only the contact information but also the relative configuration between two polyhedral parts. This FIM-based qualitative contact state model has several contributions: 1) an optimization-based approach is developed to verify the hypothetical states in FIM; 2) penetration check for hypothetical contact states through constraint satisfaction is simple and fast; 3) spatial adjacency can be easily determined using convex cone techniques; 4) a generate-and-test method is proposed to expand qualitative states in FIM; 5) compliant motion parameters are derived by an optimization method.The qualitative contact states and how they are connected is modeled with an adjacency graph/sub-graph, where nodes represent qualitative contact states and spatially adjacent contact states are connected by arcs. Each arc represents a desired contact state transition. The CMSP receives contact state transition event from an on-line estimator, then computes/checks the assembly strategy and issues the next desired contact state transition to the CMCP. The compliant motion strategy is computed using graph-search techniques with the automatic construction of the adjacency graph/sub-graph. The CMSP integrate hypotheses generation, hypotheses verification, spatial adjacency and graph search algorithms.When the next desired contact state transition is received, the CMCP computes the compliant motion parameters that are issued to the underlying continues robot system to achieve the desired contact state transition. The generation of motion parameters is defined as an optimization problem and an algorithm is developed to solve it.The DCMP in this dissertation considers both 3D translational and 3D rotational motions. Experiments are carried out to demonstrate the feasibility of the approach for the automatic assembly of polyhedral parts.
dc.language.isoENen_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.subjectcompliant motion planningen_US
dc.subjectcontact modelen_US
dc.subjectcontact statesen_US
dc.subjectmotion commanden_US
dc.subjectmotion strategyen_US
dc.subjectrobotic assemblyen_US
dc.titleDISCRETE COMPLIANT MOTION PLANNING SYSTEM FOR ROBOTIC ASSEMBLYen_US
dc.typetexten_US
dc.typeElectronic Dissertationen_US
dc.contributor.chairMarefat, Michael M.en_US
dc.identifier.oclc659750856en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.leveldoctoralen_US
dc.contributor.committeememberWang, Janet M.en_US
dc.contributor.committeememberSzilagyi, Miklos N.en_US
dc.identifier.proquest10255en_US
thesis.degree.disciplineElectrical & Computer Engineeringen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.namePh.D.en_US
refterms.dateFOA2018-06-17T09:26:53Z
html.description.abstractThis dissertation focuses on compliant motion planning designed for robotic assembly. A Discrete Complaint Motion Planner (DCMP) reacts to detected discrete contact state transitions and issues compliant motion command to the underlying continuous robot system. It consists of a Qualitative Contact Model, a Compliant Motion Strategy Planner (CMSP) and a Compliant Motion Command Planner (CMCP).How to model and characterize a contact state is a major issue. In this dissertation, contact states are described using the qualitative configuration representation called Feature Interaction Matrix (FIM). A FIM encodes not only the contact information but also the relative configuration between two polyhedral parts. This FIM-based qualitative contact state model has several contributions: 1) an optimization-based approach is developed to verify the hypothetical states in FIM; 2) penetration check for hypothetical contact states through constraint satisfaction is simple and fast; 3) spatial adjacency can be easily determined using convex cone techniques; 4) a generate-and-test method is proposed to expand qualitative states in FIM; 5) compliant motion parameters are derived by an optimization method.The qualitative contact states and how they are connected is modeled with an adjacency graph/sub-graph, where nodes represent qualitative contact states and spatially adjacent contact states are connected by arcs. Each arc represents a desired contact state transition. The CMSP receives contact state transition event from an on-line estimator, then computes/checks the assembly strategy and issues the next desired contact state transition to the CMCP. The compliant motion strategy is computed using graph-search techniques with the automatic construction of the adjacency graph/sub-graph. The CMSP integrate hypotheses generation, hypotheses verification, spatial adjacency and graph search algorithms.When the next desired contact state transition is received, the CMCP computes the compliant motion parameters that are issued to the underlying continues robot system to achieve the desired contact state transition. The generation of motion parameters is defined as an optimization problem and an algorithm is developed to solve it.The DCMP in this dissertation considers both 3D translational and 3D rotational motions. Experiments are carried out to demonstrate the feasibility of the approach for the automatic assembly of polyhedral parts.


Files in this item

Thumbnail
Name:
azu_etd_10255_sip1_m.pdf
Size:
2.547Mb
Format:
PDF
Description:
azu_etd_10255_sip1_m.pdf

This item appears in the following Collection(s)

Show simple item record