• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.9
• /
• pp.1888-1896
• /
• 2002

This study presents a new type of CNC interpolator that is capable of generating cutter paths for ball-end milling of NURBS surfaces. The proposed surface interpolator comprises real-time algorithms for cutter contact (CC) path scheduling and CC path interpolator. Especially in this study, a new interpolator module to regulate cutting forces is developed. This propose algorithm utilizes variable-feedrate commands along the CC path according to the curvature of machined surfaces during the interpolation process. Additionally, it proposes an OpenGL graphic library for computer graphics and animation of interpolated tool-position display. The proposed interpolator is evaluated and compared with the existing method based on constant feedrates through computer simulations.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.7
• /
• pp.696-705
• /
• 1991

This paper describes the procedures for pre-tuning and re-tuning the gains of PI controller based on output patterns -output error integral- of the unknown process which may not have any information, for example, system order, deadtime, time constant, etc. The key ideas of the proposed adaptive scheme are as follows. The scheme determines the initial gains by using ZNM (Ziegler-Nichols Method) with relay feedback, and then the adaptive algorithms by pattern recognition are introduced for re-runing the PI gains with on-line scheme whenever control conditions are changed. Because, among the various auto-tuning procedures, ANM with relay feedback has the difficulty in re-tuning with on-line and Bristol method has no comment on initial settings and has variables to pre-determine, which makes the algorithm comples, the proposed methods have the combined scheme with above two procedures to recover those problems. And this paper proposes a simple way to determine adaptive constant in Bristol method. To show the validity of the proposed method, an example is illustrated by computer simulation and a laboratory process, heat exchanger, is experimented.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.9
• /
• pp.845-853
• /
• 2012

We propose time-optimal cornering motion trajectory planning and control algorithms for differential wheeled mobile robot with motor actuating voltage constraint, under piecewise constant control input condition. For time-optimal cornering trajectory generation, 1) we considered mobile robot's dynamics including actuator motors, 2) divided the cornering trajectory into one liner section, followed by two cornering section with angular acceleration and deceleration, and finally one liner section, and 3) formulated an efficient trajectory generation algorithm satisfying the bang-bang control principle. Also we proposed an efficient trajectory control algorithm and implemented with an X-bot to prove the performance.

• Proceedings of the KIPE Conference
• /
• 2005.07a
• /
• pp.587-590
• /
• 2005

In this paper, the PWM inverter-motor drive system including sensor is controlled through the network. The algorithm to compensate for the time delay of ac current and ac voltage sensors due to the network is proposed. The delay time of sensors is kept nearly constant, using the synchronous signal and timers. The error between the real and estimated ac signals can be reduced by using two slopes for estimating the value of at signals. The proposed algorithms are verified with the simulation studies and experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1714-1725
• /
• 1993

This paper analyzes the properties of such algorithm that corresponds to the nonlinear adaptive algorithm with additional update terms, parameterized by the scalar factors a1, a2, a3 and Presents its structure. The analysis of convergence leads to eigenvalues of the transition matrix for the mean weight vector. Regions in which the algorithm becomes stable are demonstrated. The time constant is derived and the computational complexities of MLMS algorithms are compared with those of the conventional LMS, sign, LFG, and QFG algorithms. The properties of convergence in the mean square are analyzed and the expressions of the mean square recursion and the excess mean square error are derived. The necessary condition for the CFG algorithm to be stable is attained. In the computer simulation applied to the system identification the CFG algorithm has the more computation complexities but the faster convergence speed than LMS, LFG and QFG algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.401-407
• /
• 2016

We can consider the following problems for two given points p and q in a simple polygon P. (1) Compute the set of points of P which are visible from both p and q. (2) Compute the set of points of P which are visible from either p or q. They are corresponding to the problems which are to compute the intersection and the union of two visibility polygons. In this paper, we consider algorithms for solving these problems on a reconfigurable mesh(in short, RMESH). The algorithm in [1] can compute the intersection of two general polygons in constant time on an RMESH with size O($n^3$), where n is the total number of vertices of two polygons. In this paper, we construct the planar subdivision graph in constant time on an RMESH with size O($n^2$) using the properties of the visibility polygon for preprocessing. Then we present O($log^2n$) time algorithms for computing the union as well as the intersection of two visibility polygons, which improve the processor-time product from O($n^3$) to O($n^2log^2n$).

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1165-1171
• /
• 2017

The traditional form of parallelism in Monte Carlo particle transport simulations, wherein each individual particle history is considered a unit of work, does not lend itself well to data-level parallelism. Event-based algorithms, which were originally used for simulations on vector processors, may offer a path toward better utilizing data-level parallelism in modern computer architectures. In this study, a simple model is developed for estimating the efficiency of the event-based particle transport algorithm under two sets of assumptions. Data collected from simulations of four reactor problems using OpenMC was then used in conjunction with the models to calculate the speedup due to vectorization as a function of the size of the particle bank and the vector width. When each event type is assumed to have constant execution time, the achievable speedup is directly related to the particle bank size. We observed that the bank size generally needs to be at least 20 times greater than vector size to achieve vector efficiency greater than 90%. When the execution times for events are allowed to vary, the vector speedup is also limited by differences in the execution time for events being carried out in a single event-iteration.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.32 no.9
• /
• pp.761-769
• /
• 2008

The majority of mechanical parts are manufactured by milling machines. Hence, geometrically efficient algorithms for tool path generation and physical considerations for better machining productivity with guarantee of machining safety are the most important issues in milling tasks. In this paper, an optimized path generation algorithm for direction parallel milling which is commonly used in the roughing stage is presented. First of all, a geometrically efficient tool path generation algorithm using an intersection points-graph is introduced. Although the direction parallel tool path obtained from geometric information have been successful to make desirable shape, it seldom consider physical process concerns like cutting forces and chatters. In order to cope with these problems, an optimized tool path, which maintains constant MRR in order to achieve constant cutting forces and to avoid chatter vibrations at all time, is introduced and the result is verified. Additional tool path segments are appended to the basic tool path by using a pixel based simulation technique. The algorithm has been implemented for two dimensional contiguous end milling operations, and cutting tests are conducted by measuring spindle current, which reflects machining situations, to verify the significance of the proposed method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.12
• /
• pp.1189-1196
• /
• 2010

This paper provides an identification method for three-parameter models i.e. first order with dead time models and second order with dead time models. The proposed identification method is based on step response and can be easily implemented using digital microprocessors. The proposed method first identifies the order of the plant i.e. first order or second order from the behavior of the plant with constant input. After the order of the plant is determined, a test step input is applied to the system and the three parameters of the plant are obtained from the corresponding response of the plant. The output of the plant need not to be zero when the test signal is applied. The efficacy of proposed algorithms is verified through simulation and experiment.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.5
• /
• pp.989-998
• /
• 2011

Cloud computing provides computation, software, data access, and storage services that do not require end-user knowledge of the physical location and configuration of the system that delivers the services. Cloud computing providers have setup several data centers at different geographical locations over the Internet in order to optimally serve needs of their customers around the world. One of the fundamental challenges in geographically distributed clouds is to provide efficient algorithms for supporting inter-cloud data management and dissemination. In this paper, we propose a group quorum system (GQS)-based dissemination for improving the interoperability of inter-cloud in time-critical event dissemination service, such as computing policy updating, message sharing, event notification and so forth. The proposed GQS-based method organizes these distributed clouds into a group quorum ring overlay to support a constant event dissemination latency. Our numerical results show that the GQS-based method improves the efficiency as compared with Chord-based and Plume methods.