Novel Technique for PID Tuning by Particle Swarm Optimization S. Easter Selvan Sethu Subramanian S. Theban Solomon.

Slides:



Advertisements
Similar presentations
Local optimization technique G.Anuradha. Introduction The evaluation function defines a quality measure score landscape/response surface/fitness landscape.
Advertisements

Particle Swarm Optimization
Since the 1970s that the idea of a general algorithmic framework, which can be applied with relatively few modifications to different optimization problems,
1 Machine Learning: Lecture 10 Unsupervised Learning (Based on Chapter 9 of Nilsson, N., Introduction to Machine Learning, 1996)
Particle Swarm Optimization (PSO)  Kennedy, J., Eberhart, R. C. (1995). Particle swarm optimization. Proc. IEEE International Conference.
Particle Swarm Optimization
Firefly Algorithm By Rasool Tavakoli.
Particle Swarm Optimization (PSO)
LaValle, Steven M. "Rapidly-Exploring Random Trees A Цew Tool for Path Planning." (1998) RRT Navigation.
EMBIO – Cambridge Particle Swarm Optimization applied to Automated Docking Automated docking of a ligand to a macromolecule Particle Swarm Optimization.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
Modified Particle Swarm Algorithm for Decentralized Swarm Agent 2004 IEEE International Conference on Robotic and Biomimetics Dong H. Kim Seiichi Shin.
1 A hybrid particle swarm optimization algorithm for optimal task assignment in distributed system Peng-Yeng Yin and Pei-Pei Wang Department of Information.
1 A Novel Binary Particle Swarm Optimization. 2 Binary PSO- One version In this version of PSO, each solution in the population is a binary string. –Each.
Heuristics for Adaptive Temperature-Aware SoC Test Scheduling Considering Process Variation Nima Aghaee, Zebo Peng, and Petru Eles Embedded Systems Laboratory.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
Differential Evolution Hossein Talebi Hassan Nikoo 1.
Fast Subsequence Matching in Time-Series Databases Christos Faloutsos M. Ranganathan Yannis Manolopoulos Department of Computer Science and ISR University.
Particle Swarm Optimization Algorithms
考慮商品數量折扣之聯合補貨問題 Consider quantity discounts for joint replenishment problem 研究生 : 王聖文 指導教授 : 楊能舒 教授.
Efficient Model Selection for Support Vector Machines
Improved Search for Local Optima in Particle Swarm Optimization May 6, 2015 Huidae Cho Water Resources Engineer, Dewberry Consultants Part-Time Assistant.
Swarm Intelligence 虞台文.
(Particle Swarm Optimisation)
The Particle Swarm Optimization Algorithm Nebojša Trpković 10 th Dec 2010.
1 IE 607 Heuristic Optimization Particle Swarm Optimization.
PSO and ASO Variants/Hybrids/Example Applications & Results Lecture 12 of Biologically Inspired Computing Purpose: Not just to show variants/etc … for.
Topics in Artificial Intelligence By Danny Kovach.
2010 IEEE International Conference on Systems, Man, and Cybernetics (SMC2010) A Hybrid Particle Swarm Optimization Considering Accuracy and Diversity.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Fuzzy Genetic Algorithm
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Particle Swarm Optimization Speaker: Lin, Wei-Kai
Solving of Graph Coloring Problem with Particle Swarm Optimization Amin Fazel Sharif University of Technology Caro Lucas February 2005 Computer Engineering.
Controlling the Behavior of Swarm Systems Zachary Kurtz CMSC 601, 5/4/
Particle Swarm Optimization James Kennedy & Russel C. Eberhart.
Regrouping Particle Swarm Optimization: A New Global Optimization Algorithm with Improved Performance Consistency Across Benchmarks George I. Evers Advisor:
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Particle Swarm Optimization by Dr. Shubhajit Roy Chowdhury Centre for VLSI and Embedded Systems Technology, IIIT Hyderabad.
SwinTop: Optimizing Memory Efficiency of Packet Classification in Network Author: Chen, Chang; Cai, Liangwei; Xiang, Yang; Li, Jun Conference: Communication.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
Faculty of Information Engineering, Shenzhen University Liao Huilian SZU TI-DSPs LAB Aug 27, 2007 Optimizer based on particle swarm optimization and LBG.
Particle Swarm Optimization (PSO)
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Intro. ANN & Fuzzy Systems Lecture 37 Genetic and Random Search Algorithms (2)
Non-parametric Methods for Clustering Continuous and Categorical Data Steven X. Wang Dept. of Math. and Stat. York University May 13, 2010.
Intelligent Database Systems Lab Advisor : Dr. Hsu Graduate : Jian-Lin Kuo Author : Aristidis Likas Nikos Vlassis Jakob J.Verbeek 國立雲林科技大學 National Yunlin.
An gentle introduction to StupidAlgo Library Yi
Breeding Swarms: A GA/PSO Hybrid 簡明昌 Author and Source Author: Matthew Settles and Terence Soule Source: GECCO 2005, p How to get: (\\nclab.csie.nctu.edu.tw\Repository\Journals-
On the Computation of All Global Minimizers Through Particle Swarm Optimization IEEE Transactions On Evolutionary Computation, Vol. 8, No.3, June 2004.
 Introduction  Particle swarm optimization  PSO algorithm  PSO solution update in 2-D  Example.
Swarm Intelligence. Content Overview Swarm Particle Optimization (PSO) – Example Ant Colony Optimization (ACO)
Since the 1970s that the idea of a general algorithmic framework, which can be applied with relatively few modifications to different optimization problems,
Particle Swarm Optimization (2)
Particle Swarm Optimization with Partial Search To Solve TSP
A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems Wei-Neng Chen, Student Member, IEEE, Jun Zhang, Senior Member,
Scientific Research Group in Egypt (SRGE)
Cluster formation based comparison of Genetic algorithm and Particle Swarm Optimization in Wireless Sensor Network Ms.Amita Yadav.
Control engineering and signal processing
Particle Swarm Optimization
PSO -Introduction Proposed by James Kennedy & Russell Eberhart in 1995
آموزش شبکه عصبی با استفاده از روش بهینه سازی PSO
PID controller for improving Max power point tracking system
Basic Design of PID Controller
A weight-incorporated similarity-based clustering ensemble method based on swarm intelligence Yue Ming NJIT#:
Particle swarm optimization
Introduction Swarm Intelligence
现代智能优化算法-粒子群算法 华北电力大学输配电系统研究所 刘自发 2008年3月 1/18/2019
SWARM INTELLIGENCE Swarms
Presentation transcript:

Novel Technique for PID Tuning by Particle Swarm Optimization S. Easter Selvan Sethu Subramanian S. Theban Solomon

PARTICLE : Volume-less individual; conditionally dislodged in search space. SWARMING : Behavior of organisms in search of conducive environment for sustenance. APPLICATION : Tuning PID controller by globally best solution. Introduction

1.Unbiased search for optimal solution. 2.Unifying the clusters in the potential space. 3.Fine search – selection of the fittest particle. Proposed Features in PSO

Feasible set of Kp, Ki, Kd values generated based on Ziegler Nichols method and Nyquist criteria. Solution space populated with particles in random positions. Generation of Solution Space

Each particle dislodged randomly by fixed step size. If cost favorable – proceeds in same direction Else returns to previous position; attempts random directions with increased step size. Initially coarse search; towards end finer search. Unbiased Search

Particles settle in clusters at locations of favorable costs. CASE I : Best particle in major cluster. CASE II : Best particle in minor cluster. Cluster with best particle drags the rest based on Euclidean distance – thereby unifying clusters. Cluster Unification

Particles assume virtual spheres whose radius is distance between best particle and themselves. Particles radially move in search of cost better than best particle’s cost. If better one found - virtual spheres updated. Else search continues until absorbed by best particle. Search terminated when majority absorbed. Selection of Best Particle

Experimental Results

Experimental Results cont.

System Response Comparison Ziegler Nichols MethodPSO Method

Swarm Behavior in PI Controller Surface PlotParticle Settlement

PSO Results Initial PopulationUnbiased Search Result

PSO Results cont. Unification of ClustersBest Particle

80% of tested cases form distinct clusters - faster convergence. Extremely low settling time obtained by PSO compared to Ziegler-Nichols method. Improper valley formation due to cost function leads to slow convergence. Conclusion