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.