Planning And Optimization Of Planar Cutting Path

Plane cutting in the manufacturing of materials processing occupies a large proportion,with the demographic dividend subsided,manufacturing production costs increased year by year,forcing some of the traditional manufacturing industry to consider how the backward production process to the automated production transformation.As a plane cutting process involved in the processing of sheet metal,how to cut the already determined cutting parts to find a shorter cutting path to reduce the production and processing time,reduce equipment wear and improve the quality of cutting and other issues,naturally became Industry and academia research hotspots,this is the plane cutting path planning and optimization issues.On the basis of summarizing the predecessors' work,this paper puts forward some improved algorithms and schemes for the planning and optimization of the cutting path of the plane cutting method which has been determined by the cutting plane.The work of this paper is mainly composed of the following parts:1.Based on the special format of DXF file,the interface function and data structure of plane cutting map reading and storage are proposed.Based on the basic metadata of storage,the recognition and storage of closed loop is proposed.Algorithm,and proposes a framework for automatic path routing algorithm for automatic single-batch multi-cut drawing.2.In the aspect of planning and optimization of plane cutting path: Based on the geometric characteristics of cutting parts,the construction of mathematical model of cutting path is discussed.The method of taboo greedy algorithm is used to optimize the empty path of cutting path and study the greedy criterion weight coefficient and the use of tabu greedy algorithm in different models under the plane cutting path optimization solution.3.In the aspect of modeling and optimization of planar cutting paths with multiple nested closed loops,a closed loop recognition algorithm is proposed.A four-way chain table is proposed to model the plane cutting path including multiple nested closed loops.The plane cutting path is transformed into the dynamic traveling salesman model,and finally the method of using the taboo greedy algorithm(several times)is proposed to solve the plane cutting path,and the simulation case is given.4.In some plane cutting out of the protection of the cutting parts,and the need to add the cutting guide line: put forward the plate semantic information to determine the algorithm;proposed cutting line automatically add,interference judgments,automatic adjustment algorithm.