28.02.2014 Views

The Development of Neural Network Based System Identification ...

The Development of Neural Network Based System Identification ...

The Development of Neural Network Based System Identification ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

102 CHAPTER 4 NEURAL NETWORK BASED SYSTEM IDENTIFICATION<br />

4.3.4 Off-line based <strong>Neural</strong> <strong>Network</strong> Model Estimation<br />

After selecting the model structure, the next step in the system identification process is<br />

to determine the best weights (vector parameters θ) that give the best fit between the<br />

NNARX model and measurement data. This is achieved by minimisation <strong>of</strong> error cost<br />

function. As mentioned in Norgaard [2000], the measure <strong>of</strong> prediction’s closeness to the<br />

true outputs <strong>of</strong> the system is given by mean square error type criterion as:<br />

V N (θ, Z N ) = 1<br />

2N<br />

N∑<br />

t=1<br />

[y (t) − ŷ (t |θ )] 2 = 1<br />

2N<br />

with linear approximation <strong>of</strong> prediction error given by:<br />

N∑<br />

e 2 (t, θ) (4.28)<br />

t=1<br />

e (t, θ) = y (t) − ŷ (t |θ ) (4.29)<br />

where N is the number <strong>of</strong> input-output pairs used for training, y(t) is the real measurement<br />

output <strong>of</strong> the system, ŷ(t|θ) is the predicted output vector and the training<br />

data set is given by Z N = [y(t), u(t)]. For multiple input-output case (n outputs), the<br />

measurement output <strong>of</strong> the system y(t) and predicted output ŷ(t|θ) will became a n × N<br />

matrix which would produced a vector <strong>of</strong> mean square error criterion.<br />

<strong>The</strong> solution involving the quadratic criterion in Equation (4.28) is also known as<br />

ordinary non-linear least squares problem which is a part <strong>of</strong> unconstrained optimisation<br />

study [Norgaard, 2000, S<strong>of</strong>er et al., 2009]. <strong>The</strong> minimisation <strong>of</strong> criterion is carried out<br />

using numerical search procedure starting out from initial guess <strong>of</strong> parameter vector<br />

θ (0) . <strong>The</strong> weights <strong>of</strong> the network are then adjusted according to some training methods<br />

and stopped after error criterion evaluation achieves certain threshold. Typically, most<br />

<strong>of</strong>f-line minimisation iterative schemes have the following general form:<br />

[<br />

θ (i+1) = θ (i) − µ (i) H (i)] −1 )<br />

′<br />

V N<br />

(θ (i) , Z N<br />

(4.30)<br />

where θ (i) is the parameter vector estimation at i th iteration, H (i) is the matrix that<br />

(<br />

modifies the local search direction defined by V ′ N θ (i) )<br />

, Z N and constant µ (i) denotes<br />

(<br />

the step size to assure that V N θ (i) )<br />

, Z N decreases from previous update.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!