1. Optimal assembly sequence based on design for assembly (DFA) rules
- Author
-
Albert Rosich, Ine Melckenbeeck, Jeroen Vancraen, Sofie Burggraeve, and Bart Van Doninck
- Subjects
0209 industrial biotechnology ,Sequence ,Computer science ,Design for assembly ,02 engineering and technology ,Construct (python library) ,010501 environmental sciences ,computer.software_genre ,01 natural sciences ,020901 industrial engineering & automation ,Global optimum ,Product (mathematics) ,General Earth and Planetary Sciences ,Computer Aided Design ,computer ,Algorithm ,0105 earth and related environmental sciences ,General Environmental Science ,Distance based - Abstract
When designing a product, care must be taken to ensure that the product can be assembled later on at the manufacturing floor. This paper presents a methodology that takes in a CAD design to check its ease of assembly. The proposed methodology can calculate feasibility scores for an assembly step, then use these scores to calculate the optimal sequence of such assembly steps to construct the end product from its loose parts. Two assembly step scoring rules are presented: local and global assembly feasibility. Local assembly feasibility determines the directions in which two subassemblies can move apart an infinitesimally small distance based on contact faces between the subassemblies. Global assembly feasibility considers whether this small distance can be extended to infinity, by checking the overlap of projections of the pair of subassemblies in locally feasible directions. For both of these rules, problems are reduced to previously calculated scores whenever possible, in order to reduce calculation time. These rules are integrated in an algorithm which generates a complete assembly sequence. This assembly sequence is guaranteed to be the global optimum for the given rules. The algorithm successfully generates an assembly sequence for a small example case; the simplification rules reduced the number of local and global assembly feasibility checks by a factor 10 and 6, respectively.
- Published
- 2020
- Full Text
- View/download PDF