• Korean Journal of Computational Design and Engineering
• /
• v.14 no.5
• /
• pp.291-296
• /
• 2009

This paper presents a post-processing algorithm for 5-axis machines with three rotary axes (3R-2L type). 5-axis machining needs the postprocessor for converting cutter location (CL) data to machine control (NC) data. The existing methods for post-processing use inverse kinematics equations from for-ward kinematics. However in case of 5-axis machines with three rotary axes, the inverse kinematics equations are not induced directly since the forward kinematics equations are non-linear. In order to get the joint values from the forward kinematics equations, previous algorithms use numerical method for the post-processing, which needs searching algorithms with computation time and may result in fail. This paper proposes a geometric method for the post-processing of 3 rotary type 5-axis machines. Our algorithm has three advantages: first, it does not need establishing forward kinematics equations. Second, it is reliable method that eliminates any numerical methods for the inverse kinematics, resulting in the exact solution. Finally, the proposed algorithm can also be applied to 2R-3L type of 5-axis machines.

• Journal of Mechanical Science and Technology
• /
• v.17 no.3
• /
• pp.336-342
• /
• 2003

Increasing demand on precision machining using computerized numerical control (CNC) machines have necessitated that the tool move not only with the smallest possible position error but also with smoothly varying feedrates in 3-dimensional (3D) space. This paper presents the simultaneous 3D machining process investigated using a retrofitted PC-NC milling machine. To achieve the simultaneous 3-axis motions, a new precision interpolation algorithm for 3D Non Uniform Rational B-Spline (NURBS) curve is proposed. With this accurate and efficient algorithm for the generation of complex 3D shapes, a real-time NURBS interpolator was developed using a PC and the simultaneous 3D machining was accomplished satisfactorily.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1996.10a
• /
• pp.15-21
• /
• 1996

This paper describes a development of conversational program for lathe. The proposed program is a NC programming system specialized for use in machine tool controls. Its easy to use graphic interface built-in database capabilities make it an ideal way to program part on the shop floor. In order to manage effectively machining process it proposed the algorithm of tree structures for design processing. Also using interative structure it proposed the methods of conversational programming to generate automatically NC program.

• Journal of the Korean Society of Safety
• /
• v.8 no.4
• /
• pp.54-60
• /
• 1993

The purpose of this study is to develop a CAD/CAM system for automatic creation and manufacturing of three dimension objects. The computer system used in this study made RAM 2M, CPU 80386, VGA graphic card. The results in this paper are as follows ; 1. By interconnect PC(personal computer) and NC(numerical control) milling machine with RS232C connector, we was constructed with CAD/CAM system. 2. The developed algorithm in this study is able to be design of three dimension object on the computer CRT and manufacturing of NC milling machine. 3. Because of design and modifying on the PC of objects, we can be saving time, cost and improvable precision of objects. 4. Essentially, we expect industrial accident to reduse according as we takes advantage of CAD/CAM system.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.2
• /
• pp.144-154
• /
• 2000

We propose an algorithm for obtaining a triangular approximation of a trimmed NLRBS surface. Triangular approximation is used in the pre-processing step of many applications such as RP(Rapid Prototyping), NC(Numerical Control) and FEA(Finite Element Analysis), etc. The algorithm minimizes the number of triangular elements within tolerance and generates a valid triangular mesh for STL file and NC tool path generation. In the algorithm, a subdivision method is used. Since a patch is a basic element of triangular mesh creation, boundary curves of a patch are divided into line segments and the division of curves is applied for the interior of the surface. That is, boundary curves are subdivided into line segments and two end points of each line segment are propagated to the interior of the surface. For the case of a trimmed surface, triangulation is carried out using a model space information. The algorithm is superior because the number of elements can be controlled as the curvature of the surface varies and it generates the triangular mesh in a trimmed region efficiently. To verify the efficiency, the algorithm was implemented and tested for several 3D objects bounded by NURBS surfaces.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.3.2-3
• /
• 2003

We propose a method of surface extension method using several functions. Interpolation theory is well developed in curve and surface. But extrapolation theory is not well developed because it is not unique outside the useful domain. It requires continuous, first derivative, second derivative continuous extension for matching in NC(Numerical Control) machine. In the past, we generate data outside the useful area and refit those data using least squares method. this has some problems which have some errors within the useful area. We keep the useful area and extend the unuseful area by a function

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.387-396
• /
• 1997

For given discrete derivative data in a rectangular re-gion we propose a method to generate an approximated surface which fits the given derivative data in the region and extends smoothly to a sufficiently large rectangular region. Such an extension in nec-essary in the generation of the surface in NC(numerical control) ma-chine.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.1084-1089
• /
• 1992

Process planning is a key feature that an intelligent CAD/CAM system should possess. In this paper, we address the problem of determinig process configuration to manufacture the free surfaces. For analyzing the surface, the method of surface subdivision is used. The developed algorithm evaluates the processability of the given surface by applying the three/four/five-axes procedures sequentially. To illustrate and test the developed algorithm, numerical simulations are presented.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.6
• /
• pp.96-104
• /
• 1995

A study for a lathe to machine workpiece with noncircular cross-section is presented. The noncircular cutting is accomplished by controlling radial tool position synchronized with revolution angle of the spindle according to the desired cross-sectional shape. A learning control algorithm is suggested for the tool positioning. The learning law of the algorithm is based on pole-zero cancellation, which guarantees the control stability. The control performances are analyzed and simulated on a numerical computer that the effectiveness of the control algorithm is convinced. The algorithm is tested on a conventional NC-lathe which shows some successful results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2457-2464
• /
• 2015

Distributed Networked Control Systems (NCSs) through wireless networks have a tremendous potential to improve the efficiency of various control systems. In this paper, we define the State Update Interval (SUI) as the elapsed time between successful state vector reports derived from the NCSs. A simple expression of the SUI is derived to characterize the key interactions between the control and communication layers. This performance measure is used to formulate a novel optimization problem where the objective function is the probability to meet the SUI constraint and the decision parameter is the channel access probability. We prove the existence and uniqueness of the optimal channel access probability of the optimization problem. Furthermore, the optimal channel access probability for NCSs is lower than the channel access probability to maximize the throughput. Numerical results indicate that the improvement of the success probability to meet the SUI constraint using the optimal channel access probability increases as the number of nodes increases with respect to that using the channel access probability to maximize the throughput.