Research and realization of algorithms of assembly sequence planning

摘要

The research on automatic generation of assembling procedure is one of the key techniques of virtual assembly. This paper chooses the algorithm of mating conditions to solve the problem. In this work, the components of an assembly and their mutual relations in this assembly, especially the mating conditions, describe the assembly. From the mating conditions of the components, an assembling procedure is generated in two steps. First, each component in an assembly is located at a special vertex of a hierarchical tree. Second, an assembling procedure is generated from the hierarchical tree with the help of interference checking. The paper adds some constraints to lower the amount of the calculation of the original algorithm, making the algorithm more consummate.