Mechanical Product Disassembly And/Or Graph Construction
To plan mechanical product disassembly sequence efficiently, first, constructs all feasible subassemblies and all feasible disassembly operations by 1-dimension disassembly feasibility analysis algorithm, thereby gets an implicative Disassembly And/Or Graph (DAOG) in which the vertices are subassemblies and the directed edges are disassembly operations. Second, in order to search the optimal disassembly sequence based on the DAOG, discusses the uncertain weight value problem of directed edges, and proposes a dynamic calculation approach of weight value. Finally, by a case study, validates the high efficiency of disassembly sequences expression by DAOG.
1-dimension disassembly feasibility analysis Disassembly And/Or Graph uncertain weight value optimal disassembly sequence
MIN Shao-song ZHU Xiao-jun ZHU Xi
Naval University of Engineering, Wuhan, 430033, China
国际会议
长沙
英文
1752-1756
2010-03-13(万方平台首次上网日期,不代表论文的发表时间)