## 1. Introduction

Predictive control is a model-based strategy used to calculate the optimal control action, by solving an optimization problem at each sampling interval, in order to maintain the output of the controlled plant close to the desired reference. Model predictive control (MPC) based on linear models is an advanced control technique with many applications in the process industry (Rossiter, 2003). The next natural step is to extend the MPC concept to work with nonlinear models. The use of controllers that take into account the nonlinearities of the plant implies an improvement in the performance of the plant by reducing the impact of the disturbances and improving the tracking capabilities of the control system.

In this chapter, Nonlinear Model Predictive Control (NMPC) is studied as a more applicable approach for optimal control of multivariable processes. In general, a wide range of industrial processes are inherently nonlinear. For such nonlinear systems it is necessary to apply NMPC. Recently, several researchers have developed NMPC algorithms (Martinsen et al., 2004) that work with different types of nonlinear models. Some of these models use empirical data, such as artificial neural networks and fuzzy logic models. The model accuracy is very important in order to provide an efficient and adequate control action. Accurate nonlinear models based on soft computing (fuzzy and neural) techniques, are increasingly being used in model-based control (Mollov et al., 2004).

On the other hand, the mathematical model type, which the modelling algorithm relies on, should be selected. State-space models are usually preferred to transfer functions, because the number of coefficients is substantially reduced, which simplifies the computation; systems instability can be handled; there is no truncation error. Multi-input multi-output (MIMO) systems are modelled easily (Camacho et al., 2004) and numerical conditioning is less important.

A state-space representation of a Takagi-Sugeno type fuzzy-neural model (Ahmed et al., 2010; Petrov et al., 2008) is proposed in the Section 2. This type of models ensures easier description and direct computation of the gradient control vector during the optimization procedure. Identification procedure of the proposed model relies on a training algorithm, which is well-known in the field of artificial neural networks.

Obtaining an accurate model is the first stage of the of the NMPC predictive control strategy. The second stage involves the computation of a future control actions sequence. In order to obtain the control actions, a previously defined optimization problem has to be solved. Different types of objective and optimization algorithms (Fletcher, 2000) can be used in the optimization procedure. Two different approaches for NMPC are proposed in Section 3. They consider the unconstrained and constrained model predictive control problem. Both of the approaches use the proposed Takagi-Sugeno fuzzy-neural predictive model.

The proposed techniques of fuzzy-neural MPC are studied in Section 4, by experimental simulations in Matlab^{®} environment in order to control the levels in a multi tank system (Inteco, 2009). The case study is capable to show how the proposed NMPC algorithms handle multivariable processes control problem.

## 2. Multivariable fuzzy-neural predictive model

The Takagi-Sugeno fuzzy-neural models are powerful modelling tools for a wide class of nonlinear systems. Fuzzy reasoning is capable of handling uncertain and imprecise information while neural networks can learn from samples. Fuzzy-neural networks combine the advantages of both artificial intelligent techniques and incorporate them in adaptive features. Those futures, based on a real time learning algorithm are the main advantage of the fuzzy-neural models.

The importance of the used in MPC strategy models and their adaptive characteristics is obvious. The accuracy of the model determines the accuracy of the control action. The proposed fuzzy-neural model is implemented in a classical NMPC scheme (Fig. 1) as a predictor (Camacho et al., 2004).

In this chapter a nonlinear discrete time state-space implementation is considered to represent the system dynamic:

where *x(k)*
*u(k)*
*y(k)*
*f*_{x} and *f*_{y} can be approximated by Takagi-Sugeno type fuzzy rules in the next form:

(2) |

where *R*_{l} is the *l*^{-th} rule of the rule base. Each rule is represented by an *if-then* conception. The antecedent part of the rules has the following form “*z*_{i}*(k) is M*_{li}” where *z*_{i}*(k)* is an *i*^{-th} linguistic variable (*i*^{-th} model input) and *M*_{li} is a membership function defined by a fuzzy set of the universe of discourse of the input *z*_{i}*.* Note that the input regression vector z*(k)*
*(k)=*[*x(k) u(k)*]^{T}. The consequent part of the rules is a mathematical function of the model inputs and states. A state-space implementation is used in the consequent part of *R*_{l}, where *A*_{l}
*B*_{l}
*C*_{l}
*d*
*D*_{l}

The states in the next sampling time

On the other hand the state-space matrices *A*, *B*, *C*, and *D* for the global state-space plant model could be calculated as a weighted sum of the local matrices *A*_{l}, *B*_{l}, *C*_{l}, and *D*_{l} from the activated fuzzy rules (2):

where *μ*_{yl} upon the *l*^{-th} activated fuzzy rule and *L* is the number of the activated rules at the moment *k*.

Fuzzy implication in the *l*^{-th} rule (2) can be realized by means of a product composition

where *μ*_{ij} specifies the membership degree (Fig. 2) upon the activated *j*^{-th} fuzzy set of the corresponded *i*^{-th} input signal and it is calculated according to the chosen here Gaussian membership function (6) for the *l*^{-th} activated rule:

where *z*_{i} is the current input value of the *i*^{-th} model input, *c*_{Gij} is the centre (position) and *σ*_{ij} is the standard deviation (wide) of the *j*^{-th} membership function (*j=1, 2,.., s*) (Fig.2).

### 2.1. Identification procedure for the fuzzy–neural model

The proposed identification procedure determines the unknown parameters in the Takagi-Sugeno fuzzy model, i.e. the parameters of membership functions, according to their shape and the parameters of the functions *f*_{x} and *f*_{y} in the consequent part of the rules (2). It is realised by a five-layer fuzzy-neural network (Fig. 3). Each of the layers performs typical fuzzy logic strategy operations:

Layer 1. The first layer represents the model inputs through its own input nodes *Z*_{1}, *Z*_{2}, …, *Z*_{p}. The network synaptic weights are set to one, so the model inputs are directly passed through the nodes to the next layer. Neurons here are represented by the elements of the regression vector z*(k)*.

Layer 2. The fuzzification procedure of the input variables is performed in the second layer. The weights in this layer are the parameters of the chosen membership functions. Their number depends on the type and the number of the applied functions. All these parameters *a*_{ij} are adjustable and take part in the premise term of the Takagi-Sugeno type fuzzy rule base (2). In that section the membership functions for each model input variable are represented by Gaussian functions (Fig. 2). Hence, the adjustable parameters *a*_{ij} are the centres *c*_{Gij} and standard deviations *σ*_{ij} of the Gaussian functions (6). The nodes in the second layer of the fuzzy-neural architecture represent the membership degrees *μ*_{ij}*(z*_{i}*)* of the activated membership functions for each model input *z*_{i}*(k)* according to (6)*.* The number of the neurons depends on the number of the model inputs *p* and the number of the membership functions *s* in corresponding fuzzy sets. It is calculated as.

Layer 3. The third layer of the network interprets the fuzzy rule base (2). Each neuron in the third layer has as many inputs as the input regression vector size *p*. They are the corresponding membership degrees for the activated membership functions calculated in the previous layer. Therefore, each node in the third layer represents a fuzzy rule *R*_{l}, defined by Takagi-Sugeno fuzzy model. The outputs of the neurons are the results of the applied fuzzy rule base.

Layer 4. The fourth layer implements the fuzzy implication (5). Weights in this layer are set to one, in case the rule *R*_{l} from the third layer is activated, otherwise weights are zeros.

Layer 5. The last layer (one node layer) represents the defuzzyfication procedure and forms the output of the fuzzy-neural network (3). This layer also contains a set of adjustable parameters – *β*_{l}*.* These are the parameters in the consequent part of Takagi-Sugeno fuzzy model (2). The single node in this layer computes the overall model output signal as the summation of all signals coming from the previous layer.

where

### 2.2. Learning algorithm of the fuzzy–neural model

Two-step gradient learning procedure is used as a learning algorithm of the internal fuzzy-neural model. It is based on minimization of an instant error function *E*_{FNN}. At time *k* the function is obtained from the following equation

where the error *ε*(*k*) is calculated as a difference between the controlled process output *y(k)* and the fuzzy-neural model output *ŷ(k):*

During step one of the procedure, the consequent parameters of Takagi-Sugeno fuzzy rules are calculated according to summary expression (10) (Petrov et al., 2002).

where *η* is a learning rate and *β*_{l} represents an adjustable coefficient *a*_{ij}, *b*_{ij}*, c*_{ij}*, d*_{ij} (11) for the activated fuzzy rule *R*_{l} (2). The coefficients take part in the state matrix *A*_{l}, control matrix *B*_{l} and output matrices *C*_{l} and *D*_{l} of the *l*^{-th} activated rule (Ahmed et al., 2009). The matrices approximate the unknown nonlinear functions *f*_{x} and *f*_{y} according to defined fuzzy rule model (2). The matrix dimensions are specified by the system parameters – numbers of inputs *m*, outputs *q* and states *n* of the system.

In order to find a weight correction for the parameters in the last layer of the proposed fuzzy-neural network the derivative

After the calculation of the partial derivatives, the matrix elements for each matrix of the state-space equations corresponding to the *l*^{-th} activated rule (2) are obtained according to the summary expression (12) (Petrov et al., 2002; Ahmed et al., 2010):

(13) |

The proposed fuzzy-neural architecture allows the use of the previously calculated output error (8) in the next step of the parameters update procedure. The output error *E*_{FNN} is propagated back directly to the second layer, where the second group of adjustable parameters are situated (Fig. 3). Depending on network architecture, the membership degrees calculated in the fourth and the second network layer are related as *μ*_{yl} → *μ*_{ij}. Therefore, the learning rule for the second group adjustable parameters can be done in similar expression as (10):

where the derivative of the output error *E*_{FNN} is calculated by the separate partial derivatives:

The adjustable premise parameters of the fuzzy-neural model are the centre *c*_{Gij} and the deviation *σ*_{ij} of the Gaussian membership function (6). They are combined in the representative parameter a_{ij}, which corresponds to the *i*^{-th} model input and its *j*^{-th} activated fuzzy set. Following the expressions (14) and (15) the parameters are calculated as follows (Petrov et al., 2002; Ahmed et al., 2010):

The proposed identification procedure for the fuzzy-neural model could be summarized in the following steps (Table 1).

## 3. Optimization algorithm of multivariable model predictive control strategy

The model provided by the Takagi-Sugeno type fuzzy-neural network is used to formulate the objective function for the optimization algorithm and to calculate the future control actions. The second stage of the predictive control strategy includes an optimization procedure. It utilizes the obtained results during the first (modelling) stage predictive model of the system. Using the Takagi-Sugeno fuzzy-neural model (3), the optimization algorithm computes the future control actions at each sampling period, by minimizing the typical for MPC strategy (Generalized Predictive Control – GPC) cost function (Akesson, 2006):

where *ŷ(k)*, *r(k)* and *∆u(k)* are the predicted outputs, the reference trajectories, and the predicted control increments at time *k*, respectively. The length of the prediction horizon is *H*_{p}, and the first sample to be included in the horizon is *H*_{w}. The control horizon is given by *H*_{u}.*≥0* and *>0* are weighting matrices representing the relative importance of each controlled and manipulated variable and they are assumed to be constant over the *H*_{p}.

The cost function (18) may be rewritten in a matrix form as follows

where *Y(k), T(k), ∆U(k), Q* and *R* are predicted output, system reference, control variable increment and weighting matrices, respectively,

The linear state-space model used for Takagi-Sugeno fuzzy rules (2) could be represented in the following form:

Based on the state-space matrices *A*, *B*, *C* and *D* (4), the future state variables are calculated sequentially using the set of future control parameters:

(24) |

The predictions of the output *j* steps ahead could be calculated as follows

(25) |

(26) |

The recurrent equation for the output predictions*j*_{p}*= 1, 2,..., H*_{p}
*–1*_{,} is in the next form:

(27) |

The prediction model defined in (27) can be generalized by the following matrix equality

where

All matrices, which take part in the equations above, are derived by the Takagi-Sugeno fuzzy-neural predictive model (4).

It is also possible to define the vector

This vector can be thought as a *tracking error*, in the sense that it is the difference between the future target trajectory and the *free response* of the system, namely the response that would occur over the prediction horizon if no input changes were made, i.e. *∆U(k)=0*. Hence, the quantity of the so called *free*
*response F(k)* is defined as follows

### 3.1. Unconstrained model predictive control

In this section, the study is focused on the optimization problem of the unconstrained nonlinear predictive control with the quadratic cost function (18). The section presents an approximate solution of the problem where the information given by the obtained fuzzy-neural model is used to solve the problem.

The unconstrained optimization problem can be formulated in a matrix form. First, the predictor can be constructed as follows

Second, the cost function (19) can be rewritten as

Hence, substituting the predictive model (25) into expression (26), the cost function of the model predictive optimization problem can be specified as follows:

The minimum of the function *J(∆U)* can be obtained by calculating the input sequence *ΔU* so that *∂J/∂ΔU* = 0:

Then the optimal sequence *ΔU*^{*} is

The input applied to the controlled plant at time *k* is computed according to the receding horizon principle, i.e. the first element from the control sequence *Δu*^{*}*(k)* of the vector *ΔU*^{*} is taken. Then, control signal is calculated from:

It is evident that the expression given by the matrix equation (29) is the same as expression obtained for the generalized predictive control. However, in the GPC formulation the components involved in the calculation of the formula (29) are obtained from a linear model. In the present case the components introduced in this expression are generated by the designed nonlinear fuzzy-neural model. A more rigorous formulation of (29) will be representation of the components as time-variant matrices, as they are shown in the expression (22). In this case the matrix *Θ(k)* and the vectors *Ψ(k), T(k)* are being reconstructed at each sampling time. The vector *Ψ(k)* is obtained by simulating the fuzzy model with the current input *u(k);* the matrix *Θ(k)* is also rebuilt using a method described below.

The proposed method solves the problem of unconstrained MPC. A system of equations is solved at each sampling time *k.* The proposed approach decreases computational burden avoiding the necessity to inverse the gain matrix in (31) at each sampling time *k*.

Applying this method, minimization of the GPC criterion (18) is based on a calculation of the gradient vector of the criterion cost function *J* at the moment *k* subject to the predicted control actions:

Each element of this gradient vector (32) can be calculated using the following derivative matrix equation:

From the above expression (33) it can be seen that it is necessary to obtain two groups of partial derivatives. The first one is

(43) |

For computational simplicity assume that *H*_{w}=0 (18). Then each element of the matrix (34) is calculated by the expressed equations according to the Takagi-Sugeno rules consequents (2). For example the derivatives from first column of the matrix (34) have the following form:

The second group partial derivatives in (33) has the following matrix form:

(48) |

Since

Following this procedure it is possible to calculate the rest column elements of the matrix (34) which belongs to the next gradient vector elements (32). Finally, each element of the gradient-vector (32) could be obtained by the following system of equations:

(50) |

(51) |

(52) |

(53) |

where

The obtained system of equations (41)-(44) can be solved very easily, starting from the last equation (44) and calculating the last control action *u(k+H*_{u}*-1)* first. Then, the procedure can continue with finding the previous control action *u(k+H*_{u}*-2)* from (43). The calculations continue until the whole number of the control actions over the horizon *H*_{u} is obtained. The calculation order of the control actions is very important, since the calculations should contain only known quantities. After that, only the first control action *u(k)* (30) will be used at the moment *k* as an input to the controlled process. The software implementation of the proposed algorithm is realized easily according to the following equations:

(55) |

The proposed unconstrained predictive control algorithm could be summarized in the following steps (Table 2).

### 3.2. Constrained model predictive control

The constrained nonlinear predictive control problem can be described as a problem of finding the “optimal” input sequence to move a dynamic system to a desired state, taking into account the constraints on the inputs and the outputs of the control systems. This section reveals the formulation of the constrained control problem for MPC uses. Essentially, the problem becomes a quadratic programming problem with linear inequality constraints (LICQP). It follows by the nature of the operational constraints, which are usually described by linear inequalities of the control and plant variables.

The problem of nonlinear constrained predictive control is formulated as a nonlinear quadratic optimization problem. By means of local linearization (20) the problem can be solved using QP. That way the solution to the linear constrained predictive control problem is obtained. At each sampling time the LICQP is solved with new parameters, which are obtained by the Takagi-Sugeno fuzzy-neural model. An active set method is used for solving the constructed quadratic programming problem.

#### 3.2.1. Constraint types in model predictive control

The operational constraints may be classified in three major types according to the type of the system variables, which they are imposed on. The first two types of constraints deal with the control variable incremental variation ∆*u(k)* and control variable *u(k)*. The third type is concerned with output *y(k)* or state variable *x(k)* constraints.

Related to the origin model predictive control problem, the constraints are expressed in a set of linear equations. All types of constraints are taken into consideration for each moving horizon window.

Where

Therefore, for multi-input case the number of the constraints for the change of the control variable *∆u(k)* is *m×N*_{u}*.* Similarly, the number of the constraints for the control variable amplitude is also *m×N*_{u} and for the output constraints it is *q×N*_{p.}

#### 3.2.2. Quadratic programming in use of constrained MPC

Since the cost function *J(k)* (19) is quadratic and the constraints are linear inequalities, the problem of finding an optimal predictive control becomes one of finding an optimal solution to a standard quadratic programming problem with linear inequality constraints

where *H* and *f* are the Hessian and the gradient of the Lagrange function, *x* is the decision variable. Constraints on the QP problem (50) are specified by *Ax ≤ b* according to (49).

The Lagrange function is defined as follows

,where *λ*_{i} are the Lagrange multipliers, *a*_{i} are the constraints on the decision variable *x*, *N* is the number of the constraints considered in the optimization problem.

Several algorithms for constrained optimization are described in (Fletcher, 2000). In this chapter a primal active set method is used. The idea of active set method is to define a set *S* of constraints at each step of algorithm. The constraints in this active set are regarded as equalities whilst the rest are temporarily disregarded and the method adjusts the set in order to identify the correct active constraints on the solution to (52)

At iteration *k* a feasible point *x*(*k*) is known which satisfies the active constraints as equalities. Each iteration attempts to locate a solution to an equality problem (EP) in which only the active constraints occur. This is most conveniently performed by shifting the origin to *x*(*k*) and looking for a correction *δ*(*k*) which solves

where *f(k)* is defined by *f(k)* =*f + Hx*(*k*) and is *δ*(*k*) is feasible with regard to the constraints not included in *S*, then the feasible point in next iteration is taken as *x*(*k+ 1*) = *x*(*k*) + *δ*(*k*). If not, a line search is made in the direction of *δ*(*k*) to find the best feasible point. A constraint is active if the Lagrange multipliers *λ*_{i}
*≥ 0,* i.e. it is at the boundary of the feasible region defined by the constraints. On the other hand, if there exist *λ*_{i}
*< 0,* the constraint is not active. In this case the constraint is relaxed from the active constraints set *S* and the algorithm continues as before by solving the resulting equality constraint problem (53). If there is more than one constraint with corresponding*λ*_{i}
*< 0,* then the

The QP, described in that way, is used to provide numerical solutions in constrained MPC problem.

#### 3.2.3. Design the constrained model predictive problem

The fuzzy-neural identification procedure from the Section 2 provides the state-space matrices, which are needed to construct the constrained model predictive control optimization problem.

Similarly to the unconstrained model predictive control approach, the cost function (18) can be specified by the prediction expressions (22) and (23).

(66) |

Assuming that

the cost function for the model predictive optimization problem can be specified as follow

The problem of minimizing the cost function (55) is a quadratic programming problem. If the Hessian matrix *H* is positive definite, the problem is convex (Fletcher, 2000). Then the solution is given by the closed form

The constraints (49) on the cost function may be rewritten in terms of *∆U(k).*

where *I*_{m}

All types of constraints are combined in one expression as follows

(72) |

where *I*

Finally, following the definition of the LIQP (50), the model predictive control in presence of constraints is proposed as finding the parameter vector *∆U* that minimizes (55) subject to the inequality constraints (58).

In (59) the constraints expression (58) has been denoted by Ω*∆U ≤*
*ω*, where Ω is a matrix with number of rows equal to the dimension of *ω* and number of columns equal to the dimension of *∆U.* In case that the constraints are fully imposed, the dimension of *ω* is equal to *4×m×N*_{u}
*+ 2×q×N*_{p}*,* where *m* is the number of system inputs and *q* is the number of outputs. In general, the total number of constraints is greater than the dimension of the *∆U.* The dimension of *ω* represents the number of constraints.

The proposed model predictive control algorithm can be summarized in the following steps (Table 3).

At each sampling time, LIQP (59) is solved with new parameters. The Hessian and the Lagrangian are constructed by the state-space matrices *A(k),*
*B(k),*
*C(k)* and *D(k)* (4) obtained during the identification procedure (Table 1). The problem of nonlinear constrained predictive control is formulated as a nonlinear quadratic optimization problem. By means of local linearization a relaxation can be obtained and the problem can be solved using quadratic programming. This is the solution of the linear constrained predictive control problem (Espinosa et al., 2005).

## 4. Fuzzy-neural model predictive control of a multi tank system. Case study

The case study is implemented in MATLAB/Simulink^{®} environment with Inteco^{®} Multi tank system. The Inteco^{®} Multi tank System (Fig. 4) comprises from three separate tanks fitted with drain valves (Inteco, 2009). The additional tank mounted in the base of the set-up acts as a water reservoir for the system. The top (first) tank has a constant cross section, while others are conical or spherical, so they are with variable cross sections. This causes the main nonlinearities in the system. A variable speed pump is used to fill the upper tank. The liquid outflows the tanks by the gravity. The tank valves act as flow resistors *C*_{1}, *C*_{2}, *C*_{3}. The area ratio of the valves is controlled and can be used to vary the outflow characteristic. Each tank is equipped with a level sensor *PS*_{1}, *PS*_{2}, *PS*_{3} based on hydraulic pressure measurement.

The linearized dynamical model of the triple tank system could be described by the linear state-space equations (2) where the matrices *A*, *B*, *C* and *D* are as follow (Petrov et al., 2008).

(74) |

The parameters *a*_{1}*, a*_{2} and a_{3} are flow coefficients for each tank of the model. The described linearized state-space model is used as an initial model for the training process of the fuzzy-neural model during the experiments.

### 4.1. Description of the multi tank system as a multivariable controlled process

Liquid levels *Н*_{1}*, Н*_{2}*, Н*_{3} in the tanks are the state variables of the system (Fig. 4). The Inteco Multi Tank system has four controlled inputs: liquid inflow *q* and valves settings *C*_{1}*, C*_{2}*, C*_{3}*.* Therefore, several models of the tanks system can be analyzed (Fig. 5), classified as pump-controlled system, valve-controlled system and pump/valve controlled system (Inteco, 2009).

In this case study a multi-input multi-output (MIMO) configuration of the Inteco Multi Tank system is used (Fig. 5). This corresponds to the linearized state-space model (60). Several issues have been recognized as causes of additional nonlinearities in plant dynamics:

nonlinearities (smooth and nonsmooth) caused by shapes of tanks;

saturation-type nonlinearities, introduced by maximum or minimum level allowed in tanks;

nonlinearities introduced by valve geometry and flow dynamics;

nonlinearities introduced by pump and valves input/output characteristic curve.

The simulation results have been obtained with random generated set points and following initial conditions (Table 4):

Figures below show typical results for level control problem. The reference value for each tank is changed consequently in different time. The proposed fuzzy-neural identification procedure ensures the matrices for the optimization problem of model predictive control at each sampling time *T*_{s}. The plant modelling process during the unconstrained and constrained MPC experiments are shown in Fig. 6 and Fig. 9, respectively.

### 4.2. Experimental results with unconstrained model predictive control

The proposed unconstrained model predictive control algorithm (Table 2) with the Takagi-Sugeno fuzzy-neural model as a predictor has been applied to the level control problem. The experiments have been implemented with the parameters in Table 4. The weighting matrices are specified as follow: *k=0*.

The next two figures - Fig. 7 and Fig. 8, show typical results regarding level control, where the references for *H*_{1}, *H*_{2} and *H*_{3} are changed consequently in different time. The change of every level reference behaves as a system disturbance for the other system outputs (levels). It is evident that the applied model predictive controller is capable to compensate these disturbances.

### 4.3. Experimental results with fuzzy-neural constrained predictive control

The experiments with the proposed constrained model predictive control algorithm (Table 3) have been made with level references close to the system outputs constraints. The weighting matrices in GPC cost function (19) are specified as *.* System identification during the experiment is shown on Fig. 9. The proposed identification procedure uses the linearized model (60) of the Multi tank system as an initial condition.

The proposed constrained fuzzy-neural model predictive control algorithm provides an adequate system response as it can be seen on Fig. 10 and Fig. 11. The references are achieved

without violating the operational constraints specified in Table 4. Similarly to the unconstrained case, the Takagi-Sugeno type fuzzy-neural model provides the state-space matrices *A, B* and *C* (the system is strictly proper, i.e. *D*=0) for the optimization procedure of the model predictive control approach. Therefore, the LIQP problem is constructed with “fresh” parameters at each sampling time and improves the adaptive features of the applied model predictive controller. It can be seen on the next figures that the disturbances, which are consequences of a sudden change of the level references, are compensated in short time without violating the proper system work.

## 5. Conclusions

This chapter has presented an effective approach to fuzzy model-based control. The effective modelling and identification techniques, based on fuzzy structures, combined with model predictive control strategy result in effective control for nonlinear MIMO plants. The goal was to design a new control strategy - simple in realization for designer and simple in implementation for the end user of the control systems.

The idea of using fuzzy-neural models for nonlinear system identification is not new, although more applications are necessary to demonstrate its capabilities in nonlinear identification and prediction. By implementing this idea to state-space representation of control systems, it is possible to achieve a powerful model of nonlinear plants or processes. Such models can be embedded into a predictive control scheme. State-space model of the system allows constructing the optimization problem, as a quadratic programming problem. It is important to note that the model predictive control approach has one major advantage – the ability to solve the control problem taking into consideration the operational constraints on the system.

This chapter includes two simple control algorithms with their respective derivations. They represent control strategies, based on the estimated fuzzy-neural predictive model. The two- stage learning gradient procedure is the main advantage of the proposed identification procedure. It is capable to model nonlinearities in real-time and provides an accurate model for MPC optimization procedure at each sampling time.

The proposed consequent solution for unconstrained MPC problem is the main contribution for the predictive optimization task. On the other hand, extraction of a “local” linear model, obtained from the inference process of a Takagi–Sugeno fuzzy model allows treating the nonlinear optimization problem in presence of constraints as an LIQP.

The model predictive control scheme is employed to reduce structural response of the laboratory system - multi tank system. The inherent instability of the system makes it difficult for modelling and control. Model predictive control is successfully applied to the studied multi tank system, which represents a multivariable controlled process. Adaptation of the applied fuzzy-neural internal model is the most common way of dealing with plant’s nonlinearities. The results show that the controlled levels have a good performance, following closely the references and compensating the disturbances.

The contribution of the proposed approach using Takagi–Sugeno fuzzy model is the capacity to exploit the information given directly by the Takagi–Sugeno fuzzy model. This approach is very attractive for systems from high order, as no simulation is needed to obtain the parameters for solving the optimization task. The model’s state-space matrices can be generated directly from the inference of the fuzzy system. The use of this approach is very attractive to the industry for practical reasons related with the capacity of this model structure to combine local models identified in experiments around the different operating points.