An Algorithm for a Near Optimal NC Path Generation in Staircase (Lase) Traversal of Convex Polygonal Surfaces
Author:
Kamarthi S. V.1, Bukkapatnam S. T. S.2, Hsieh S.3
Affiliation:
1. Department of Mechanical, Industrial, & Manufacturing Engineering, Northeastern University, 334 Snell Engineering Center, Boston, MA 02115 2. Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089 3. Lead Lean Manufacturing Deployment, Purchasing Division, Ford Lio Ho Motor Company, Ltd. (Taiwan)
Abstract
This paper presents an analytical model of the tool path for staircase traversal 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 optimal tool path length. The OPTPATH algorithm can be used for staircase traversal with or without (i) overlaps between successive sweep passes, and (ii) rapid traversal along edge passes. This flexibility of OPTPATH renders it applicable not only to conventional operations such as face and pocket milling, but also to other processes such as robotic deburring, rapid prototyping, and robotic spray painting. The effective tool path lengths provided by OPTPATH are compared with those given by the following two algorithms: (i) a common industrial heuristic—referred to as the IH algorithm—and (ii) an algorithm proposed by Prabhu et 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 generated convex polygons of different shapes and a set of seven different tool diameters. It is found that OPTPATH performs better than both the IH as well as PGW algorithms. The superiority of OPTPATH over the two algorithms becomes more pronounced for large tool diameters. [S1087-1357(00)71501-2]
Publisher
ASME International
Subject
Industrial and Manufacturing Engineering,Computer Science Applications,Mechanical Engineering,Control and Systems Engineering
Reference22 articles.
1. Prabhu, P. V., Gramopadhye, A. K., and Wang, H. P., 1990, “A General Mathematical Model for Optimizing NC Tool Path for Face Milling of Convex Polygonal Surfaces,” Int. J. Prod. Res., 28, No. 1, pp. 101–130. 2. DeGarmo, E. Paul, Temple Black, J., and Kohser, Ronals A., 1988, Materials and Processes in Manufacturing, New York: Macmillan Publishing Company. 3. Pekelharing, A. J.
, 1978, “The Exit Failure in Interrupted Cutting,” Ann. CIRP, 27, No. 1, pp. 5–10. 4. Wang, W. P.
, 1988, “Solid Modeling for Optimization Metal Removal of Three-Dimensional NC End Milling,” J. Manuf. Syst., 7, No. 1, pp. 57–65. 5. Bala, M., and Chang, T. C., 1991, “Automatic Cutter Selection and Optimal Cutter Path Generation for Prismatic Parts,” Int. J. Prod. Res., 29, No. 11, pp. 2163–2176.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
|
|