• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.5
• /
• pp.1183-1192
• /
• 1993

Since the punching time is strongly related to the productivity in sheet metal stamping, there have been a lot of efforts to obtain the optimal tool path. However, most of the conventional efforts have the basic limitations to provide the global optimal solution because of the inherent difficulties of the NP hard combinatorial optimization problem. The existing methods search the optimal tool path with limiting tool changes to the minimal number, which proves not to be a global optimal solution. In this work, the turret rotation time is also considered in addition to the bed translation time of the NCT machine, and the total punching time is minimized by the simulated annealing algorithm. Some manufacturing constraints in punching sequences such as punching priority constraint and punching accuracy constraint are incorporated automatically in optimization, while several user-interactions to edit the final tool path are usually required in commercial systems.

• International Journal of CAD/CAM
• /
• v.5 no.1
• /
• pp.1-10
• /
• 2005

A new approach based on vector field clustering for tool path optimization of 5-axis CNC machining is presented in this paper. The strategy of the approach is to produce an efficient tool path with respect to the optimal cutting direction vector field. The optimal cutting direction maximizes the machining strip width. We use the normalized cut clustering technique to partition the vector field into clusters. The spiral and the zigzag patterns are then applied to generate tool path on the clusters. The iso-scallop method is used for calculating the tool path. Finally, our numerical examples and real cutting experiment show that the tool path generated by the proposed method is more efficient than the tool path generated by the traditional iso-parametric method.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2008.06a
• /
• pp.417-418
• /
• 2008

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.20 no.2
• /
• pp.174-179
• /
• 2011

This paper focuses on the optimal step-over value for magnetic tool path. Since magnetic flux density is changed according to distance from center of magnetic tool. Enhanced surface roughness is also different according to change of radius. Therefore, to get a identical surface roughness on workpiece, it is necessary to find optimal tool path including step-over. In this study, response surface models for surface roughness according to change of radiuses were developed, and then optimal enhanced surface roughness for each radius was selected using genetic algorithm and simulated annealing to investigate relation between radius and surface roughness. As a result, it found that step-over value of 6.6mm is suitable for MAP of magnesium alloy.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.19-27
• /
• 1997

This paper presents rough cut tool path planning for the fewer-axis machine consisting of a three-axis CNC machine and a rotary indexing table. In the problem dealt with in this paper, the tool orientation is "intermediately" changed, distinguished from the conventional problem where the tool orientation is assumed to be fixed. The developed rough cut path planning algorithm tries to minimize the number of tool orientation (setup) changes together with tool changes and the machining time for the rough cut by the four procedures: a) decomposition of the machining area based on the possibility of tool interference (via convex hull operation), b) determination of the optimal tool size and orientation (via network graph theory and branch-and bound algorithm), c) generation of tool path for the tool and orientation (based on zig-zag pattern), and d) feedrate adjustment to maintain the cutting force at an operation level (based on average cutting force). The developed algorithms are validated via computer simulations, and can be also used in pure fiveaxis machining environment without modification.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.04a
• /
• pp.15-20
• /
• 2004

Inclined surface milling in the mould and die industries is one of the most commonly needed cutting process. For the variety and complexity of cutting characteristics in various cutting condition, it is difficult to select a optimal tool path orientation. The comparative results through FFT analysis in this study provide a guideline for the selection tool path orientation.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.1
• /
• pp.133-139
• /
• 2004

High speed machining (HSM) can reduce machining time with the high metal removal rate by high speed spindle and feedrate. This paper supports HSM technology using the small size tool with the optimal tool path generation and modification of tool change. The optimum tool path is generated to reduce cutting length of cavity pattern and change the cutting tool for preventing the tool breakage by wear. The tool path is modified with the experiment data of tool wear and breakage to support tool change on reasonable time. The result can contribute to HSM technology of high hardness materials using the small size end-mill.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.12 no.3
• /
• pp.75-81
• /
• 2003

Pocket machining is metal removal operation commonly used for creating depressions in machined parts. Numerically controlled milling is the primary means for machining complex die surface. These complex surfaces are generated by a milling cutter which removes material as it traces out pre-specified tool paths. To machine, a component on a CNC machine, part programs which define the cutting tool path are needed. This tool path is usually planned from CAD, and converted to a CAM machine input format. In this paper I proposed a new method for generating NC tool paths. This method generates automatically NC tool paths with dynamic elimination of machining errors in 2$\frac{1}{2}$ arbitrary shaped pockets. This paper generates a spiral-like tool path by dynamic computing optimal pocket of the pocket boundary contour based on the type and size of the milling cutter, the geometry of the pocket contour and surface finish tolerance requirements. This part programming system is PC based and simultaneously generates a G-code file.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.398-401
• /
• 2001

This paper presents rough cutting pat고 drilling. This method has differences from conventional method which uses boundary curve by intersecting object to machine and each cutting plane. Die-cavity shape is drilled in z-map, we select various tool and remove much material in the short time. as a result, this method raise productivity. The major challenges in die-cavity pocketing include : 1)finding an inscribed circle for removing material of unmachined regions, 2) selecting optimal tool and efficiently arranging tool, 3) generating offset surface of shape, 4) determining machined width according to the selected tool, 5) detecting and removing unmachined regions, and 6) linking PJE(path-joining element). Conventional machining method calling contour-map is compared with drilling method using Z-map, for finding efficiency in the view of productivity.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.7
• /
• pp.49-58
• /
• 1997

In process planning for pocket machining, the selection of tool size, tool path, overlap distance, and the calculation of machining time are very important factors to obtain the optimal process planning result. Among those factors, the tool size is the most important one because the others depend on tool size. And also, it is not easy to determine the optimal tool size even though the shape of pocket is simple. Therefore, the optimal selection of tool size is the most essential task in process planning for machining a pocket. This paper presents a method for selecting optimal toos in pocket machining. The branch and bound method is applied to select the optimal tools which minimize the machining time by using the range of feasible tools and the breadth-first search.