• 한국지능시스템학회논문지
• /
• 제13권5호
• /
• pp.590-595
• /
• 2003

본 논문에서는 mGA를 이용해 축구로봇의 속도를 제어하는 새로운 기법을 제안하였다 축구 로봇의 목표를 최소 시간 내에 도착하기 위해 속도제어에 크게 영향을 미치는 거리 오차와 각도 오차 등의 비율을 나타내는 각종 파라미터가 포함되어 있는 제어 함수를 제안하였다. 이들 파라미터들을 mGA을 이용하여 최적의 값들을 탐색함으로써 변화되는 환경 속에서도 로봇의 목적지에 최소 시간 내에 이동하도록 속도제어 전략을 제안한다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 추계학술대회 학술발표 논문집
• /
• pp.157-160
• /
• 2000

This paper deals with the fuzzy modeling for the complex and uncertain system in which conventional and mathematical models may fail to give satisfactory results. mGA(messy Genetic Algorithm) has more effective and adaptive structure than sGA with respect to using changeable-length string and VEGA(Virus Evolution Genetic) Algorithm) can search the global and local optimal solution simultaneously with reverse transcription operator and transduction operator. Therefore in this paper, the optimal fuzzy model is obtained using Virus-messy Genetic Algorithm(Virus-mGA). In this method local information is exchanged in population so that population may sustain genetic divergence. To prove the surperioty of the proposed approach, we provide the numerical example.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.1272-1274
• /
• 2003

In this paper, we present a new algorithm for high dimensional data reduction based on wavelet decomposition and Genetic Algorithm (GA). Comparative results show the superiority of our algorithm for dimensionality reduction and accuracy improvement.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권7호
• /
• pp.531-535
• /
• 2004

A new method is presented to construct a classifier. This was accomplished by combining a generalized regression neural network (GRNN) and a genetic algorithm (GA). The classifier constructed in this way is referred to as a GA-GRNN. The GA played a role of controlling training factors simultaneously. The GA-GRNN was applied to classify 4 different Promoter sequences. The training and test data were composed of 115 and 58 sequence patterns, respectively. The classifier performance was investigated in terms of the classification sensitivity and prediction accuracy. Compared to conventional GRNN, GA-GRNN significantly improved the total classification sensitivity as well as the total prediction accuracy. As a result, the proposed GA-GRNN demonstrated improved classification sensitivity and prediction accuracy over the convention GRNN.

• 동력기계공학회지
• /
• 제9권4호
• /
• pp.202-208
• /
• 2005

The genetic algorithm (GA) which is one of the popular optimum algorithm has been used to solve a variety of optimum problems. Because it need not require the gradient of objective function and is easier to find global solution than gradient-based optimum algorithm using the gradient of objective function. However optimum method using the GA and the finite element method (FEM) takes many computational time to solve the optimum structural design problem which has a great number of design variables, constraints, and system with many degrees of freedom. In order to overcome the drawback of the optimum structural design using the GA and the FEM, the author developed a computer program which can optimize frame structures by using the GA and the generalized transfer stiffness coefficient method. In order to confirm the effectiveness of the developed program, it is applied to optimum design of plane frame structures. The computational results by the developed program were compared with those of iterative design.

• 디지털콘텐츠학회 논문지
• /
• 제2권1호
• /
• pp.51-61
• /
• 2001

퍼지 제어기(FLC)는 고전적인 제어기 보다 외란에 강하고 초기치에 대한 과도응답도 우수할 뿐만 아니라 시스템의 수학적 모델과 파라메터 값을 알지 못하더라도 적절한 제어가 가능하다. 그러나 퍼지 제어기의 제어 규칙 생성은 전문가의 경험과 일단 결정된 제어 규칙은 고정됨으로 인해 제어 시스템의 환경변화에 적응할 수 없는 한계성이 있다. 또한 제어기의 출력값은 미세한 오차를 가지곤 있어 정확한 목표 값에 수렴할 수 없다. 이러한 미세한 오차를 없애기 위하여 여러 가지 방법이 연구되고 있는데, 본 논문에서는 FLC에 NN(Neural Network)과 GA(Genetic Algorithm)를 결합한 GA-FNNIC(유전알고리즘-퍼지 신경망 지능 제어기 : Genetic Algorithm - Fuzzy Neural network Intelligence Controller)를 제안한다. 제안된 GA-FNNIC와 FLC 제어기 간의 출력 특성, 수렴속도, 과도특성과 상승시간에 대해 비교 분석하고, 최종적으로 본 GA-FNNIC가 오차없이 목표치에 정확하게 수렴하는 것을 보인다.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• 제3B권3호
• /
• pp.128-132
• /
• 2003

This paper presents the optimum design of a Linear Induction Motor (LIM) using Genetic algorithm, Niching Genetic algorithm and Neural Network. The design variables are optimized by different optimization methods and the results are discussed.

• 인지과학
• /
• 제4권2호
• /
• pp.181-200
• /
• 1994

다층 신경망의 학습에 있어서 역전파 알고리즘은 시스템이 지역적 최소치에 빠질수 있고,탐색공간의 피라미터들에 의해 신경망 시스템의 성능이 크게 좌우된다는 단점이 있다.이러한 단점을 보완하기 의해 유전자 알고리즘이 신경망의 학습에 도입도었다.그러나 유전자 알고리즘에는 역전파 알고리즘과 같은 미세 조정되는 지역적 탐색(fine-tuned local search) 을 위한 메카니즘이 존재하지 않으므로 시스템이 전역적 최적해로 수렴하는데 많은 시간을 필요로 한다는 단점이 있다. 따라서 본 논문에서는 역전파 알고리즘의 기울기 강하 기법(gradient descent method)을 교배나 돌연변이와 같은 유전 연산자로 둠으로써 유전자 알고리즘에 지역적 미세 조정(local fine-tuning)을 위한 메카니즘을 제공해주는 새로운 형태의 GA-BP 방법을 제안한다.제안된 방법의 유용성을 보이기 위해 3-패러티 비트(3-parity bit) 문제에 실험하였다.

• Journal of Ship and Ocean Technology
• /
• 제9권4호
• /
• pp.35-46
• /
• 2005

The performance of optimisation methods, based on penalty functions, is highly problem- dependent and many methods require additional tuning of some variables. This additional tuning is the influences of penalty coefficient, which depend strongly on the degree of constraint violation. Moreover, Binary-coded Genetic Algorithm (BGA) meets certain difficulties when dealing with continuous and/or discrete search spaces with large dimensions. With the above reasons, Real-coded Micro-Genetic Algorithm (R$\mu$GA) is proposed to find the global optimum of continuous and/or discrete nonlinear constrained engineering problems without handling any of penalty functions. R$\mu$GA can help in avoiding the premature convergence and search for global solution-spaces, because of its wide spread applicability, global perspective and inherent parallelism. The proposed R$\mu$GA approach has been demonstrated by solving three different engineering design problems. From the simulation results, it has been concluded that R$\mu$GA is an effective global optimisation tool for solving continuous and/or discrete nonlinear constrained real­world optimisation problems.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1995년도 봄 학술발표회 논문집
• /
• pp.187-194
• /
• 1995

Traditional genetic algorithms(GA) have mostly used binary code for representing design variable. The binary code GA has many difficulties to solve optimization problems with continuous design variables because of its targe computer core memory size, inefficiency of its computing time, and its bad performance on local search. In this paper, a real code GA is proposed for dealing with the above problems. So, new crossover and mutation processes of read code GA are developed to use continuous design variables directly. The results of real code GA are compared with those of binary code GA for several single and multiple objective optimization problems. As results of comparisons, it is found that the performance of the real code GA is better than that of the binary code GA, and concluded that the rent code GA developed here can be used for the general optimization problem.