Least levels disassembly graph method for selective disassembly planning - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Least levels disassembly graph method for selective disassembly planning

Résumé

As known, the number of possible disassembly sequences increases significantly with the number of the parts in a product. Thus, the generation of proper disassembly sequences order is critical. Most of existing methods often require tremendous computational resources while, at the same time, they often fail to find realistic and optimal solutions for complex products disassembly. For selective disassembly, for instance, it is important to eliminate the components unrelated with the target component prior to sequence generation and its evaluation. In order to address this configuration a method for generation the disassembly sequences in the case of selective disassembly is presented in this paper. Based on the least levels of disassembly product graph it allows reducing computation resources. Instead of considering the geometric constrains for each pair of components, the proposed method considers the geometric contact and collision relationships among the components in order to generate the disassembly graph for sequences planning and its evaluation as well. The method is applied for automatic generating the selective disassembly sequences considering of reducing the computation resources and illustrated through an example.
Fichier non déposé

Dates et versions

hal-00965965 , version 1 (25-03-2014)

Identifiants

  • HAL Id : hal-00965965 , version 1

Citer

Wang Cheng-Gang, Peter Mitrouchev, Guiqin Li. Least levels disassembly graph method for selective disassembly planning. 34th Computers and Information in Engineering Conference (IDETC/CIE 2014), Aug 2014, Buffalo, NY, United States. ⟨hal-00965965⟩
118 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More