Integrated machining tool path planning using feature free spaces

We describe an automatic machining tool path generation method that integrates local and global tool path planning for machining features. From the solid model and the tolerance specifications of the part, we automatically recognize machining features, and obtain the geometry-based precedence relations between these features. A separate process planning module uses this information to determine the machining sequence, tool selections, and machining conditions. From the resulting process plan, we then generate machining tool paths for each set-up, combining local and global tool paths. Machining features are expanded through their fictitious faces to obtain feature free spaces. These comprise the cells of a free space decomposition, which enables the use of established robot motion planning techniques. Global tool paths between features are generated incrementally by searching the adjacency graph of feature free spaces, which represents the free space of the part at each step of the process plan. Local tool paths for each machining feature are generated by successive offsetting operations. The start and end positions for each feature's local tool paths are selected using a heuristic method to minimize the cost of each segment of the global tool path. This feature recognition method and the automatic tool path generation method are being developed as modules of a comprehensive machining process planning system.

[1]  Yong Se Kim,et al.  Recognition of form features using convex decomposition , 1992, Comput. Aided Des..

[2]  Y. S. Kim,et al.  Recognition of machining features for cast then machined parts , 2002, Comput. Aided Des..

[3]  Robert B. Jerard,et al.  C-space approach to tool-path generation for die and mould machining , 1997, Comput. Aided Des..

[4]  Yong Se Kim,et al.  Form feature recognition using convex decomposition: results presented at the 1997 ASME CIE Feature Panel Session , 1998, Comput. Aided Des..

[5]  Mark H. Overmars,et al.  Interference-free NC machining using spatial planning and Minkowski operations , 1998, Comput. Aided Des..

[6]  D. R. Hayhurst,et al.  Determination of optimal path under approach and exit constraints , 1999, Eur. J. Oper. Res..

[7]  Wayne Tiller,et al.  Offsets of Two-Dimensional Profiles , 1984, IEEE Computer Graphics and Applications.

[8]  S. S. Pande,et al.  An intelligent feature-based process planning system for prismatic parts , 2002 .

[9]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[10]  T. C. Chang,et al.  Graph-based heuristics for recognition of machined features from a 3D solid model , 1988 .

[11]  Tomás Lozano-Pérez,et al.  Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Douglas L. Waco,et al.  Handling interacting positive components in machining feature reasoning using convex decomposition , 1994 .

[13]  S. S. Pande,et al.  Feature based automatic CNC code generation for prismatic parts , 1996 .

[14]  P. Broomhead,et al.  Automatic CNC milling of pockets: geometric and technological issues , 1998 .

[15]  Yong Se Kim,et al.  Automatic Recognition of Machining Features and Precedence Relations , 1998 .

[16]  Yong Se Kim,et al.  Geometry-based machining precedence reasoning for feature-based process planning , 2001 .

[17]  Y. Kim.  Volumetric Feature Recognition Using Convex Decomposition , 1994 .

[18]  Yong Se Kim,et al.  Geometric reasoning for machining features using convex decomposition , 1993, Solid Modeling and Applications.