• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.1952-1954
• /
• 2001

In this paper, we propose the neuro-fuzzy modeling method using VmGA (Virus messy Genetic Algorithm) for the complex nonlinear system. VmGA has more effective and adaptive structure than sGA. in this paper, we suggest a new coding method for applying the model's input and output data to the optimal number of rules in fuzzy models and the structure and parameter identification of membership functions simultaneously. The proposed method realizes the optimal fuzzy inference system using the learning ability of neural network. For fine-tune of parameters identified by VmGA, back- propagation algorithm is used for optimizing the parameter of fuzzy set. The proposed fuzzy modeling method is applied to a nonlinear system to prove the superiority of the proposed approach through comparing with ANFIS.

• Earthquakes and Structures
• /
• v.22 no.4
• /
• pp.421-430
• /
• 2022

This paper addresses the stochastic control problem of robots within the framework of parameter uncertainty and uncertain noise covariance. First of all, an open circle deterministic trajectory optimization issue is explained without knowing the unequivocal type of the dynamical framework. Then, a Linear Quadratic Gaussian (LQG) controller is intended for the ostensible trajectory-dependent linearized framework, to such an extent that robust hereditary NN robotic controller made out of the Kalman filter and the fuzzy controller is blended to ensure the asymptotic stability of the non-continuous controlled frameworks. Applicability and performance of the proposed algorithm shown through simulation results in the complex systems which are demonstrate the feasible to improve the performance by the proposed approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4776-4798
• /
• 2015

The location selection of virtual machines in distributed cloud is difficult because of the physical resource distribution, allocation of multi-dimensional resources, and resource unit cost. In this study, we propose a multi-object virtual machine location selection algorithm (MOVMLSA) based on group information, doubly linked list structure and genetic algorithm. On the basis of the collaboration of multi-dimensional resources, a fitness function is designed using fuzzy logic control parameters, which can be used to optimize search space solutions. In the location selection process, an orderly information code based on group and resource information can be generated by adopting the memory mechanism of biological immune systems. This approach, along with the dominant elite strategy, enables the updating of the population. The tournament selection method is used to optimize the operator mechanisms of the single-point crossover and X-point mutation during the population selection. Such a method can be used to obtain an optimal solution for the rapid location selection of virtual machines. Experimental results show that the proposed algorithm is effective in reducing the number of used physical machines and in improving the resource utilization of physical machines. The algorithm improves the utilization degree of multi-dimensional resource synergy and reduces the comprehensive unit cost of resources.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1418-1426
• /
• 2009

There has been a lot of interest in an effective method for background subtraction in an effort to separate foreground objects from a predefined background image. Promising results on background subtraction using statistical methods have recently been reported are robust enough to operate in dynamic environments, but generally require very large computational resources and still have difficulty in obtaining clear segmentation of objects. We use a simple running-average method to model a gradually changing background, instead of using a complicated statistical technique. We employ a single global threshold vector, optimized by a genetic algorithm, instead of pixel-by-pixel thresholds. A new fitness function is defined and trained to evaluate segmentation result. The system has been implemented on a PC with a webcam, and experimental results on real images show that the new method outperforms an existing method based on a mixture of Gaussian.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.5
• /
• pp.29-44
• /
• 2000

Adaptation of operator probabilities is one of the most important and promising issues in evolutionary computation areas. This is because the setting of appropriate probabilities is not only very tedious and difficult but very important to the performance improvement of genetic algorithms. Many researchers have introduced their algorithms for setting or adapting operator probabilities. Experimental results in most previous works, however, have not been satisfiable. Moreover, Tuson have insisted that “the adaptation is not necessarily a good thing” in his papers［$^1$$^2$］. In this paper, we propose a self-tuning scheme for adapting operator probabilities in genetic algorithms. Our scheme was extensively tested on four function optimization problems and one combinational problem； and compared to simple genetic algorithms with constant probabilities and adaptive genetic algorithm proposed by Srinivas et al［$^3$］. Experimental results showed that our scheme was superior to the others. Our scheme compared with previous works has three advantages： less computational efforts, co-evolution without additional operations for evolution of probabilities, and no need of additional parameters.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.5
• /
• pp.18-24
• /
• 2003

The design cycle associated with large engineering systems requires an initial decomposition of the complex system into design processes which are coupled through the transference of output data. Some of these design processes may be grouped into iterative sybcycles. Previous researches predifined the numbers of design processes in groups, but these group sizes should be determined optimally to balance the computing time of each groups. This paper proposes adaptive decomposition method, which determines the group sizes and the order of processes simultaneously to raise design efficiency by expanding the chromosome of the genetic algorithm. Finally, two sample cases are presented to show the effects of optimizing the sequence of processes with the adaptive decomposition method.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.11
• /
• pp.1511-1519
• /
• 2013

This paper proposes the allocation method for capacitor-reactor banks in a distribution system with dispersed generators to reduce the installation costs, the maintenance costs and minimize the loss of electrical energy. The expected lifetime and maintenance period of devices with moving parts depends on the total number of operations, which affects the replacement and maintenance period for aging equipment under a limited budget. In this paper, the expected device lifetimes and the maintenance period are included in the formulation, and the optimal operation status of the devices is determined using a genetic algorithm. The optimal numbers and locations for capacitor-reactor banks are determined based on the optimal operation status. Simulation results in a 69-bus distribution system with the dispersed generator show that the proposed technique performs better than conventional methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.4 s.304
• /
• pp.43-50
• /
• 2005

This paper proposes a new pattern recognition system combining the new adaptive feature weighting based on the genetic algorithm and the modified KNN(K Nearest-Neighbor) rules. The new feature weighting proposed herein avoids the overfitting and finds the Proper feature weighting value by determining the middle value of weights using GA. New GA operators are introduced to obtain the high performance of the system. Moreover, a class dependent feature weighting strategy is employed. Whilst the classical methods use the same feature space for all classes, the Proposed method uses a different feature space for each class. The KNN rule is modified to estimate the class of test pattern using adaptive feature space. Experiments were performed with the unconstrained handwritten numeral database of Concordia University in Canada to show the performance of the proposed method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09b
• /
• pp.99-102
• /
• 2003

A new interacting multiple model (IMM) method using genetic algorithm (GA)-based intelligent input estimation(IIE) is proposed to track a maneuvering target. In the proposed method, the acceleration level for each sub-model is determined by IIE-the estimation of the unknown acceleration input by a fuzzy system using the relation between maneuvering filter residual and non-maneuvering one. The GA is utilized to optimize a fuzzy system fur a sub-model within a fixed range of acceleration input. Then, multiple models are composed of these fuzzy systems, which are optimized for different ranges of acceleration input. In computer simulation for an incoming ballistic missile, the tracking performance of the proposed method is compared with those of the input estimation(IE) technique and the adaptive interacting multiple model (AIMM) method.

• Proceedings of the KIEE Conference
• /
• 2000.07e
• /
• pp.115-121
• /
• 2000

본 논문에서는 진화연산 중에서 해의 다양성과 수렴속도면에서 좋은 성능을 나타내는 실수형 유전알고리즘과 신경회로망을 이용한 적응 퍼지제어기를 설계하였다. 실수형 유전알고리즘을 이용하여 퍼지제어기의 입 출력 이득과 실시간으로 퍼지제어기의 입 출력이득을 적응적으로 변경하는 신경회로망의 가중치를 튜닝하였다. 제안한 방법의 유용성을 평가하기 위해 시지연을 갖는 제어시스템[14]에 적용하였다. 컴퓨터 시뮬레이션 결과, 제안한 적응 퍼지제어기가 기존의 퍼지제어기보다 오버슈트, 정정시간, 상승시간면에서 더 우수한 제어성능을 나타내었다.