• Title/Summary/Keyword: Evolutionary Search

Search Result 248, Processing Time 0.036 seconds

Adaptive Learning Control of Electro-Hydraulic Servo System Using Real-Time Evolving Neural Network Algorithm (실시간 진화 신경망 알고리즘을 이용한 전기.유압 서보 시스템의 적응 학습제어)

  • Jang, Seong-Uk;Lee, Jin-Geol
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.7
    • /
    • pp.584-588
    • /
    • 2002
  • The real-time characteristic of the adaptive leaning control algorithms is validated based on the applied results of the hydraulic servo system that has very strong a non-linearity. The evolutionary strategy automatically adjusts the search regions with natural competition among many individuals. The error that is generated from the dynamic system is applied to the mutation equation. Competitive individuals are reduced with automatic adjustments of the search region in accordance with the error. In this paper, the individual parents and offspring can be reduced in order to apply evolutionary algorithms in real-time. The feasibility of the newly proposed algorithm was demonstrated through the real-time test.

A Fuzzy Logic Controller for Speed Control of a DC Series Motor Using an Adaptive Evolutionary Computation

  • Hwang, Gi-Hyun;Hwang, Hyun-Joon;Kim, Dong-Wan;Park, June-Ho
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.2 no.1
    • /
    • pp.13-18
    • /
    • 2000
  • In this paper, an Adaptive Evolutionary Computation(AEC) is proposed. AEC uses a genetic algorithm(GA) and an evolution strategy (ES) in an adaptive manner is order to take merits of two different evolutionary computations: global search capability of GA and local search capability of ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. AEC is used to design the membership functions and the scaling factors of fuzzy logic controller (FLC). To evaluate the performances of the proposed FLC, we make an experiment on FLC for the speed control of an actual DC series motor system with nonlinear characteristics. Experimental results show that the proposed controller has better performance than that of PD controller.

  • PDF

Design of FLC for High-Angle-of-Attack Flight Using Adaptive Evolutionary Algorithm

  • Won, Tae-Hyun;Hwang, Gi-Hyun;Park, June-Ho;Lee, Man-Hyung
    • Journal of Mechanical Science and Technology
    • /
    • v.17 no.2
    • /
    • pp.187-196
    • /
    • 2003
  • In this paper, a new methodology of evolutionary computations - An Adaptive Evolutionary Algorithm (AEA) is proposed. AEA uses a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner in order to take merits of two different evolutionary computations : global search capability of GA and local search capability of ES. In the reproduction procedure, the proportions of the population by GA and ES are adaptively modulated according to the fitness. AEA is used to. designing fuzzy logic controller (FLC) for a high-angle-of-attack flight system for a super-maneuverable version of F-18 aircraft. AEA is used to determine the membership functions and scaling factors of an FLC. The computer simulation results show that the FLC has met both robustness and performance requirements.

Multipopulation Differential Evolution Algorithm (다중 인구 차동 진화 알고리즘)

  • Shin, Seong-Yoon;Lee, Hyun-Chang;Shin, Kwang-Seong;Kim, Hyung-Jin;Lee, Jae-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.549-550
    • /
    • 2021
  • This paper, we propose a multi-population differential evolutionary algorithm using MUDE (Uniform Local Search) to recognize various mutation strategies. In MUDE, a population is divided into several subpopulations with different population sizes that perform different mutation strategies according to evolutionary ratios (DE/rand/1 and DE/current-to-rand/1). To improve population diversity, information is migrated between subpopulations by a soft island model.

  • PDF

A New Diversity Preserving Evolutionary Programming Technique (다양성을 유지하는 새로운 진화 프로그래밍 기법)

  • 신정환;진성일;최두현
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.1011-1014
    • /
    • 1999
  • In this paper, a new algorithm has been presented that helps to preserve diversity as well as to enhance the convergence speed of the evolutionary programming. This algorithm is based on the cell partitioning of search region for preserving the diversity. Until now, the greater part of researches is not concerned about preserving the diversity of individuals in a population but improving convergence speed. Although these evolutions are started from multi-point search at the early phase, but at the end those search points are swarming about a one-point, the strong candidate. These evolutions vary from the original idea in some points such as multi-point search. In most case we want to find the only one point of the best solution not several points in the vicinity of that. That is why the cell partitioning of search region has been used. By restricting the search area of each individual, the diversity of individual in solution space is preserved and the convergence speed is enhanced. The efficiency of the proposed algorithm has been verified through benchmark test functions.

  • PDF

An Evolutionary Algorithm preventing Consanguineous Marriage

  • Woojin Oh;Oh, Se-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.110.2-110
    • /
    • 2002
  • Evolutionary Algorithm is the general method that can search the optimum value for the various problems. Evolutionary method consists of random selection, crossover, mutation, etc. Since the next generation is selected based on the fitness values, the crossover between chromosomes does not have any restrictions. Not only normal marriage but also consanguineous marriage will take place. In human world, consanguineous marriage was reported to cause various genetic defects, such as poor immunity about new diseases and new environment disaster, These problems translate into searching for the local optimum, not the global optimum. So, a new evolutionary algorithm is needed that prevents traps to...

  • PDF

Optimal Setting of Overcurrent Relay in Distribution Systems Using Adaptive Evolutionary Algorithm (적응진화연산을 이용한 배전계통의 과전류계전기 최적 정정치 결정)

  • Jeong, Hee-Myung;Lee, Hwa-Seok;Park, June-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.9
    • /
    • pp.1521-1526
    • /
    • 2007
  • This paper presents the application of Adaptive Evolutionary Algorithm (AEA) to search an optimal setting of overcurrent relay coordination to protect ring distribution systems. The AEA takes the merits of both a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. The overcurrent relay settings and coordination requirements are formulated into a set of constraint equations and an objective function is developed to manage the overcurrent relay settings by the Time Coordination Method. The domain of overcurrent relays coordination for the ring-fed distribution systems is a non-linear system with a lot of local optimum points and a highly constrained optimization problem. Thus conventional methods fail in searching for the global optimum. AEA is employed to search for the optimum relay settings with maximum satisfaction of coordination constraints. The simulation results show that the proposed method can optimize the overcurrent relay settings, reduce relay mis-coordinated operations, and find better optimal overcurrent relay settings than the present available methods.

Development of Pareto strategy multi-objective function method for the optimum design of ship structures

  • Na, Seung-Soo;Karr, Dale G.
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.8 no.6
    • /
    • pp.602-614
    • /
    • 2016
  • It is necessary to develop an efficient optimization technique to perform optimum designs which have given design spaces, discrete design values and several design goals. As optimization techniques, direct search method and stochastic search method are widely used in designing of ship structures. The merit of the direct search method is to search the optimum points rapidly by considering the search direction, step size and convergence limit. And the merit of the stochastic search method is to obtain the global optimum points well by spreading points randomly entire the design spaces. In this paper, Pareto Strategy (PS) multi-objective function method is developed by considering the search direction based on Pareto optimal points, the step size, the convergence limit and the random number generation. The success points between just before and current Pareto optimal points are considered. PS method can also apply to the single objective function problems, and can consider the discrete design variables such as plate thickness, longitudinal space, web height and web space. The optimum design results are compared with existing Random Search (RS) multi-objective function method and Evolutionary Strategy (ES) multi-objective function method by performing the optimum designs of double bottom structure and double hull tanker which have discrete design values. Its superiority and effectiveness are shown by comparing the optimum results with those of RS method and ES method.

Development of a Multi-objective function Method Based on Pareto Optimal Point (Pareto 최적점 기반 다목적함수 기법 개발에 관한 연구)

  • Na, Seung-Soo
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.42 no.2 s.140
    • /
    • pp.175-182
    • /
    • 2005
  • It is necessary to develop an efficient optimization technique to optimize the engineering structures which have given design spaces, discrete design values and several design goals. As optimization techniques, direct search method and stochastic search method are widely used in designing of engineering structures. The merit of the direct search method is to search the optimum points rapidly by considering the search direction, step size and convergence limit. And the merit of the stochastic search method is to obtain the global optimum points by spreading point randomly entire the design spaces. In this paper, a Pareto optimal based multi-objective function method (PMOFM) is developed by considering the search direction based on Pareto optimal points, step size, convergence limit and random search generation . The PMOFM can also apply to the single objective function problems, and can consider the discrete design variables such as discrete plate thickness and discrete stiffener spaces. The design results are compared with existing Evolutionary Strategies (ES) method by performing the design of double bottom structures which have discrete plate thickness and discrete stiffener spaces.

Behavior Learning and Evolution of Swarm Robot based on Harmony Search Algorithm (Harmony Search 알고리즘 기반 군집로봇의 행동학습 및 진화)

  • Kim, Min-Kyung;Ko, Kwang-Eun;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.3
    • /
    • pp.441-446
    • /
    • 2010
  • Each robot decides and behaviors themselves surrounding circumstances in the swarm robot system. Robots have to conduct tasks allowed through cooperation with other robots. Therefore each robot should have the ability to learn and evolve in order to adapt to a changing environment. In this paper, we proposed learning based on Q-learning algorithm and evolutionary using Harmony Search algorithm and are trying to improve the accuracy using Harmony Search Algorithm, not the Genetic Algorithm. We verify that swarm robot has improved the ability to perform the task.