A Toolpath Generation Method for Surface Finishing Based on Solver of Traveling Salesman Problem

Abstract

The invention discloses a method for generating a curved surface finishing tool path based on a traveling salesman problem solver. The method comprises the following steps that a curved surface to be machined S (u,v), the radius r of a ball-head cutter and a maximum permissible residual high value h are input; a set of equal u parameter curves and a set of equal v parameter curves which meet the residual high requirement are generated in the curved surface u direction and the curved surface v direction respectively, and an entire curved surface is covered in the two directions; the two sets of equal parameter curves are subjected to pairwise intersection, and a series regular cutter contact grids are obtained on the curved surface; obtained cutter contact coordinates are input into the traveling salesman problem solver LKH, and the optimized connecting sequence of cutter contacts is obtained; the cutter contacts are sequentially connected according to the sequence, and a cutter contact track covering the entire curved surface is obtained; cutter position points corresponding to the cutter contacts in the cutter contact track are calculated, and a cutter position file is output. The finishing tool path generated by the method is small in path length, few in cutter lifting times, and capable of improving the curved surface finishing efficiency.

Description

technical field [0001] The invention relates to the field of surface finishing toolpath planning in CAM (computer aided manufacturing), in particular to a method for generating a surface finishing toolpath based on a traveling salesman problem solver. Background technique [0002] The traveling salesman problem (TSP), also known as the salesman problem, is the most basic routing problem. The problem can be simply described as: There are n cities, a salesman wants to start from a certain city, pass through each city once and at most once, and finally return to the city where he started, and find the shortest route. The traveling salesman problem is an NP-complete problem, and the simplest solution is the enumeration method. However, since the feasible solution of this problem is the full permutation of all cities, as the number of cities increases, a combinatorial explosion will occur. At present, the more efficient solvers of the traveling salesman problem include Concorde,...

AI Technical Summary

Problems solved by technology

[0006] It can be seen from the above literature that although the parallel path is simple and easy to obtain, there may be multiple lifting points on the path; although the fractal path can avoid frequent knife lifting, the path length is not optimized

Images