• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2002년도 춘계학술대회 논문집
• /
• pp.106-111
• /
• 2002

The object of this study is a manufacture of burr die using CAD/CAM systems. Systems are consist of AutoCAD, CAM software and CNC milling machine. CAM software is purpose of G-code generation for CNC programming. Then CAM software and CNC milling machine are connect to RS-232-C cable for networking.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.848-851
• /
• 1996

Based on the minimum cutting time criteria, the tool path generation algorithm of a pocket machining is developed as a form of a built-in cycle for the WOP(workshop oriented programming) of a CNC controller. Based on the given CAD database and tool information, an optimal cutting depth and geometric properties can be generated, then six different tool paths will be generated internally and automatically. Finally, the G code which commands tool movements is generated for CNC machining.

• 한국CDE학회논문집
• /
• 제6권3호
• /
• pp.169-173
• /
• 2001

Presented in this paper is a CPO tool-path linking procedure optimizing technological objectives, such as dealing with islands (positive and negative) and minimizing tool retractions, drilling holes and slotting. Main features of the proposed algorithm are as follows; 1) a data structure, called a 'TPE-net', is devised to provide information on the parent/child relationships among the tool-path-elements, 2) the number of tool retractions is minimized by a 'tool-path-element linking algorithm'fading a tour through the TPE-net, and 3) the number of drilling holes is minimized by making use of the concept of the 'free space'.

• 한국정밀공학회지
• /
• 제12권7호
• /
• pp.32-45
• /
• 1995

In this paper, we present a new method to tool path planning problem for rough cut of pocket milling operations. The key idea is to formulate the tool path problem into a TSP (Travelling Salesman Problem) so that the powerful neural network approach can be effectively applied. Specifically, our method is composed of three procedures: a) discretization of the pocket area into a finite number of tool points, b) neural network approach (called SOM-Self Organizing Map) for path finding, and c) postprocessing for path smoothing and feedrate adjustment. By the neural network procedure, an efficient tool path (in the sense of path length and tool retraction) can be robustly obtained for any arbitrary shaped pockets with many islands. In the postprocessing, a) the detailed shape of the path is fine tuned by eliminating sharp corners of the path segments, and b) any cross-overs between the path segments and islands. With the determined tool path, the feedrate adjustment is finally performed for legitimate motion without requiring excessive cutting forces. The validity and powerfulness of the algorithm is demonstrated through various computer simulations and real machining.

• 한국기계가공학회지
• /
• 제2권1호
• /
• pp.51-56
• /
• 2003

A custom application system, which was based on the finite element analysis, for stress on the head-skirt junction of a hot pressure vessel was developed. This is useful computer-based analysis system which designed to provide an analysis technique and knowledge conveniently available to other people. It was found the evaluation of thermal stress of several typed skirt joint of a pressure vessel could be performed early using this system.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 춘계학술대회 논문집
• /
• pp.455-459
• /
• 1997

A methodology which supports the feature used from design to manufacturing for sculptured pocket is newly devlored and present. The information contents in a feature can be easily conveyed from one application to another in the manufacturing domain. However, the feature generated in one application may not be directly suitable for another whitout being modified with more information. Theobjective of the paper is to parsent the methodology of decomposing a bulky feature of sculptured pocket to be removed into compact features to be efficiently machined. In particular, the paper focuses on the two task: 1) to segment horizontally a bulky feature into intermediate features by determining the adequate depth of cut and cutter size and to generate the temporal precedence graph of the intermediate features and 2)to further decompose each intermediate feature vertical into smaller manufacturing features and to apply the variable feed rate to each small feature. The proposed method will provid better efficiency in machining time and cost than the classical method which uses a long string of NC codes necessary to remove a bulky fecture.

• 실천공학교육논문지
• /
• 제15권1호
• /
• pp.119-126
• /
• 2023

오늘날 자동차의 연비 향상 과 동적 거동 향상을 위해서 자동차 부품의 경량화 및 간소화 시대가 형성되고 있다. 설계와 제작의 간소화를 위해 제품 형상을 다양한 부품의 일체화로 진행되고 있다. 예를 들어 3개의 제품을 1개의 제품화 시키기 위해서 아주 협소한 부분까지 제품 가공하는 일이 발생되고 있다. 기존의 부품의 경우 가공의 편의성을 위해 정밀 다이캐스팅 또는 주물 생산으로 가공 후 조립하는데 다중 조립체(multi-piece) 방식은 공정수가 많이 필요로 하며, 부품의 정밀도와 강도를 저하시키는 요인이 된다. 가공 공정을 단순화 시키고 부품의 강도를 확보하기 위해서 일체형으로 제작하는 것이 단점을 극복하는데 매우 유리하지만 깊고 좁은 포켓 부분을 가공 할 경우 장비 자체 스핀들로는 가공이 불가능하다. 문제점을 해결하고자 절삭가공에 대한 연구가 활발하게 진행되고 있으며, 다축 복합가공 기술은 이러한 문제점을 해결할 뿐만 아니라, 지금까지 하나의 공작기계로 여러 공정에 따른 유연한 절삭가공이 어려웠던 복합 형상에도 절삭가공이 가능하다는 등 많은 장점을 가지고 있다. 하지만 고가의 장비로 인하여 제조경비 상승과 기계를 운영할 수 있는 기술자가 부족한 것이 현실이다. 5축 절삭 가공기에서는 깊고 협소한 구간의 제품을 생산할 때 공구의 간접으로 제품 생산에 사이클 타임이 늘어남은 물론 가공상에 문제점들이 많이 발생된다. 따라서 전용 공작기계 및 다축 복합가공기를 사용해야 한다. 그 대안으로 3축 머시닝센터에서 5축 이상의 다축 복합가공을 할 수 있는 특수 공구로서의 앵글 스핀들(angle spinde)이 사용될 수 있다. 앵글 스핀들 사용함으로 가공 진동 흡수, 낮은 열 발생과 작동 안정성, 우수한 치수 안정성, 강도 확보와 같은 분야에서 다양하고 지속적인 연구가 필요하다.

• 한국공작기계학회논문집
• /
• 제12권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.

• 대한기계학회논문집A
• /
• 제25권12호
• /
• pp.2009-2018
• /
• 2001

This paper presents a region offsetting algorithm for tool-path generation. The proposed region offsetting algorithm is developed by expanding the 'PWID offset algorithm [Choi and Park, 1999]'designed to offset a simple polygon. The PWID offset algorithm has three important steps; 1) remove 'local invalid ranges'by invoking a PWID test, 2) construct a raw offset owe and 3) remove 'global invalid ranges'by finding self-intersections of the raw offset cure. To develop a region offsetting algorithm, we modified the PWID offset algorithm by expanding the concept of the 'global invalid range'in the third step. The time complexity of the proposed algorithm is approximately Ο(n), where n is the number of points, and it is free of numerical errors for practical purposes. The proposed algorithm has been implemented and tested with various real regions obtained by intersecting a sculptured surface with a plane.

• 대한산업공학회지
• /
• 제28권2호
• /
• pp.128-138
• /
• 2002

In this paper, we address how to reduce the length of tool retraction in a zigzag pocket machining. Tool retraction, in a zigzag pocket machining, is a non-cutting operation in which the tool moves to any remaining regions for machining. We developed an algorithm of generating tool retraction length in convex or concave polygonal shapes including islands. In the algorithm, we consider concave areas of cutting direction in the polygonal shape. Considering concave areas of cutting direction, the polygonal shape is decomposed to subregions which do not need any tool retraction. Using the proposed algorithm, we calculated the shortest length of tool retraction in cutting direction. Examples are shown to verify the validity of the algorithm.