Laser Processing Path Planning Based on GA Improved ACO

In this paper, the optimization of laser cutting process path is modeled. Through the analysis of the characteristics of the optimization of laser cutting process path, the mathematical definition and expression of the graphic elements such as the parts to be cut and the contour in the optimization of laser cutting process path are provided. An ACO algorithm for laser cutting process path is proposed to solve TSP using the information of the starting point and the ending point of laser processing elements. The mathematical model of the element equivalent TSP is established, and the path planning result of ACO is re optimized by the nearest neighbor insertion algorithm. The implementation process of the improved ant system algorithm is described in detail, and the iteration times and optimization effects of the traditional ant system algorithm are analyzed by simulations. Through the example verification, this algorithm has better optimization effect than existing heuristic algorithms.