Cart (Loading....) | Create Account
Close category search window
 

Subassembly identification and evaluation for assembly planning

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

1 Author(s)
Sukhan Lee ; Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA

This paper presents a method for the automatic generation of assembly sequences from a liaison graph representation of an assembly through the recursive decomposition of assembly into subassemblies. In order to increase the planning efficiency, the proposed assembly planning system automatically identifies and avoids those decomposition that incur physically infeasible assembly operation. This is achieved by merging those parts that can not be mutually separable at the current stage of assembly planning due to interconnection infeasibility as well as functional dependency. The above merging process transforms the original liaison graph into an abstract liaison graph with smaller number of nodes. Then, weights are assigned to each liaison of abstract liaison graph based on the stability and structural connectivity associated with liaison such that these weights are used to extract the tentative subassemblies. To select preferred subassemblies, the extracted tentative subassemblies are evaluated based on the subassembly selection indices defined in terms of mobility, structural preference, stability, and parallelism. Furthermore, by adjusting the assembly coefficients of subassembly selection indices according to given assembly environment, an optimal assembly sequence can be generated. The application of the proposed planning system to the tabletop vise assembly is illustrated as an example

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:24 ,  Issue: 3 )

Date of Publication:

Mar 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.