A particle swarm optimization approach for optimum design of PID controller in AVR system
TL;DR: The proposed PSO method was indeed more efficient and robust in improving the step response of an AVR system and had superior features, including easy implementation, stable convergence characteristic, and good computational efficiency.
Abstract: In this paper, a novel design method for determining the optimal proportional-integral-derivative (PID) controller parameters of an AVR system using the particle swarm optimization (PSO) algorithm is presented. This paper demonstrated in detail how to employ the PSO method to search efficiently the optimal PID controller parameters of an AVR system. The proposed approach had superior features, including easy implementation, stable convergence characteristic, and good computational efficiency. Fast tuning of optimum PID controller parameters yields high-quality solution. In order to assist estimating the performance of the proposed PSO-PID controller, a new time-domain performance criterion function was also defined. Compared with the genetic algorithm (GA), the proposed method was indeed more efficient and robust in improving the step response of an AVR system.
Citations
More filters
TL;DR: This paper presents a detailed overview of the basic concepts of PSO and its variants, and provides a comprehensive survey on the power system applications that have benefited from the powerful nature ofPSO as an optimization technique.
Abstract: Many areas in power systems require solving one or more nonlinear optimization problems. While analytical methods might suffer from slow convergence and the curse of dimensionality, heuristics-based swarm intelligence can be an efficient alternative. Particle swarm optimization (PSO), part of the swarm intelligence family, is known to effectively solve large-scale nonlinear optimization problems. This paper presents a detailed overview of the basic concepts of PSO and its variants. Also, it provides a comprehensive survey on the power system applications that have benefited from the powerful nature of PSO as an optimization technique. For each application, technical details that are required for applying PSO, such as its type, particle formulation (solution representation), and the most efficient fitness functions are also discussed.
2,147 citations
TL;DR: A large number of publications dealing with PSO applications stored in the IEEE Xplore database at the time of writing are categorised.
Abstract: Particle swarm optimisation (PSO) has been enormously successful. Within little more than a decade hundreds of papers have reported successful applications of PSO. In fact, there are so many of them, that it is difficult for PSO practitioners and researchers to have a clear up-to-date vision of what has been done in the area of PSO applications. This brief paper attempts to fill this gap, by categorising a large number of publications dealing with PSO applications stored in the IEEE Xplore database at the time of writing.
709 citations
TL;DR: Application of fractional order PID (FOPID) controller to an automatic voltage regulator (AVR) is presented and it is shown that the proposed FOPID controller can highly improve the system robustness with respect to model uncertainties.
533 citations
01 Sep 2008
TL;DR: A thorough experimental study to show the superiority of the generalization capability of the support vector machine (SVM) approach in the automatic classification of electrocardiogram (ECG) beats and suggest that further substantial improvements in terms of classification accuracy can be achieved by the proposed PSO-SVM classification system.
Abstract: The aim of this paper is twofold. First, we present a thorough experimental study to show the superiority of the generalization capability of the support vector machine (SVM) approach in the automatic classification of electrocardiogram (ECG) beats. Second, we propose a novel classification system based on particle swarm optimization (PSO) to improve the generalization performance of the SVM classifier. For this purpose, we have optimized the SVM classifier design by searching for the best value of the parameters that tune its discriminant function, and upstream by looking for the best subset of features that feed the classifier. The experiments were conducted on the basis of ECG data from the Massachusetts Institute of Technology-Beth Israel Hospital (MIT-BIH) arrhythmia database to classify five kinds of abnormal waveforms and normal beats. In particular, they were organized so as to test the sensitivity of the SVM classifier and that of two reference classifiers used for comparison, i.e., the k-nearest neighbor (kNN) classifier and the radial basis function (RBF) neural network classifier, with respect to the curse of dimensionality and the number of available training beats. The obtained results clearly confirm the superiority of the SVM approach as compared to traditional classifiers, and suggest that further substantial improvements in terms of classification accuracy can be achieved by the proposed PSO-SVM classification system. On an average, over three experiments making use of a different total number of training beats (250, 500, and 750, respectively), the PSO-SVM yielded an overall accuracy of 89.72% on 40438 test beats selected from 20 patient records against 85.98%, 83.70%, and 82.34% for the SVM, the kNN, and the RBF classifiers, respectively.
480 citations
TL;DR: A hybrid approach involving genetic algorithms (GA) and bacterial foraging algorithms for function optimization problems and results clearly illustrate that the proposed approach is very efficient and could easily be extended for other global optimization problems.
468 citations
References
More filters
06 Aug 2002
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
Abstract: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced. The evolution of several paradigms is outlined, and an implementation of one of the paradigms is discussed. Benchmark testing of the paradigm is described, and applications, including nonlinear function optimization and neural network training, are proposed. The relationships between particle swarm optimization and both artificial life and genetic algorithms are described.
35,104 citations
"A particle swarm optimization appro..." refers methods in this paper
...It was developed through simulation of a simplified social system, and has been found to be robust in solving continuous nonlinear optimization problems [ 11 ]–[15]....
[...]
04 May 1998
TL;DR: A new parameter, called inertia weight, is introduced into the original particle swarm optimizer, which resembles a school of flying birds since it adjusts its flying according to its own flying experience and its companions' flying experience.
Abstract: Evolutionary computation techniques, genetic algorithms, evolutionary strategies and genetic programming are motivated by the evolution of nature. A population of individuals, which encode the problem solutions are manipulated according to the rule of survival of the fittest through "genetic" operations, such as mutation, crossover and reproduction. A best solution is evolved through the generations. In contrast to evolutionary computation techniques, Eberhart and Kennedy developed a different algorithm through simulating social behavior (R.C. Eberhart et al., 1996; R.C. Eberhart and J. Kennedy, 1996; J. Kennedy and R.C. Eberhart, 1995; J. Kennedy, 1997). As in other algorithms, a population of individuals exists. This algorithm is called particle swarm optimization (PSO) since it resembles a school of flying birds. In a particle swarm optimizer, instead of using genetic operators, these individuals are "evolved" by cooperation and competition among the individuals themselves through generations. Each particle adjusts its flying according to its own flying experience and its companions' flying experience. We introduce a new parameter, called inertia weight, into the original particle swarm optimizer. Simulations have been done to illustrate the significant and effective impact of this new parameter on the particle swarm optimizer.
9,373 citations
06 Jul 1999
TL;DR: The experimental results show that the PSO is a promising optimization method and a new approach is suggested to improve PSO's performance near the optima, such as using an adaptive inertia weight.
Abstract: We empirically study the performance of the particle swarm optimizer (PSO). Four different benchmark functions with asymmetric initial range settings are selected as testing functions. The experimental results illustrate the advantages and disadvantages of the PSO. Under all the testing cases, the PSO always converges very quickly towards the optimal positions but may slow its convergence speed when it is near a minimum. Nevertheless, the experimental results show that the PSO is a promising optimization method and a new approach is suggested to improve PSO's performance near the optima, such as using an adaptive inertia weight.
3,976 citations
"A particle swarm optimization appro..." refers background in this paper
...A. Features of Particle Swarm Algorithm [10]–[ 13 ]...
[...]
Book•
04 Aug 1998
TL;DR: This is the first text in this area to fully integrate MATLAB and SIMULINK throughout and provides students with an author-developed POWER TOOLBOX DISK organized to perform analyses and explore power system design issues with ease.
Abstract: This text is intended for undergraduates studying power system analysis and design. It gives an introduction to fundamental concepts and modern topics with applications to real-world problems. This is the first text in this area to fully integrate MATLAB and SIMULINK throughout. It also provides students with an author-developed POWER TOOLBOX DISK organized to perform analyses and explore power system design issues with ease.
3,358 citations
Book•
01 Jul 1995
TL;DR: In-depth and updated, Evolutionary Computation shows you how to use simulated evolution to achieve machine intelligence and carefully reviews the "no free lunch theorem" and discusses new theoretical findings that challenge some of the mathematical foundations of simulated evolution.
Abstract: From the Publisher:
In this revised and significantly expanded second edition, distinguished scientist David B. Fogel presents the latest advances in both the theory and practice of evolutionary computation to help you keep pace with developments in this fast-changing field.. "In-depth and updated, Evolutionary Computation shows you how to use simulated evolution to achieve machine intelligence. You will gain current insights into the history of evolutionary computation and the newest theories shaping research. Fogel carefully reviews the "no free lunch theorem" and discusses new theoretical findings that challenge some of the mathematical foundations of simulated evolution. This second edition also presents the latest game-playing techniques that combine evolutionary algorithms with neural networks, including their success in playing competitive checkers. Chapter by chapter, this comprehensive book highlights the relationship between learning and intelligence.. "Evolutionary Computation features an unparalleled integration of history with state-of-the-art theory and practice for engineers, professors, and graduate students of evolutionary computation and computer science who need to keep up-to-date in this developing field.
2,360 citations
"A particle swarm optimization appro..." refers background or methods in this paper
...The results showed that the PSO-PID controller could obtain higher quality solution, indicating the drawbacks of GA method mentioned in [ 10 ] and [14]....
[...]
...A. Features of Particle Swarm Algorithm [ 10 ]–[13]...
[...]
...Moreover, the premature convergence of GA degrades its performance and reduces its search capability [ 10 ]....
[...]
...This degradation in efficiency is apparent in applications with highly epistatic objective functions [i.e., where the parameters being optimized are highly correlated (the crossover and mutation operations cannot ensure better fitness of offspring because chromosomes in the population have similar structures and their average fitness is high toward the end of the evolutionary process)] [ 10 ], [14]....
[...]