By Topic

Representations of mechanical assembly sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Homem de Mello, L.S. ; Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA ; Sanderson, A.C.

Five types of representations for assembly sequences are reviewed: the directed graph of feasible assembly sequences; the AND/OR graph of feasible assembly sequences; the set of establishment conditions, and two types of precedence relationships namely those between the establishment of one connection between parts and the establishment of another connection, and those between the establishment of one connection and states of the assembly process. The mappings of one representation into the others are established. The correctness and completeness of these representations are established. The results presented are needed in the proof of correctness and completeness of algorithms for the generation of mechanical assembly sequences

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:7 ,  Issue: 2 )