principles of genetic algorithms

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

Upload: keisha

Post on 06-Jan-2016

34 views

Category:

Documents


3 download

DESCRIPTION

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 C hromosomes. [0 1 0 1 1 0 1 0 … 0 1 1 1 0 1] [0 0 0 0 1 1 1 0 … 1 1 0 1 0 1] … - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Principles of Genetic Algorithms

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

Page 2: Principles of Genetic Algorithms

Principles of Genetic Algorithms

Initial Population – a set of strings called Chromosomes

[0 1 0 1 1 0 1 0 … 0 1 1 1 0 1][0 0 0 0 1 1 1 0 … 1 1 0 1 0 1]…[0 1 0 0 0 0 1 0 … 1 1 1 1 0 1]

Calculation of fitness function, sort Chromosomes and choose the best ones

Page 3: Principles of Genetic Algorithms

Principles of Genetic AlgorithmsFormation of new generation:

2. Mutation [0 1 1 1 1 0 1 0 … 0 1 1 1 0 1]

at random places (~1%)

[0 1 0 1 1 0 0 0 … 0 1 1 1 0 1]“Best Parents” are used in crossover and mutation more frequently

1. Crossover[0 1 0 1 1 0 1 0 … 0 1 0 1 0 1][1 0 0 0 0 1 1 0 … 1 0 1 1 1 1]

at random places

[0 1 0 1 1 0 1 0 … 0 0 1 1 1 1][1 0 0 0 0 1 1 0 … 1 1 0 1 0 1]

3. “New Blood” – some absolutely new chromosomes

Page 4: Principles of Genetic Algorithms

Principles of Genetic Algorithms

Initial Population

Mutation, Crossover

Selection

Formation of new generation

Repeat until a Chromosome with a best fitness is found

Page 5: Principles of Genetic Algorithms

Principles of Genetic Algorithms for selection of Neural Network’s Structure

Fitness function – for example, MSE

Page 6: Principles of Genetic Algorithms

))1(,),1(),(),1(,),1(),(()( ntututuntytytyfnty

NARX (Nonlinear Autoregressive Exogenous) model:

))1(),1(())1(),1(())(),(()( 21 ntuntyftutyftutyfnty nANARX (Additive Nonlinear Autoregressive Exogenous) model:

or

n

ii ituityfnty

1

))1(),1(()(

ANARX model

Page 7: Principles of Genetic Algorithms

n-th sub-layer

1st sub-layer

n

i

Tiii ituityWCnty

1

)1(),1()(

i i

is a sigmoid functioni

NN-based ANARX model (NN-ANARX)

Page 8: Principles of Genetic Algorithms

)(),()()1(

)(),()()1(

)(),()()1(

)()(),(

1

112

221

11

tutyftvt

tutyftt

tutyftt

ttutyfF

nn

nnn

NN

Tnnnn

Tnnnnn

T

T

tutyWCtvt

tutyWCtt

tutyWCtt

ttutyWCF

)(),()()1(

)(),()()1(

)(),()()1(

)()(),(

1

11112

22221

1111

n

ii ituityfnty

1

))1(),1(()(

ANARX model NN-ANARX model

n

i

Tiii ituityWCnty

1

)1(),1()(

ANARX Model based Dynamic Output Feedback Linearization Algorithm

)()( tvnty

Page 9: Principles of Genetic Algorithms

y(t)u(t)

Reference signal v(t)

Nonlinear SystemDynamic Output

Feedback Linearization

NN-based ANARX model

Parameters (W1, …, Wn, C1, …, Cn)

Controller

NN-ANARX Model based Control of Nonlinear Systems

Page 10: Principles of Genetic Algorithms

• 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

Page 11: Principles of Genetic Algorithms

GA for structural identification

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

Page 12: Principles of Genetic Algorithms

Dynamic controller based on custom structure model

Gene:

Page 13: Principles of Genetic Algorithms

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

Page 14: Principles of Genetic Algorithms

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:

𝑒=1−𝑒−𝑘∙𝑚𝑠𝑒

�̂�𝑖=¿

𝑜𝑖

‖𝑜‖¿