Research and Application of Euler Cutting Path Based Optimisation Algorithm with Greedy-RRT Algorithm

Abstract

With the development of social economy, mould processing enterprises have an increasingly strong demand for reducing costs and improving economic efficiency. The optimisation of steel plate cutting path is one of the key links to improve production efficiency. In this paper, the optimal cutting path problem of steel plate under different cutting tasks is investigated, and the optimal cutting path under complex geometries is found through various optimisation algorithms. For cutting task N3, the cutting path is divided into outer contour cutting, inner hole cutting and inner hole part cutting. According to the problem, all rectangular parts inside the ellipse need to be cut before the ellipse. Through the Eulerian cutting path optimisation algorithm, we solve the air-travel problem between the inner holes and the outer contour as well as the air-travel problem between the inner holes of the ellipse and the parts inside the ellipse. The total length of the finally determined optimal air-travel path is 97 units. By combining the greedy algorithm and the RRT algorithm, we determine the number and location of the bridges and design the optimal cutting path starting from the lower right corner of the steel plate. The final clearance of the bridges is 4 units, the total length of the combined optimal path clearance is 35.56 units, and the number of bridges is 8, which are located between adjacent rectangles.