• 한국공작기계학회논문집
• /
• 제14권2호
• /
• pp.14-20
• /
• 2005

This paper describes a dwell time calculation algorithm for polishing tool path generation in the small toot polishing process of the axis-symmetrical lens. Generally dwell time control in the polishing machines means that small polishing tool stays for a dwell time at the specific surface position to get the expected polishing depth. Polishing depth distribution on an aspherical lens surface consists of the superposition of the local polishing depth at the each dwell position. Therefore, tool path generation needs each dwell time together with tool positioning data during the polishing tool movements on the aspherical lens surface. The linear algebraic equation of removal depth removal matrix and dwell time is formulated. Parametric effects such as the dwell d interval are simulated to validate the dwell time calculation algorithm.

• International Journal of Precision Engineering and Manufacturing
• /
• 제1권1호
• /
• pp.118-126
• /
• 2000

Die-casting burr to casting process is removed by post-process for assembly and quality control of product. Though robot has been widely used for deburring job before. CNC exclusive machine is currently developed for high power, high speed machining and quick tool change. Deburring tool path with complex 3D curve type is defined to make out deburring NC program. But there is no efficient method to define it currently used methods with teaching probe on machine. In this study the efficient method to make out deburring NC program is developed. 5-axis digitizing machine is used to receive data of deburring path. And the post process for NC program generation is developed in consideration of the machining conditions. The developed system is not dependent on the skill of operator and has the advantage to maintain the flexibility of job to modify NC program due to the wear of tool and aging of the die casting.

• 전자공학회논문지A
• /
• 제32A권1호
• /
• pp.222-233
• /
• 1995

For effective module generation, a detailed router which can handle complicated routing regions on multimple layers of interconnection under various constraints is necessary. In this paper, a new improved maze routing technique is described, which can find the shortest path for each net without allowing stacked vias. In this method, two cost values are stored at each grid point. The cost values represent the routing costs from the terminal of the net being routed to the grid point. One cost value shows the cost of the shortest path without making a via at the grid point and the other cost value shows that with making a via at the grid point. This is the first systematic maze routing technique which can find the shortest path without via-stacking.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.99-102
• /
• 1996

Research regarding the Autonomous Distributed & Cooperated System has not yet been defined because we need to apply the interdisciplinary approach before so. In this paper, we use a clear definition, compare characteristics of the Autonomous Distributed & Cooperated System and examine the possibility of an actualization through path planning of Autonomous AGV. We propose a new algorithm about the generation method of a moving path at the first stage and a cooperative action generation for a collision avoidance. Lastly, we performed simulation analysis of these two in order to confirm efficiency.

• 한국정밀공학회지
• /
• 제17권9호
• /
• pp.53-61
• /
• 2000

The manufacture of a marine propeller typically requires long lead time to generate 5-axis tool path. Hence it may take several weeks to manufacture a satisfactory propeller with a general purpose CAD/CAM system. In this research a dedicated 5-axis CAD/CAM system for machining marine propellers has been developed, The system employs various methods to enhance the productivity : interference-free tool path generation employing check vectors and optimum cutter size determinants. In addition an iterative NURBS modeling technique is used to improve the accuracy of the modeled surface and effective cutting conditions are determined and recommended empirically to increase the productivity. The proposed CAD/CAM system has been implemented with C++ and OpenGL graphic library on the Windows system. The system validation and sample results are also given and discussed.

• 산업기술연구
• /
• 제15권
• /
• pp.23-32
• /
• 1995

The methodology of automatic generation of tool path for rough cutting of a sculptured surface is proposed with the improved contouring method, unequal level line machining. Considering the surface shape and the diameter of the endmill, the distance between level lines is obtained. To improve MMR, initial rough cutting is processed with the large diameter endmill and the remained material is removed by the relatively small diameter endmill. Tool path is generated from the offset curve of respective level line and the interferences between the tool and workpiece are automatically avoided. After generating NC part program, the sculptured surface is machined at the vertical machining center. From the experimental results, total cutting length and machining time are reduced more effectively than conventional contouring methods.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2000년도 춘계학술대회논문집 - 한국공작기계학회
• /
• pp.647-652
• /
• 2000

Recently, according to the various taste of consumers, the design of a product is changed variously and complicatedly. The complicated product is not usually constructed with one patch but multi-patch. By the way, in machining, higher precision and the reduction of leading and machining time is required. But for the multi-patch sculptured surface, the amount of machining data becomes large. This means the increase of leading and machining time. In this study, the tool path generation method with reparameterization is proposed for multi-patch sculptured surface and variable step size using NURBS is used to satisfy the precision and to reduce leading and machining time.

• 대한기계학회논문집A
• /
• 제21권12호
• /
• pp.2114-2120
• /
• 1997

This paper presents precision machining of sculptured surfaces with a flat end cutter as follows; tool path generation using partition machining method and elimination interference. These days many researchers are getting interested in flat end cutter having a good cutting performance as machine tool for machining sculptured surfaces. It can get low curvature surfaces and have a much better material removal rates and longer tool life. Partition machining method is the first submitted in this paper. It is a new method of tool path generation, which means the way to map surfaces under the normal vector and then to cut them partially.

• 한국경영과학회지
• /
• 제27권2호
• /
• pp.33-49
• /
• 2002

CBM (Condition-Based Maintenance) has increasingly drawn attention in industry because of its many benefits. CBM Problem Is characterized as a state-dependent scheduling model that demands simultaneous maintenance actions, each for an attribute that influences on machine condition. This problem is very hard to solve within conventional Markov decision process framework. In this paper, we present an intelligent machine maintenance scheduler, for which a new incremental decision tree learning method as evolutionary system identification model and shortest path problem as schedule generation model are developed. Although our approach does not guarantee an optimal scheduling policy in mathematical viewpoint, we verified through simulation based experiment that the intelligent scheduler is capable of providing good scheduling policy that can be used in practice.

• International Journal of CAD/CAM
• /
• 제8권1호
• /
• pp.45-53
• /
• 2009

As the point sampling technology evolves rapidly, there has been increasing need in generating tool path from dense point set without creating intermediate models such as triangular meshes or surfaces. In this paper, we present a new tool path generation method from point set using Euclidean distance fields based on Algebraic Point Set Surfaces (APSS). Once an Euclidean distance field from the target shape is obtained, it is fairly easy to generate tool paths. In order to compute the distance from a point in the 3D space to the point set, we locally fit an algebraic sphere using moving least square method (MLS) for accurate and simple calculation. This process is repeated until it converges. The main advantages of our approach are : (1) tool paths are computed directly from point set without making triangular mesh or surfaces and their offsets, and (2) we do not have to worry about no local interference at concave region compared to the other methods using triangular mesh or surface model. Experimental results show that our approach can generate accurate enough tool paths from a point set in a robust manner and efficiently.