| Assembly as the final stage and key links in the manufacturing process,has a direct impact on the assembly accuracy,efficiency and cost.With the development of concurrent engineering and assembly-oriented design,how to quickly and efficiently acquire assembly sequences and paths has become a key issue in improving the degree of automated assembly.Therefore,this paper takes the hybrid assembly model as the core and carries out the assembly sequence and assembly path planning based on the hybrid assembly model,and provides the theoretical and technical methods for optimizing the product assembly.In order to solve the problem that the non-geometric information is not perfect and the information integration is not high enough,a hybrid assembly model based on topology polychromatic sets theory is proposed to realize the effective integration and matrix expression of component information,hierarchical structure and assembly constraint information for the subsequent assembly planning.Due to the low efficiency and high cost of the traditional assembly sequence planning method,this paper proposes a hybrid PSO-IGA parallel assembly sequence planning method based on the constructed hybrid assembly model.Firstly,analyzing the constraint relation between components,and constructing the evaluation index of assembly sequence planning,then constructing the fitness function based on the assembly sequence evaluation index to reduce the assembly cost and save the assembly time.Secondly,proposing a hybrid PSO-IGA algorithm for the limitations of PSO and GA.Finally,the output shaft assembly of the gear unit is taken as an example to verify the effectiveness of the algorithm.This paper presents an assembly path planning method based on 3D Maklink graph theory and improved ant colony for the shortcomings of assembly path planning search algorithm which are easy to local convergence and convergence speed..Firstly,extending the traditional Maklink diagram to the 3D planning environment,constructing the 3D assembly environment model,and searching the initial assembly path based on the Dijkstra algorithm.Secondly,the heuristic function and the pheromone updating method are improved by improving the global search ability of the ant colony algorithm and avoiding the local optimization.Finally,by comparing with the traditional modeling and search algorithms to verify the effectiveness of the path planning method in the assembly.In the end,the application of a model radiator assembly system is taken as an example,and the rationality and effectiveness of the proposed theory and method are verified. |