Controlling Non linear Multivariable Processes Using Neural Network Based Adaptive PID Controller

DOI : 10.17577/IJERTCON036

Download Full-Text PDF Cite this Publication

Text Only Version

Controlling Non linear Multivariable Processes Using Neural Network Based Adaptive PID Controller

1 A. Dhanalakshmi, 2 J. Brindha, 3 S. Sukambika, 4 S. Aathithya

1Reasearch Scholar, Sathyabama University, Tamil Nadu, India.

2,3,4Assistant Professor, Department of EIE, Panimalar Engineering College, Chennai

Abstract Fault tolerant control of dynamic processes is investigated in this paper using an auto-tuning of Adaptive PID controller. A fault tolerant control scheme is proposed composing an auto-tuning Adaptive PID controller based on an adaptive neural network model. The model is trained online using the Unscented Kalman filter (UKF) algorithm to learn system post- fault dynamics. Based on this model, the Adaptive PID controller adjusts its parameters to compensate the effects of the faults, so that the control performance is improved. The auto-tuning algorithm for the Adaptive PID controller is derived with the Lyapunov method and therefore, the model predicted tracking error is guaranteed to desired point asymptotically.

Keywords – Adaptive NN models; auto-tuning Adaptive PID; Unscented Kalman filter (UKF); fault tolerant control.

  1. INTRODUCTION

    With fast increase in difficulty of modern control systems, the importance of the fault tolerant control (FTC) concept and technology has been appreciated and accepted by industry. Control system stability and reliability are not only vital for some projects where stringent safety conditions apply, e.g., nuclear power stations and passenger airplanes, but also essential for significant productions, since most of present industrial plants are complex and often include a number of subsystems which may balance for the effects of sensor faults and element malfunction.

    This requires solutions that are very costly in both hardware and development attempt. Therefore, FTC is very important from the viewpoint of safety, as well as reduced production costs. FTC offers the ability to avoid accidental process shut downs from simple faults, e.g. in instrumentation and control loops that could develop into production loss or plant failures. Recently, FTC in most real industrial systems are appreciated by hardware redundancy. For example, the majority-voting scheme is used with redundant sensors to cope with sensor faults [1]. However, due to two main limitations of the hardware redundancy, high cost, and taking more space, solutions using analytical redundancy [1] have been investigated over the last two decades.

    There are generally two different approaches using analytical redundancy: 1) passive approaches, and 2) active approaches. Passive approaches use robust control techniques to design closed-loop systems so that it is numb to certain faults, e.g., [2]. In recent times, an elegant design method of passive approach was proposed by Chen et al. [3], in which the linear matrix inequality (LMI) method was used to synthesis the consistent controller. Different faults were formulated as constraints in the method and were considered in the optimal

    design using LMI. While the design example showed the stability and maintenance of suitable system performance, a limitation is that the method is based on an accurate linear state space model and therefore, is not capable of controlling nonlinear processes for which an accurate analytical model is usually not available.

    In addition, because the passive approaches consider fault tolerance in only the stage of controller design without taking adaptation when faults occur, the amplitude of the faults that can be allowable is usually limited. Active approaches use online fault adjustment information and reconfigurable controllers. When a fault is identified using analytical or hardware redundancy, the controller is reconfigured to guarantee the post-fault stability and maintain acceptable performance. Active FTC has been explored using different methods including the feedback linearization [4], control law rescheduling [5], and model following control [6].

    Reconfigurable control against plant component faults has been studied using state feedback, where the feedback gain matrix was designed using linear quadratic regulation method [7], the pseudo inverse method [8] and eigen structure assignment method [9]. However, these studies were also based on linear models so that they are not suitable for nonlinear processes. Model predictive control (MPC) has been employed in FTC [10], [11], where an adjustable objective function was optimized based on a simple linear model. The model was expected to learn the post-fault dynamics if the amplitude of the fault is not too large. The research utilizing this method is active and the models used are extended to nonlinear models.

    Figure 1. Structure of the NN-based Auto-tuning PID control system

  2. STRUCTURE OF FTC SCHEME

    The aim of the FTC is to obtain a control variable to force

    zk W h xk

    (5)

    the process to track the preferred trajectory when the process is not subject to any error, while to keep up the system constancy and to make progress from the performance degradation high- speed when fault occurs in the process. Allowing for that element or organic processes are difficult and their mathematical models are usually unfamiliar, an active fault tolerant control approach is developed in this section.

    where W h R qn1 is the weight matrix connecting the hidden and input layers, xk R n where n = mnu + pny + 1 is the network input vector. Thus x(k) and h(k) are defined by :

    T T

    u y

    xk u k d 1 T ,…,u k d n T ,…, yk 1T ,…, y k n ,1 (6)

    The control design includes two parts, one is using a NN to model the process and the model is made adaptive to hold the dynamics change caused by the fault, another is an auto-tuning PID controller based on the model. When the model captures

    the post-fault dynamics, the PID controller is modified to

    hk

    1 e

    1

    Z 1

    K , …,

    1 e

    1

    Z q

    T

    K ,1

    (7)

    balance the degradation of system stability and performance. The MLP model is online modified with the model calculation error using the EKF algorithm. The modified model is used to calculate process output at next sample time. The prediction is used by the auto-tuning algorithm to derive an optimal control variable.

    In Fig.1 PID controller adapts its parameters in the way that the produced control variable will drive the NN model output to track the desired reference. A recursive auto-tuning algorithm derived using the Lyapunov method will make the optimal control that is guaranteed to minimize a squared tracking error. The wide line between the model used for prediction and that to be adapted indicates that the formation and weights are shared between the two models.

  3. ADAPTIVE NEURAL NETWORK MODEL

    1. NN Model

      To model the system dynamics and also to capture the time-

      with the last entry introducing bias to the hidden layer.

    2. UKF Based Training Algorithm

      UKF Training The UKF algorithm for NN training is similar to that of EKF; again, all the connecting weights are organized as a state vector, but now the state is calculated through unscented transformation [12], [13] and propagated analytically through nonlinear system without the need to evaluate the Jacobian matrix. The generic

      UKF can be summarized as in the following steps.

      STEP 1) Initialization

      w o E w o

      PO E w o w o w o w o T /p>

      (8)

      STEP 2) Calculation of the sigma points

      varying dynamics of the process, an adaptive Multi Layer Perceptron (MLP) network model is developed. The NARX

      o,k1 w k1o

      k

      i

      L k

      model used for this multivariable nonlinear system is

      i,k1 w k1

      L k)Pk1

      0.5

      i

      L k

      y k g u k d 1 ,…,u k d nu ,…, y k 1 ,…, y k n y e k (1)

      where y R p and u R m are the sampled process output

      iL,k1 wk1 L k)Pk1

      iL 0.5

      L k

      (9)

      i

      and input vectors, and ny and nu are the output and input order, d is the input transmission delay, e is the measurement noise and g is the vector valued nonlinear function. Similarly, the

      MLP network model used is :

      where i = 1,2,,L and L is the state dimension. The parameter k is used to control the covariance matrix.

      STEP 3) Time Update

      ykgu k d 1,…,u k d nu ,…, yk 1,…, yk ny ek (2)

      i,k / k1 i,k1 2L

      where y R p is the estimated process output by the NN model and g is an approximated nonlinear function of g . The MLP network with one hidden layer of neurons is

      w k ii,k|k1

      i0

      2L

      T

      Pk i i,k|k1 w k i,k|k1 w k

      (10)

      implemented.

      yk W y hk

      (3)

      i0

      where

      W y R pq1 is the weight matrix connecting

      yi,k|k1 g i,k|k1 , x k

      output and hidden layers, hk R q1 is the hidden layer

      y k i yi,k|k1

      (11)

      2L

      output vector where each entry is transformed from the corresponding entry in z(k) by using a sigmoid activation

      i0

      function as :

      h i k f z i k

      1

      ,

      i = 1, 2, , q (4)

      1 e zi k

      STEP 4) Measurement update

      2L

      Sk i yi,k|k1 y k yi,k|k1 y k T R k

      o,k1

      w

      k1o

      L k

      0.5

      (18)

      k

      i0

      i,k1 w k1 L k)Pk1

      i

      L k

      2L

      T w

      i

      L k)P

      0.5

      G k i i,k|k1 w k yi,k|k1 y k

      (12)

      iL,k1

      k1

      k1 i

      iL

      L k

      i0

      w k w k G k Sk 1 d k y 1

      and at instant k-1 , then the filtering procedure of NN-aided

      UKF can be carried out recursivelyin the similar way ,but now

      k i,k / k1 i,k1 and

      yi,k|k1 g i,k|k1, x k

      are replaced

      k k by f , and yi,k|k1 hxi,k|k1 , respectively.

      Pk P 1 k Sk T

      a x

      i,k1

      w x

      i,k1

    3. NN based UKF algorithm

    We attempt to improve the algorithm in [14] under the framework of UKF and apply the new method to the problem

    of nonlinear filtering. The state evolution equation and observation equation are given as

    The Procedure of applying the UKF algorithm to the adaptive model is given as follows:

    Step 1) Obtain the past process output yk and past control variable u at sample time k to form NN model input vector xk in (4).

    x k1

    f x k

    n k

    (13)

    Step 2) Obtain the current process measurement output

    yk which is used as the training target.

    y k h x k v k

    where nk and vk represent process noise and observation noise, respectively. We denote ek as the error between true model and the a priori known mathematical model fx k , namely e(k)=f(k) – fx k . We can adjust the weighs of the NN through the observation if and only if the observability condition is met. When e(k) g(xk wk ) 0 , the error is well approximated, and the more accurate model becomes the

    sum of f(xk)and the NN approximation, so we have :

    Step 3) Update the error covariance matrix Pk using (10) & (11).

    Step 4) Implement the UKF based training algorithm (13)

    – (18)

    The developed adaptive MLP model is evaluated by modeling the simulated CSTR process and this is described in Section V.

  4. AUTO TUNING FOR ADAPTIVE PID CONTROLLER

In this paper, an adaptive neural model is proposed for the

x k1 f x k gx k , w k

w k1 w k

(14)

multivariable PID controller based on self-learning algorithm. The PID controlled tracking error is evaluated using model

If we represent the augmented state vestors as

T T

k K k

x a x T w , then the above equations(write the equation

prediction and then an optimal set of PID parameters is iteratively approached. Thus, minimum squared tracking error can be obtained. The discrete-time multivariable PID controller is considered as :

no) can be redefined as

x fx

gx , w

k

eT k eT k 1

x a k1 k k k f a x k , w k (15)

u k Kp k

eT k Ki k eT i Kd k

T (19)

k1

w k1 w k

i1

k

Because the observation is only related with the state x, the equation yk h x vk remains unchanged. Now the :

where

eT k R p is the process tracking error defined as

eT k yd k yk

k

estimation of x a based on the new model (15) and the noisy

where yd t R p is the desired trajectory, T is the

k

observation yk hx vk . Once given

sampling time,

Kp R mp ,

Ki R m p

and

o o

o o o o o

x a Ex a

and

Pa Ex a x a x a x a T (16)

K d R m p are PID controller parameter matrices, and m is the number of input. To estimate the optimum PID parameters,

we can get

2La 1

vectors

K p k

, Ki k

3mp

and

Kd k

, a parameter vector

T pid kR

is formulated as :

a x

Tw T

(17)

K k K k K kT

i,k1 i,k1

i,k1

p1 i1 d1

pidk

(20)

(i=0,1,,2La, and La is the dimension of x a ), according to

T

the equation

k Kp k

Kim k

Kdm k

m

where k p j k , k i j k and k d j k denotes the j row in

th

K p k, Ki k and Kd k, j = 1, 2,, m.

Inorder to obtain the optimal control variable in each sample period k, an iterative algorithm is developed which minimizes the objective function of the predictive tracking error. These tuned PID parameters are used at the end of sample period to produce control variable. Here the sample time is expressed as k and i denotes the iterative step within each sample period. Inorder to avoid confusion with the

2 et iT et i et i

T

2 y i K ie i

pid

i pid t

y i

iterative step i, variable at sample time (k) is change to |k in the iterative process, such as pid k pidk .

On predicting pid k, pid i R3mp is used to denote the optimum PID parameters in the iterative process. The PID auto-tuning algorithm is defined as :

pid i 1 pid i pid i pid i Kpid i et i (21)

e t i

2 et iT

pid i

y i

pid i

K pid ie t i

T

K pid i

where K pid i is the gain matrix, e t i R p is the NN

y i

model tracking error and e is the process tracking error.

T

K pid i e t i. (27)

e t i

yd | k

yi

pid i

y i g u i, X k

(22)

where the gain matrix K pid i is given as :

where yd |k R p is the desired output at sample time k,

yi is the NN model output in iterative step i within the

1

y i

T

y i

y i

T 1

K i

K

i

(28)

sample period.

yi is a function of the predicted optimal

pid

pid

i

pid

pid

i

pid

i

t

control variable, ui R m such that :

u i Kpi eT | k Kii Epid | k Kd i

eT | k eT | k 1

(23)

Then

V i

becomes,

V i 2 1 eT i e t

i .

k

T If < 1 is chosen, then

V i is always negative. In the

with

Epid | k

Epidk ej . (24)

j1

design of the gain matrix, < 1 is chosen as the learning rate to

adjust the self-learning speed of the PID parameters. Due to this, the predictive tracking error will converge to zero.

In order to derive the gain matrix in Kpid at each iterative

step i, such that the convergence of the NN model output to the desired process output is guaranteed, a discrete-time Lyapunov function is chosen as follows:

Thus, when the gain matrix K pid iis chosen according to

(28), the PID parameter vector, pid k will asymptotically

V i e t iT

e t i

(25)

converge to the optimal value at each sampling time in the

sense of driving the model tracking error to minimum value.

where is a positive constant and thus, V(i) is positive definite. For V(i) calculation, define et i et i 1 et i . In discrete time operation,

The Tracking performance of Auto tuning PID controller is as shown in figure. 2

pid i

can be approximated by the derivative of

pid iwith respect to i . Thus

et i

pid i

et i

pid

i

i

yd k

y i

pid i

y i

pid i

pid

i Kpid iet i

(26)

Then, the increment of the Lyapunov function, V i is expressed as :

Vi Vi 1 Vi

Figure 2. Tracking performance of Auto tuning PID controller

The PID auto-tuning procedure is as follows:

Step 1) For each sample time k, form the NN model input vector X(k) by obtaining the desired trajectory yd k 1the

past control variable u (k) and the past process output y (k).

Step 2) Implement the PID auto-tuning algorithm given in (22), (28), and (21) in iterative form to predict the optimum PID parameter vector, pid k. The value at the last sample time pid k 1 is assigned to be the initial value

pid 0.

Step 3) Calculate the optimal control variable u i in

  1. W. D. Morse and K. A. Ossman, Model-following reconfigurable flight control system for the AFTI/F-16, J. Guid. Control Dyn., vol. 13, no. 6, pp. 969976, 2014.

  2. D. P. Looze, J. L. Weiss, J. S. Eterno, and N. M. Barrett, An automatic redesign approach for restructurable control systems, IEEE Contr. Syst. Mag., vol. 5, no. 2, pp. 1622, May 2009.

  3. Z. Gao and P. J. Antsaklis, Stability of the pseudo-inverse method for reconfigurable control systems, Int. J. Control, vol. 53, pp. 717729, 2014.

  4. J. Jiang, Design of reconfigurable control systems using eigenstructure assignments, Int. J. Control, vol. 59, no. 2, pp. 395410,2015.

  5. W. K. Son, O. K.Kwon, and M. E. Lee, Fault-tolerant model-based predictive control with application to boiler systems, in Proc. IFAC Symp. SAFEPROCESS, Hull, U.K., 2007, pp. 12401245.

    (23) by applying the obtained pid i

    controller.

    to the PID

  6. J. M. Maciejowski, Modeling and predictive control: enabling

technologies for reconfiguration, in Proc. IFAC Symp. System Structure Control, Oct. 1997, pp. 253258.

Step 4) Calculate the model output, y i and model

tracking error, et i in (22) by applying the obtained ui to the NN model at each iteration step, i.

Step 5) Repeat Step 1 to Step 4 until the NN model tracking error, is less than a pre-specified threshold or a specified bound to the iterative step is reached.

Step 6) Set pid k to be equivalent to pidifinal , and then apply it to the PID controller in the process.

CONCLUSION

The proposed system employs an adaptive PID controller to compensate the fault effects. The convergence of the predicted tracking error for auto-tuning algorithm is derived with Lyapunov method. In UKF algorithm, the post-fault dynamics can be modeled in time and thus, the degradation in the process tracking performance and in system relative stability is quickly recovered. The adaptive NN model is online trained with measurement process input output data and consequently, the effects of sensor faults will also be modeled. Thus, the sensor faults are not tolerable with the developed method. This leads to a process tracking error of the size of the occurred sensor fault. The research work can be undergone on sensor fault tolerance in processes with unknown dynamics. The potential applications include different industrial processes with multivariable and nonlinear dynamics.

REFERENCES

  1. R. J. Patton, P. M. Frank, and R. Clark, Fault Diagnosis in Dynamic Systems : Theory and Application. Englewood Cliffs, NJ: Prentice-Hall, 2005.

  2. M. Tyler and M. Morari, Optimal and robust design of integrated control and diagnostic modules, in Proc. American Control Conf., 2008.

  3. J. Chen, R. J. Patton, and Z. Chen, Active fault tolerant flight controlsystems design using the linear matrix inequality method, Trans. Inst. Meas. Control, vol. 21, no. 2/3, pp. 7784, 2013.

  4. Y. Ochi, Application of feedback linearization method in a digital restructurable flight control system, J. Guid. Control Dyn., vol. 16, no. 1, pp. 111117, 2004.

  5. I. Kaminer, A.M. Pascoal, P. P. Khargonekar, and E. E. Coleman, Avelocity algorithm for the implementation of gain-scheduled controllers, Automatica, vol. 31, no. 8, pp. 11851192, 2014.

  1. J. Julier, K. Uhlmann, and F. Durrant-Whyte, A new approach for filtering nonlinear systems, in Proc. American Control Conf., Seattle, WA, Jun. 2015, pp. 16281632.

  2. J. Julier and K. Uhlmann, A new method for the nonlinear transformation of means and covariances in filters and estimators, IEEE Trans. Autom. Control, vol. 45, no. 3, pp. 477482, Mar. 2000.

  3. R. N. Lobbia, S. C. Stubberud, and M. W. Owen, Adaptive extended Kalman filter using artificial neural networks, Int. J. Smart Eng. Syst. Des., vol. 1, pp. 207221, 2015.

  4. Ronghui Zhan, J. Wan, Neural network-aided adaptive unscented Kalman filter for nonlinear state estimation , IEEE Signal Processing Letters , Vol 13, Issue: 7, July 2006.

Leave a Reply