• Journal of Mechanical Science and Technology
• /
• 제18권8호
• /
• pp.1349-1357
• /
• 2004

Computer-Aided Inspection Planning (CAIP) is the integration bridge between CAD/CAM and Computer Aided Inspection (CAI). A CAIP system for On-Machine Measurement (OMM) is proposed to inspect the complicated mechanical parts efficiently during machining or after machining. The inspection planning consists of Global Inspection Planning (GIP) and Local Inspection Planning (LIP). In the GIP, the system creates the optimal inspection sequence of the features in a part by analyzing the various feature information such as the relationship of the features, Probe Approach Directions (PAD), etc. Feature groups are formed for effective planning, and special feature groups are determined for sequencing. The integrated process and inspection plan is generated based on the sequences of the feature groups and the features in a feature group. A series of heuristic rules are developed to accomplish it. In the LIP of Part II, the system generates inspection parameters. The integrated inspection planning is able to determine optimum manufacturing sequence for inspection and machining processes. Finally, the results are simulated and analyzed to verify the effectiveness of the proposed CAIP.

• 대한산업공학회지
• /
• 제15권2호
• /
• pp.45-55
• /
• 1989

This paper deals with development of a computer-aided process selection and sequencing technique and its software for metal cutting processes of rotational parts. The process selection procedure consists of selection for proper machining operations and machine tools suitable for the selected operations. Machining operations are selected based on machining surface features and machine tools are selected by employing a conversion table which converts machining operations into machine tools. The process sequence is determined by the proper manipulation of the precedence relation matrix. A computer program for the proposed technique is developed by using Turbo-Pascal on IBM PC/AT compatible system. The proposed technique works well to real problems.

• 대한산업공학회지
• /
• 제21권3호
• /
• pp.329-343
• /
• 1995

Traditionally, machining process sequence was influenced and constrained by the design information obtained from CAD data base, i.e., class of operations, geometric shape, tooling, geometric tolerance, etc. However, even though all the constraints from design information are considered, there may exist more than one way to feasibly machine parts. This research is focused on the integrated problem of operations sequencing and machine tools selection in the presence of the product mix and their production volumes. With the transitional costs among machining operations, the operation sequencing problem can be formulated as a well-known Traveling Salesman Problem (TSP). The transitional cost between two operations is expressed as the sum of total machining time of the parts on a machine for the first operation and transportation time of the parts from the first machine to a machine for the second operation. Therefore, the operation sequencing problem formulated as TSP cannot be solved without transitional costs for all operation pairs. When solved separately or serially, their mutual optima cannot be guaranteed. Machining operations sequencing and machine tool selection problems are two core problems in process planning for discretely machined parts. In this paper, the interrelated two problems are integrated and analyzed, zero-one integer programming model for the integrated problem is formulated, and the solution methods are developed using a Tabu Search technique.

• 한국기계가공학회지
• /
• 제21권6호
• /
• pp.81-88
• /
• 2022

Titanium alloy (Ti-6Al-4V) has excellent mechanical properties and high specific strength; therefore, it is widely used in aerospace, automobile, defense, engine parts, and bio fields. Particularly in the aerospace field, as it has a low specific gravity and rigidity, it is used for the purpose of increasing energy efficiency through weight reduction of parts, and most have a thin-walled structure. However, it is extremely difficult to machine thin-walled shapes owing to vibration and deformation. In the case of thin-walled structures, the cutting forces and vibrations rapidly increase depending on the cutting conditions, significantly affecting the surface integrity and tool life. In this study, machining experiments on thin-wall milling of a titanium alloy (Ti-6Al-4V) were conducted for each experimental condition with different axial depths of cut, radial depth of cut, and machining sequence. The machining characteristics were analyzed, and an effective machining method was derived by a comprehensive analysis of the machined surface conditions and cutting signals.

• 대한기계학회논문집
• /
• 제18권9호
• /
• pp.2234-2244
• /
• 1994

A process sequence of multi-operation cold forging for actual application in industry is designed with the rigid-plastic finite element method to form a constant velocity joint housing(CVJ housing). The material flow during the CVJ housing forming is axisymmetric until the final forging process for forming of ball grooves. This study treats the deformation as an axisymmetric case. The main objective of the process sequence design is to obtain preforms which satisfy the design criteria of near-net-shape product requiring less machining after forming. The process sequence design also investigates velocity distributions, effective strain distributions and forging loads, which are useful information in the real process design.

• 대한산업공학회지
• /
• 제31권4호
• /
• pp.316-333
• /
• 2005

Although some successful recognition algorithms have been developed, most of them did emphasize on extracting accurate interpretations without considerations of manufacturability. Evaluating the manufacturability for multiple features leads to produce the machining sequences. In this paper, the A* algorithm guarantees the optimal setup sequences with minimizing the machining cost. Also, tolerances including surface roughness are converted to STEP formats to be utilized for more reliable process plans. Finally, decision tables are used to create the detailed operational sequences based on geometric tolerances and surface roughness. Machining parameters such as feed, depth of cut, and cutting speed for each operation are added to the routing sheet. Windows are presented to show how the entire system works for a sample part.

• 한국CDE학회논문집
• /
• 제9권1호
• /
• pp.51-61
• /
• 2004

Mechanical parts are often grouped into part families based on the similarity of their shapes, to support efficient manufacturing process planning and design modification. The 2-part sequence papers present similarity assessment techniques to support part family classification for machined parts. These exploit the multiple feature decompositions obtained by the feature recognition method using convex decomposition. Convex decomposition provides a hierarchical volumetric representation of a part, organized in an outside-in hierarchy. It provides local accessibility directions, which supports abstract and qualitative similarity assessment. It is converted to a Form Feature Decomposition (FFD), which represents a part using form features intrinsic to the shape of the part. This supports abstract and qualitative similarity assessment using positive feature volumes.. FFD is converted to Negative Feature Decomposition (NFD), which represents a part as a base component and negative machining features. This supports a detailed, quantitative similarity assessment technique that measures the similarity between machined parts and associated machining processes implied by two parts' NFDs. Features of the NFD are organized into branch groups to capture the NFD hierarchy and feature interrelations. Branch groups of two parts' NFDs are matched to obtain pairs, and then features within each pair of branch groups are compared, exploiting feature type, size, machining direction, and other information relevant to machining processes. This paper, the second one of the two companion papers, describes the similarity assessment method using NFD.

• 한국CDE학회논문집
• /
• 제9권1호
• /
• pp.44-50
• /
• 2004

Mechanical parts are often grouped into part families based on the similarity of their shapes, to support efficient manufacturing process planning and design modification. The 2-part sequence papers present similarity assessment techniques to support part family classification for machined parts. These exploit the multiple feature decompositions obtained by the feature recognition method using convex decomposition. Convex decomposition provides a hierarchical volumetric representation of a part, organized in an outside-in hierarchy. It provides local accessibility directions, which supports abstract and qualitative similarity assessment. It is converted to a Form Feature Decomposition (FFD), which represents a part using form features intrinsic to the shape of the part. This supports abstract and qualitative similarity assessment using positive feature volumes. FFD is converted to Negative Feature Decomposition (NFD), which represents a part as a base component and negative machining features. This supports a detailed, quantitative similarity assessment technique that measures the similarity between machined parts and associated machining processes implied by two parts' NFDs. Features of the NFD are organized into branch groups to capture the NFD hierarchy and feature interrelations. Branch groups of two parts' NFDs are matched to obtain pairs, and then features within each pair of branch groups are compared, exploiting feature type, size, machining direction, and other information relevant to machining processes. This paper, the first one of the two companion papers, describes the similarity assessment methods using convex decomposition and FFD.

• 한국산업정보학회논문지
• /
• 제14권4호
• /
• pp.1-7
• /
• 2009

이 논문은 다목적 공정순서계획 알고리즘을 소개한다. 공정순서계획이란 가용한 기계들을 이용하여 원재료를 가공 완료된 부품으로 변형해주는 최적 공정순서들을 결정하는 일이다. 어느 컴퓨터 지원 공정계획 시스템에서나, 가공작업 순서의 결정은 부품 가공이나 부품 도면상의 기술적인 요구사항들을 충족시켜주기 위한 가장 중요한 활동 중의 하나이다. 여기서, 목표는 생산시간, 생산비용, 기계가동률 또는 이들을 복합적으로 만족시켜주는 최적 가공순서를 생성하는 일일 것이다. 파레토 스트라튬 니치 큐비클 (PS NC) 유전 알고리즘이 두 가지 상호 배타적인 기준인 생산비용과 생산품질을 동시에 최적화 시켜주는 가공순서들을 찾는데 이용되었다. 예제에 의한 검증은 제안된 PS NC 유전자 알고리즘이 공정계획문제에 있어서 효과적이며 효율적인 결과를 가져오는 것을 보여준다.

• 한국CDE학회논문집
• /
• 제11권3호
• /
• pp.205-210
• /
• 2006

Curve tessellation, which generates a sequence of points from a curve, is very important for curves rendering on a computer screen and for NC machining. For the most case the sequence of discrete points is used rather than a continuous curve. This paper deals with a method of tessellation by calculating the maximal deviation of a curve. The maximal deviation condition is introduced to find the point with the maximal chordal deviation on a curve segment. In the previous research a curve tessellation was tried by the subdivision method, that is, a curve is subdivided until the maximal chordal deviation is less than the given tolerance. On the other hand, a curve tessellation by sequential method is tried in this paper, that is, points are generated successively by using the local property of a curve. The sequential method generates relatively much less points than the subdivision method. Besides, the sequential method can generate a sequence of points from a spatial curve by approximation to a planar curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.