Steel Plate Cutting Path Optimisation Problem Based on Euler's Theorem and Greedy Algorithm

Abstract

Steel plate cutting as one of the key technologies in the field of machining, planning the optimal path and reducing the air distance can improve the cutting efficiency of the steel plate, and improving the cutting efficiency is the most critical step in the machining process. In this paper, we analyze the main reasons for the generation of empty paths and make the assumption of cutting the whole part at once while cutting the part. On this basis, Euler's theorem and greedy algorithm are used to find the proximal point of the cutting path from the outer contour to the inner contour, and to plan the optimal path and the resulting shortest air distance for a given cutting of the outer contour of the serrated steel plate as well as the cutting of different shapes of parts in the inner part of the serrated steel plate. The resulting shortest air travel distance is 31.5536 by matlab.