Research Of Complex Two-Dimensional Irregular Parts Packing Algorithm Based On Principal Component Analysis

Two-dimensional irregular packing problems exist widely in production and life.Due to the continuous improvement in the industrial level,the packing problem of complex two-dimensional irregular gradually appeared.The complex two-dimensional irregular packing problem is a layout optimization problem,and the purpose is to arrange as many complicated irregular parts of different shapes as possible on plate.The basic process is to first rotate a complex irregular part to find a suitable angle,and then make the part collision.In order to obtain a better packing effect,complex irregular parts can be rotated at any angle during packing.However,most of the current packing algorithms use the interval angles and select the appropriate rotation angle to rotate the part.This method has low packing efficiency,easy to miss the optimal packing position,and the packing effect is poor.In addition,the current packing collision algorithms are mostly designed for simple irregular parts,and it is difficult to achieve efficient collision of complex irregular parts.In order to achieve the concave and convex feature matching between parts and improve the utilization of materials.Aiming at the rotation problem of complex irregular parts,a packing rotation algorithm based on principal component analysis is proposed.Firstly,the convex features of complex irregular parts are extracted.Then,the principal component analysis is applied to the convex features of the parts to obtain the direction of the convex features,and finally the valuable rotation angle of the parts is obtained.For the problem of complex irregular parts collision,a collision algorithm based on pixel method and forward line is proposed,which can complete the collision operation of complex irregular parts without judgment of cross.For the problem of low efficiency of packing,the multi-process parallel algorithm and the sequential optimization algorithm can be combined to make full use of the multi-core performance of the computer and reduce the optimization time of the packing sequence.In order to verify the proposed algorithm,this paper builds a complex two-dimensional irregular packing prototype system and uses the relevant data to verify the packing algorithm of this paper.The experiment proves that the part rotation algorithm based on principal component analysis can realize the matching between the concave convex features of parts more easily,and it can improve the packing fill rate and reduce the packing time.The collision algorithm based on the pixel method and the forward line can realize the collision between complex irregular parts without judging cross.The parallel operation method can improve the efficiency of the packing sequence optimization algorithm and reduce the optimization time.In addition,the prototype system developed in this paper can realize data reading,automatic packing and post-processing.