Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm.

Slides:

Advertisements

Similar presentations

Algorithm Design Techniques

Advertisements

NEURAL NETWORKS Backpropagation Algorithm

Genetic Algorithms (Evolutionary Computing) Genetic Algorithms are used to try to “evolve” the solution to a problem Generate prototype solutions called.

Exact and heuristics algorithms

Tetris – Genetic Algorithm Presented by, Jeethan & Jun.

Genetic Algorithms By: Anna Scheuler and Aaron Smittle.

Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)

Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.

Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.

1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.

Data Mining Techniques Outline

COMP305. Part II. Genetic Algorithms. Genetic Algorithms.

Genetic algorithms for neural networks An introduction.

Data Mining CS 341, Spring 2007 Genetic Algorithm.

A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.

Genetic Algorithms Can Be Used To Obtain Good Linear Congruential Generators Presented by Ben Sproat.

Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)

Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.

Research Trends in AI Maze Solving using GA Muhammad Younas Hassan Javaid Danish Hussain

Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.

Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.

Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.

國立陽明大學生資學程陳虹瑋. Genetic Algorithm Background Fitness function ……. population selection Cross over mutation Fitness values Random cross over.

Genetic Algorithm.

Automating the Lee Model. Major Components Simulator code –Verifying outputs –Verifying model equations –Graphical User interface Auto-tuning the model.

GENETIC ALGORITHMS AND GENETIC PROGRAMMING Ehsan Khoddam Mohammadi.

An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.

Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.

Integrating Neural Network and Genetic Algorithm to Solve Function Approximation Combined with Optimization Problem Term presentation for CSC7333 Machine.

Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.

SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.

Solving the Concave Cost Supply Scheduling Problem Xia Wang, Univ. of Maryland Bruce Golden, Univ. of Maryland Edward Wasil, American Univ. Presented at.

Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.

Genetic Algorithms Michael J. Watts

Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"

Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.

Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.

EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.

Dünaamiliste süsteemide modelleerimine Identification for control in a nonlinear system world Eduard Petlenkov, Automaatikainstituut, 2013.

Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.

1 Genetic Algorithms and Ant Colony Optimisation.

Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis

 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.

Genetic Algorithms What is a GA Terms and definitions Basic algorithm.

Biologically inspired algorithms BY: Andy Garrett YE Ziyu.

Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]

Eduard Petlenkov, TTÜ automaatikainstituudi dotsent

Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering

D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.

N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.

Neural Networks And Its Applications By Dr. Surya Chitra.

Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.

Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.

Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.

Genetic Algorithms An Evolutionary Approach to Problem Solving.

An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.

Genetic Algorithm(GA)

Genetic Algorithms and Evolutionary Programming A Brief Overview.

 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.

Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.

July 6, 2016Knowledge-Based System, Lecturer # 09 1 Knowledge Based System Lecture #09 Dr. Md. Hasanuzzaman Assistant Professor Department of Computer.

Evolutionary Computation Evolving Neural Network Topologies.

Genetic Algorithm (Knapsack Problem)

Using GA’s to Solve Problems

Bulgarian Academy of Sciences

An evolutionary approach to solving complex problems

Genetic Algorithms CPSC 212 Spring 2004.

CS621: Artificial Intelligence

Genetik algoritm الگوریتم ژنتیک.

EE368 Soft Computing Genetic Algorithms.

Presentation transcript:

Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm

Principles of Genetic Algorithms Initial Population – a set of strings called Chromosomes [ … ] [ … ] … [ … ] Calculation of fitness function, sort Chromosomes and choose the best ones

Principles of Genetic Algorithms Formation of new generation: 2. Mutation[ … ] at random places (~1%) [ … ] “Best Parents” are used in crossover and mutation more frequently 1. Crossover [ … ] [ … ] at random places [ … ] [ … ] 3. “New Blood” – some absolutely new chromosomes

Principles of Genetic Algorithms Initial Population Mutation, Crossover Selection Formation of new generation Repeat until a Chromosome with a best fitness is found

Principles of Genetic Algorithms for selection of Neural Network’s Structure Fitness function – for example, MSE

NARX (Nonlinear Autoregressive Exogenous) model: ANARX (Additive Nonlinear Autoregressive Exogenous) model: or ANARX model

n-th sub-layer 1 st sub-layer is a sigmoid function NN-based ANARX model (NN-ANARX)

NN ANARX model NN-ANARX model ANARX Model based Dynamic Output Feedback Linearization Algorithm

y(t)u(t) Reference signal v(t) Nonlinear System Dynamic Output Feedback Linearization NN-based ANARX model Parameters (W 1, …, W n, C 1, …, C n ) Controller NN-ANARX Model based Control of Nonlinear Systems

A little or no knowledge about structure of the system is given a priori A set of neural networks must be trained to find an optimal structure Quality of the model depends on the choice of initial parameters Quality of the model should be evaluated in the closed loop These problems can be solved using GA. Problems to be solved

GA for structural identification NN-ANARX structure may be easily coded as a gene. Consider an example (custom structure model):

Dynamic controller based on custom structure model Gene:

Fitness function Model structure optimization is based on fitness function consisting of 3 parameters: Error of the closed-loop control system Order of the model Correlation test All of the criteria are normalized

Numerical evaluation of the criteria Correlation between the following three parameters is checked: Further the parameter Q is the mean of the means of the means of cross correlation coefficients computed for three parameters mentioned above. with Evaluation function: