An algorithm for a near optimal NC path generation in staircase (lase) traversal of convex polygonal surfaces

This paper presents an analytical model of the tool path for staircase trav ersal of convex polygonal surfaces, and an algorithm-referred to as OPTPATH -developed based on the model to find the sweep angle that gives a near opt imal fool path length. The OPTPATH algorithm can be used for staircase trav ersal with or without (i) overlaps between successive sweep passes, and (ii ) rapid traversal along edge passes. This flexibility of OPTPATH renders it applicable nor only to conventional operations such as face and pocket mil ling, bur also to other processes such as robotic deburring, rapid prototyp ing, and robotic spray painting. The effective tool path lengths provided b y OPTPATH are compared with those given by the following Mo algorithms: (i) a common industrial heuristic-referred to as the IH algorithm-and (ii) an algorithm proposed by Prabhu rr al. (Prabhu, P. V., Gramopadhye, A. K., and Wang, H. P., 1990, Int. J. Prod. Res., 28, No. 1, pp, 101-130) referred to as PGW algorithm. This comparison is conducted using 100 randomly generate d convex polygons of different shapes and a set of seven different tool dia meters. It is found that OPTPATH performs better than both the IH as well a s PGW algorithms. The superiority of OPTPATH over the two algorithms become s more pronounced for large tool diameters.