Smoothing and compressing algorithm of toolpath with complex contour in NC machining

Abstract

The continuous short line segment processing method in CNC machining has the defect of frequent fluctuation of feedrate, which affects the quality and efficiency. For this problem, the local and global methods are common solutions. The local method is to insert transition curves at the corners to obtain a smooth toolpath, but this method does not essentially reduce the number of accelerations and decelerations, and it is difficult to insert transition curves between tiny straight sections. Although the global method can obtain smooth tool trajectories, the parametric interpolation method is not suitable for middle- and low-end CNC machine tools. The article proposes an adaptive tool path generation method with the original part contour as the research object and discretizes the NURBS curves into smooth trajectories consisting of large segments of straight lines and circular arcs. The article mimics the crawling characteristics of snakes and designs a double-headed snake algorithm based on the least squares method to implement this process. First, given the start and end points of the curve, two snakeheads search for the maximum linear and circular segments that satisfy the error constraint in the curve direction. The winner will then be selected as the candidate track segment through a competition mechanism. Finally, all trajectory segments are connected to obtain a smooth tool path. Experiments show that the toolpath data of the method in this paper are reduced by 75.56% compared with commercial CAM software when the contour error threshold is the same, and the contour error is reduced by more than one order of magnitude when the number of toolpath segments is equal. In addition, the method in this paper can obtain a smoother machining surface and more stable cutting force, thus achieving a win‒win situation of quality and efficiency.