• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.6
• /
• pp.439-444
• /
• 2002

In this paper, a new model reduction method is proposed to obtain a reduced order model in the frequency domain. The method is developed based on the second-order plus dead time modeling technique. The initial value of the reduced model parameters can be obtained using this method coinciding four point(0, -$\pi$/2, -$\pi$, -3$\pi$/2) on the Nyquist curve. The optimal parameters of the reduced model is obtained through calculation procedure with three steps. It is shown that Nyquist curves and unit step responses of the reduced models of numerical examples closely agree with those of original models.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.4
• /
• pp.240-250
• /
• 1988

This pc-vision system digitizes/displays 512*512*8 bit pixel image in real time and is capable of the various image processing. This system provides a versatile solution to those users pursuing high performance image processing system compatible with the VME bus, and is general purpose imaging system giving the optimal efficiency for machine vision, medical use and various task. In this paper, Image processing technique has classified image enhancement and image analysis in order to design and implement the pc-vision system. In order to improve processing speed, This system unilizing ROI processing performs point operation, local operation and global operation as well as common arithmetic/logic operation in real time.

• The Korean Journal of Applied Statistics
• /
• v.10 no.1
• /
• pp.69-84
• /
• 1997

We consider a linear calibration problem, $y_i = $$\alpha + \beta (x_i - x_0) + \epsilon_i$, $i=1, 2, {\cdot}{\cdot},n$ $y_f = \alpha + \beta (x_f - x_0) + \epsilon, $ where we observe $(x_i, y_i)$'s for the controlled calibration experiments and later we make inference about $x_f$ from a new observation $y_f$. The objective of the calibration design problem is to find the optimal design $x = (x_i, \cdots, x_n$ that gives the best estimates for $x_f$. We compare Kim(1989)'s Bayesian design which minimizes the expected value of the posterior variance of $x_f$ and some optimal designs from literature. Kim suggested the Bayesian optimal design based on the analysis of the characteristics of the expected loss function and numerical must be equal to the prior mean and that the sum of squares be as large as possible. The designs to be compared are (1) Buonaccorsi(1986)'s AV optimal design that minimizes the average asymptotic variance of the classical estimators, (2) D-optimal and A-optimal design for the linear regression model that optimize some functions of $M(x) = \sum x_i x_i'$, and (3) Hunter & Lamboy (1981)'s reference design from their paper. In order to compare the designs which are optimal in some sense, we consider two criteria. First, we compare them by the expected posterior variance criterion and secondly, we perform the Monte Carlo simulation to obtain the HPD intervals and compare the lengths of them. If the prior mean of $x_f$ is at the center of the finite design interval, then the Bayesian, AV optimal, D-optimal and A-optimal designs are indentical and they are equally weighted end-point design. However if the prior mean is not at the center, then they are not expected to be identical.In this case, we demonstrate that the almost Bayesian-optimal design was slightly better than the approximate AV optimal design. We also investigate the effects of the prior variance of the parameters and solution for the case when the number of experiments is odd.

• Journal of the Korea Society for Simulation
• /
• v.20 no.2
• /
• pp.67-76
• /
• 2011

Order picking in automotive service parts warehouses is considered to be the most labor-intensive operation. Such warehouses contain hundreds of thousands of items, but normally 20% of products contribute to about 80% of turnover according to Pareto's 80-20 principle. Therefore most fast moving items are located near an outbound area which is called the "Golden Zone". Order picking routing efficiency is related to productivity and labor cost. However, most companies use simple methods. In this paper, we describe a series of computational experiments over a set of test cases where, we compared various previously existing routing heuristics to an optimal algorithm. We focus on examining the influence of the golden zone on the performance and selection of routing methods. The results obtained show that the optimal routing method increases the productivity at least 17.2%, and all the routing methods have better performance as the pick up rate from the golden zone increases.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.844-847
• /
• 1997

In this paper, scheduling problem is dealt for the minimization of due date penalty for the customer order. Multiproduct batch processes have been dealt with for their suitability for high value added low volume products. Their scheduling problems take minimization of process operation for objective function, which is not enough to meet the customer satisfaction and the process efficiency simultaneously because of increasing requirement of fast adaptation for rapid changing market condition. So new target function has been suggested by other researches to meet two goals. Penalty function minimization is one of them. To present more precisely production scheduling, we develop new scheduling model with penalty function of earliness and tardiness We can find many real cases that penalty parameters are divergent by the difference between the completion time of operation and due date. That is to say, the penalty parameter values for the product change by the customer demand condition. If the order charges different value for due date, we can solve it with the due date period. The period means the time scope where penalty parameter value is 0. If we make use of the due date period, the optimal sequence of our model is not always same with that of fixed due date point. And if every product have due date period, due date of them are overlapped which needs optimization for the maximum profit and minimum penalty. Due date period extension can be enlarged to makespan minimization if every product has the same abundant due date period and same penalty parameter. We solve this new scheduling model by simulated annealing method. We also develop the program, which can calculate the optimal sequence and display the Gantt chart showing the unit progress and time allocation only with processing data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.483-503
• /
• 2015

This paper analyzes the optimal user density and power allocation for Device-to-Device (D2D) communication underlaying cellular networks on multiple bands with the target of maximizing the D2D transmission capacity. The entire network is modeled by Poisson point process (PPP) which based on stochastic geometry. Then in order to ensure the outage probabilities of both cellular and D2D communication, a sum capacity optimization problem for D2D system on multiple bands is proposed. Using convex optimization, the optimal D2D density is obtained in closed-form when the D2D transmission power is determined. Next the optimal D2D transmission power is obtained in closed-form when the D2D density is fixed. Based on the former two conclusions, an iterative algorithm for the optimal D2D density and power allocation on multiple bands is proposed. Finally, the simulation results not only demonstrate the D2D performance, density and power on each band are constrained by cellular communication as well as the interference of the entire system, but also verifies the superiority of the proposed algorithm over sorting-based and removal algorithms.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.1
• /
• pp.22-30
• /
• 2008

This paper deals with the nonlinear optimal control approach to helicopter maneuver problems using the indirect method. We apply a penalty function to the deviation from a prescribed trajectory to convert the system optimality to an unconstrained optimal control problem. The resultant two-point boundary value problem has been solved by using the multiple-shooting method. This paper focuses on the effect of the number of shooting nodes and initialization methods on the numerical solution in order to define the minimum number of shooting nodes required for numerical convergence and to provide a method increasing convergence radius of the indirect method. The results of this study can provide an approach to improve numerical stability and convergence of the indirect method when we solve the optimal control problems of an inherently unstable helicopter system.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.1
• /
• pp.31-38
• /
• 2008

This paper deals with the nonlinear optimal control approach to helicopter maneuver problems using the indirect method. We apply a penalty function to the integral deviation from a prescribed trajectory to convert the system optimality to an unconstrained optimal control problem. The resultant two-point boundary value problem has been solved by using a multiple-shooting method. This paper focuses on the model selection strategies to resolve the problem of numerical instability and high wait time when a high fidelity model with rotor dynamics is applied. Four different types of helicopter models are identified, two of which are linear models with or without rotor models, as well as two models which include the nonlinear mathematical model for rotor in its formulation. The relative computation time and the number of function calls for each model are compared in order to provide a guideline for the selection of helicopter model.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.1
• /
• pp.12-22
• /
• 2016

Lidar-based hazard avoidance landing system for lunar lander calculates hazard cost with respect to the desired local landing area in order to identify hazard and designate safe landing point where the cost is minimum basically using slope and roughness of the landing area. In this case, if the parameters are only considered, chosen landing target can be designated near hazard threatening the lander. In order to solve this problem and select optimal safe landing point, hazard cost based on relative distance to hazard should not be considered as well as cost based on terrain parameters. In this paper, the effect of hazard cost based on relative distance to hazard on safe landing performance was analyzed and it was confirmed that landing site designation with two relative distances to hazard results in the best safe landing performance by an experiment using three-dimensional depth camera.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1127-1136
• /
• 2003

Estimation of software project cost, effort and duration in the early stage of software development cycle is a difficult and key problem in software engineering. Most of models estimate the development effort using the function point that is measured from the requirement specification. This paper presents optimal team size and duration prediction based on function point in order to provide information that can be used as a guide in selecting the most Practical and productive team size for a software development project. We introduce to productive metrics and cost for decision criteria of ideal team size and duration. The experimental is based on the analysis of 300 development and enhancement software project data. These data sets are divide in two subgroups. One is a development project; the other is a maintenance project. As a result of evaluation by productivity and cost measured criteria in two subgroups, we come to the conclusion that the most successful projects has small teams and minimum duration. Also, I proposed that predictive model for team sire and duration according to function point size based on experimental results. The presented models gives a criteria for necessary team site and duration according to the software size.