CAD-based AND/OR Graph Generation Algorithms in (Dis)assembly Sequence Planning of Complex Products

Abstract

Several studies in production engineering and operations research focused on disassembly and assembly planning for improving the profitability of remanufacturing. The representation of feasible (dis)assembly sequences by analyzing geometrical and technical precedence constraints is an essential necessity of (dis)assembly planning. An AND/OR graph (AOG) is commonly used to represent a product’s feasible (dis)assembly sequences, including alternative subassemblies and parallel operations. In recent years, researchers studied the automatic extraction of geometrical precedence constraints by collision analysis within 3D models. However, since most of the existing approaches focused on collision analysis to identify complex precedence constraints, the generation of AOGs for complex products from collision analysis results remains too inefficient for industrial use cases. In this study, a Computer-Aided Design (CAD) interface from previous studies is used to extract liaison and moving wedge information from 3D models. A top-down and a bottom-up approach for generating complete AOGs from the extracted data are introduced. The approaches’ computing performances are analyzed on sample test cases and CAD models. The bottom-up approach performed better for the given samples. It has been found that the amount of moving wedge constraints has a strong effect on computing performance. It is a strong indicator to estimate the complexity of products under examination. The exponential behavior of the needed computing resources can be estimated beforehand. For complex products, graph simplification or alternative graph representations with less information richness should be considered. The results contribute to automated (dis)assembly sequence planning from complex products and, consequently, increasing remanufacturing profitability.