• Title/Summary/Keyword: Evolutionary computation speed

Search Result 17, Processing Time 0.027 seconds

Fuzzy Controller of Three-Inertia Resonance System designed by Differential Evolution

  • Ikeda, Hidehiro;Hanamoto, Tsuyoshi
    • Journal of international Conference on Electrical Machines and Systems
    • /
    • v.3 no.2
    • /
    • pp.184-189
    • /
    • 2014
  • In this paper, a new design method of vibration suppression controller for multi-inertia (especially, 3-ineritia) resonance systems is proposed. The controller consists of a digital fuzzy controller for speed loop and a digital PI controller for current minor loop. The three scaling factor of the fuzzy controller and two PI controller gains are determined by Differential Evolution (DE). The DE is one of optimization techniques and a kind of evolutionary computation technique. In this paper, we have applied the DE/rand/1/bin strategy to design the optimal controller parameters. Comparing with the conventional design algorithm, the proposed method is able to shorten the time of the controller design to a large extent and to obtain accurate results. Finally, we confirmed the effectiveness of the proposal method by the computer simulations.

Speeding Up Neural Network-Based Face Detection Using Swarm Search

  • Sugisaka, Masanori;Fan, Xinjian
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1334-1337
    • /
    • 2004
  • This paper presents a novel method to speed up neural network (NN) based face detection systems. NN-based face detection can be viewed as a classification and search problem. The proposed method formulates the search problem as an integer nonlinear optimization problem (INLP) and expands the basic particle swarm optimization (PSO) to solve it. PSO works with a population of particles, each representing a subwindow in an input image. The subwindows are evaluated by how well they match a NN-based face filter. A face is indicated when the filter response of the best particle is above a given threshold. To achieve better performance, the influence of PSO parameter settings on the search performance was investigated. Experiments show that with fine-adjusted parameters, the proposed method leads to a speedup of 94 on 320${\times}$240 images compared to the traditional exhaustive search method.

  • PDF

A modified Genetic Algorithm using SVM for PID Gain Optimization

  • Cho, Byung-Sun;Han, So-Hee;Son, Sung-Han;Kim, Jin-Su;Park, Kang-Bak;Tsuji, Teruo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.686-689
    • /
    • 2004
  • Genetic algorithm is well known for stochastic searching method in imitating natural phenomena. In recent times, studies have been conducted in improving conventional evolutionary computation speed and promoting precision. This paper presents an approach to optimize PID controller gains with the application of modified Genetic Algorithm using Support Vector Machine (SVMGA). That is, we aim to explore optimum parameters of PID controller using SVMGA. Simulation results are given to compare to those of tuning methods, based on Simple Genetic Algorithm and Ziegler-Nicholas tuning method.

  • PDF

An Improved Genetic Algorithm for Fast Face Detection Using Neural Network as Classifier

  • Sugisaka, Masanori;Fan, Xinjian
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1034-1038
    • /
    • 2005
  • This paper presents a novel method to speed up neural network (NN) based face detection systems. NN-based face detection can be viewed as a classification and search problem. The proposed method formulates the search problem as an integer nonlinear optimization problem (INLP) and develops an improved genetic algorithm (IGA) to solve it. Each individual in the IGA represents a subwindow in an input image. The subwindows are evaluated by how well they match a NN-based face filter. A face is indicated when the filter response of the best particle is above a given threshold. Experimental results show that the proposed method leads to a speedup of 83 on $320{\times}240$ images compared to the traditional exhaustive search method.

  • PDF

An Innovative Fast Relay Coordination Method to Bypass the Time Consumption of Optimization Algorithms in Relay Protection Coordination

  • Kheshti, Mostafa;Kang, Xiaoning;Jiao, Zaibin
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.2
    • /
    • pp.612-620
    • /
    • 2017
  • Relay coordination in power system is a complex problem and so far, meta-heuristic algorithms and other methods as an alternative approach may not properly deal with large scale relay coordination due to their huge time consuming computation. In some cases the relay coordination could be unachievable. As the urgency for a proper approach is essential, in this paper an innovative and simple relay coordination method is introduced that is able to be applied on optimization algorithms for relay protection coordination. The objective function equation of operating time of relays are divided into two separate functions with less constraints. As the analytical results show here, this equivalent method has a remarkable speed with high accuracy to coordinate directional relays. Two distribution systems including directional overcurrent relays are studied in DigSILENT software and the collected data are examined in MATLAB. The relay settings of this method are compared with particle swarm optimization and genetic algorithm. The analytical results show the correctness of this mathematical and practical approach. This fast coordination method has a proper velocity of convergence with low iteration that can be used in large scale systems in practice and also to provide a feasible solution for protection coordination in smart grids as online or offline protection coordination.

Design of Evolvable Hardware based on Genetic Algorithm Processor(GAP)

  • Sim Kwee-Bo;Harashiam Fumio
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.5 no.3
    • /
    • pp.206-215
    • /
    • 2005
  • In this paper, we propose a new design method of Genetic Algorithm Processor(GAP) and Evolvable Hardware(EHW). All sorts of creature evolve its structure or shape in order to adapt itself to environments. Evolutionary Computation based on the process of natural selection not only searches the quasi-optimal solution through the evolution process, but also changes the structure to get best results. On the other hand, Genetic Algorithm(GA) is good fur finding solutions of complex optimization problems. However, it has a major drawback, which is its slow execution speed when is implemented in software of a conventional computer. Parallel processing has been one approach to overcome the speed problem of GA. In a point of view of GA, long bit string length caused the system of GA to spend much time that clear up the problem. Evolvable Hardware refers to the automation of electronic circuit design through artificial evolution, and is currently increased with the interested topic in a research domain and an engineering methodology. The studies of EHW generally use the XC6200 of Xilinx. The structure of XC6200 can configure with gate unit. Each unit has connected up, down, right and left cell. But the products can't use because had sterilized. So this paper uses Vertex-E (XCV2000E). The cell of FPGA is made up of Configuration Logic Block (CLB) and can't reconfigure with gate unit. This paper uses Vertex-E is composed of the component as cell of XC6200 cell in VertexE

Position Control and Stabilization of Inverted Pendulum using the Evolution Strategies (진화전략을 이용한 도립진자의 안정화 및 위치제어)

  • 이동욱;심귀보
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.6 no.4
    • /
    • pp.71-80
    • /
    • 1996
  • This paper presents stabilization and position control of the Inverted-Pendulum system with cart by using Evolution Strategies that is one of the Evolutionary Computation and is effective in searching real number. The control input of the Inverted-Pendulum is the element of chromosome corresponding to the divided space of Inverted-Pendulum state variable x, x, 0, 0 . In general, the larger the length of the chromosome is, the longer the time of evolution to search optimal solution is. So in this paper, we propose a scheme that reduce the state space by half by taking the method, that is, converting only the sign of the control input without obtaining separately for the symmetrical sections of the Inverted-Pendulum to improve the speed of Evolution, and improved the efficiency of the entire system in addition to the improvement of the chromosome's evolution time by carrying out the chromosome's evolutional process by two steps one of which is that cart is positioned near the control point and the other cart is positioned far from that point. We propose another method that is Neural Network-Evolution StrategiedNN-ES) Controller. We verify the effectiveness of the proposed control scheme by computer simulations.

  • PDF