• Communications for Statistical Applications and Methods
• /
• v.11 no.2
• /
• pp.355-368
• /
• 2004

In order to use Kriging, one has to estimate three parameters(nugget, sill and range) of semivariogram, which shows the relationship in the given two sites. A visual fit of the semivariogram parameters to a few standard models is widely used. But, it does not give the suitable results and not provide the automated process of Kriging. The gradient based nonlinear least squares is another choices to estimate three parameters, but it has some problems such as initial value problem. In this paper, we suggest the genetic algorithm as a compatible alternative method to solve the above mentioned problem. Finally, we estimate three parameters of semivariogram of rain-fall by adapting the genetic algorithm, compute Kriging estimate and conclude its effectiveness and compatibility.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.1
• /
• pp.86-92
• /
• 2012

When missile is launched, a launcher needs to be leveled with accuracy to avoid the systems's instability. In general, a launcher is leveled by adjusting the stroke of leveling jacks; however, it is still challenge to control the leveling jacks fast and accurately. This paper thus proposed an innovative algorithm for compensating ground inclination of a missile launcher to expand operational field of a missile launcher. Using two inclinometers attached on a launcher, a base jack for leveling is selected and the mixed gradient where launcher stands on can be estimated. Due to the limited stroke, the launcher can compensate its ground inclination within maximum stroke margin. Then, the ground inclination of a launcher can be compensated by calculated angle using weighting factors. The effectiveness of proposed algorithm is proved with a prototype missile launcher.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1172-1179
• /
• 1996

General adaptive noise canceller(ANC) suffers from the misadjustment of adaptive filter weights, because of the gradient-estimate noise at steady state. In this paper, an adaptive noise cancellation algorithm with speech detector which is distinguishing speech from silence and adaptation-transient region is proposed. The speech detector uses property of adaptive prediction-error filter which can filter the highly correlated speech. To detect speech region, estimation error which is the output of the adaptive filter is applied to the adaptive prediction-error filter. When speech signal apears at the input of the adaptive prediction-error filter. The ratio of input and output energy of adaptive prediction-error filter becomes relatively lower. The ratio becomes large when the white noise appears at the input. So the region of speech is detected by the ratio. Sign algorithm is applied at speech region to prevent the weights from perturbing by output speech of ANC. As results of computer simulation, the proposed algorithm improves segmental SNR and SNR up to about 4 dBand 11 dB, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2303-2309
• /
• 1997

This paper presents a convergence analysis of the stocastic gradient adaptive algorithm based on the least mean absolute third (LMAT) error criteriohn. Under the assumption that the signals involved are zero-mean, wide-sense sateionaryand gaussian, a set of nonlinear difference equations that characterizes the mean and mean-squared behavior of the algorithm is derived. Computer simulation resutls show fairly good agreements between the theoetical and empirical behaviors of the algorithm.

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

A novel steepest descent adaptive filter algorithm, which uses the instantaneous stochastic gradient for the steepest descent direction, is derived from a newly devised performance index function. The performance function for the new algorithm is improved from that for the LMS in consideration that the stochastic steepest descent method is utilized to minimize the performance index iterativly. Through mathematical analysis and computer simulations, it is verified that there are substantial improvements in convergence and misadjustments even though the computational simplicity and the robustness of the LMS algorithm are hardly sacrificed. On the other hand, the new algorithm can be interpreted as a variable step size adaptive filter, and in this respect a heuristic method is proposed in order to reduce the noise caused by the step size fluctuation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.43-46
• /
• 1995

Adaptive algorithms based on gradient adaptation have been extensively investigated and successfully jointed with active noise/vibration control applications. The Filtered-X LMS algorithm became one of the basic feedforward algorithms in such applications, but still is not fully understood. The error path model effect on the Filtered-X LMS algorithm has been under the investigation and some useful properties related stability has been discovered. We are interested in utilizing the fact that the model error caused by the way optimizing the error path model in a view point of convergence speed of Filtered-X LMS algorithm for pure tone noise suppression application without any performance loss at steady state.

• 제어로봇시스템학회:학술대회논문집
• /
• 1999.10a
• /
• pp.173-176
• /
• 1999

This paper shows a self tuning fuzzy inference method by the genetic algorithm in the fuzzy-sliding mode control for a Polishing robot. Using this method, the number of inference rules and the shape of membership functions are determined by the genetic algorithm. The fuzzy outputs of the consequent part are derived by the gradient descent method. Also, it is guaranteed that .the selected solution become the global optimal solution by optimizing the Akaike's information criterion expressing the quality of the inference rules. It is shown by simulations that the method of fuzzy inference by the genetic algorithm provides better learning capability than the trial and error method.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.5
• /
• pp.93-99
• /
• 2000

In many dynamic structural optimization problems, the goal is to reduce the total weight of the structure without causing the resonance. Up to now, gradient informations(i.e., design sensitivity) have been used to achieve the goal. For some class of dynamic problems, especially coalescent eigenvalue Problems with multiobjective optimization, the design sensitivity analysis is too much complicated mathematically and numerically. Therefore, this article proposes a new technique fur structural dynamic modification using a mode modification method with Genetic Algorithm(GA). In GA formulation, fitness is defined based on penalty function approach. Design variables are iteratively improved by using genetic algorithm. Two numerical examples are shown, (ⅰ) a cantilevered plate, and (ⅱ) H-shaped structure. The results demonstrate that the proposed method is highly efficient.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.2
• /
• pp.85-91
• /
• 2000

This paper proposes a novel method with pseudo-on-line scheme using the optimized look-up table based on the genetic algorithm which does not use the gradient and finds the global optimum of an un-constraint optimization problem. The technique is a pseudo-on-line method that optimally estimates the parameters of fuzzy PID(FPID) controller for systems with non-linearity, using the genetic algorithm. The proposed controller(GFPID) with the auto-tuning function is applied to the on-line and real-time control of speed at 3-phase induction motor, and its computer simulation is carried out. simulation results show that the proposed methodis more excellent that conventional FPID and PID controllers.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.249-252
• /
• 2001

We, for the first time, propose a novel adaptive beamforming algorithm for smart antenna. The algorithm requires neither spatial knowledge nor reference signal. The algorithm is based on gradient method and its merit is in the simplicity of calculation load while maintaining good performance. Computer simulations are presented to verify the performance.