• The TP model transformation transforms a given qLPV model into a (tensor product type) polytopic form, irrespective of whether the model is given in the form of analytical equations resulting from physical considerations, or as an outcome of soft computing based identification techniques (such as neural networks or fuzzy logic based methods, or as a result of a black-box identification).
• Further the TP model transformation is capable of manipulating the convex hull defined by the polytopic form that is a necessary step in polytopic qLPV model-based control analysis and design theories.

Linear Parameter-Varying (LPV) state-space model

${\displaystyle {\begin{pmatrix}{\mathbf {\dot {x}} }(t)\\{\mathbf {y} }(t)\end{pmatrix}}={\mathbf {S} }({\mathbf {p} }(t)){\begin{pmatrix}{\mathbf {x} }(t)\\{\mathbf {u} }(t)\end{pmatrix}},}$ 

with input ${\displaystyle {\mathbf {u} }(t)}$ , output ${\displaystyle {\mathbf {y} }(t)}$  and state vector ${\displaystyle {\mathbf {x} }(t)}$ . The system matrix ${\displaystyle {\mathbf {S} }({\mathbf {p} }(t))\in \mathbb {R} ^{L_{1}\times L_{2}}}$  is a parameter-varying object, where ${\displaystyle {\mathbf {p} }(t)\in \Omega }$  is a time varying ${\displaystyle N}$ -dimensional parameter vector which is an element of closed hypercube ${\displaystyle \Omega =[a_{1},b_{1}]\times [a_{2},b_{2}]\times \cdots \times [a_{N},b_{N}]\subset \mathbb {R} ^{N}}$ . As a matter of fact, further parameter dependent channels can be inserted to ${\displaystyle {\mathbf {S} }({\mathbf {p} }(t))}$  that represent various control performance requirements.

quasi Linear Parameter-Varying (qLPV) state-space model

${\displaystyle {\mathbf {p} }(t)}$  in the above LPV model can also include some elements of the state vector ${\displaystyle {\mathbf {x} }(t)}$ , and, hence this model belongs to the class of non-linear systems, and is also referred to as a quasi LPV (qLPV) model.

TP type polytopic Linear Parameter-Varying (LPV) state-space model

${\displaystyle {\begin{pmatrix}{\mathbf {\dot {x}} }(t)\\{\mathbf {y} }(t)\end{pmatrix}}={\mathcal {S}}\boxtimes _{n=1}^{N}\mathbf {w} _{n}(p_{n}(t)){\begin{pmatrix}{\mathbf {x} }(t)\\{\mathbf {u} }(t)\end{pmatrix}},}$ 

with input ${\displaystyle {\mathbf {u} }(t)}$ , output ${\displaystyle {\mathbf {y} }(t)}$  and state vector ${\displaystyle {\mathbf {x} }(t)}$ . The system matrix ${\displaystyle {\mathbf {S} }({\mathbf {p} }(t))={\mathcal {S}}\boxtimes _{n=1}^{N}\mathbf {w} (p_{n}(t))\in \mathbb {R} ^{L_{1}\times L_{2}}}$  is a parameter-varying object, where ${\displaystyle {\mathbf {p} }(t)\in \Omega }$  is a time varying ${\displaystyle N}$ -dimensional parameter vector which is an element of closed hypercube ${\displaystyle \Omega =[a_{1},b_{1}]\times [a_{2},b_{2}]\times \cdots \times [a_{N},b_{N}]\subset \mathbb {R} ^{N}}$ , and the weighting functions ${\displaystyle w_{n,i_{n}}(p_{n}(t))\in [0,1]}$  are the elements of vector ${\displaystyle \mathbf {w} _{n}(p_{n}(t))}$ . Core tensor contains elements ${\displaystyle \mathbf {S} _{i_{1},i_{2},\ldots ,i_{N}}}$  which are the vertexes of the system. As a matter of fact, further parameter dependent channels can be inserted to ${\displaystyle {\mathbf {S} }({\mathbf {p} }(t))}$  that represent various control performance requirements. Here

${\displaystyle \forall n:\sum _{i_{n}=1}^{I_{n}}w_{n,i_{n}}(p_{n}(t))=1.}$  and ${\displaystyle w_{n,i_{n}}(p_{n}(t))\in [0,1].}$ 

This means that ${\displaystyle \mathbf {S} ({\mathbf {p} }(t))}$  is within the vertexes ${\displaystyle \mathbf {S} _{i_{1},i_{2},\ldots ,i_{N}}}$  of the system (within the convex hull defined by the vertexes) for all ${\displaystyle \mathbf {p} (t)\in \Omega }$ . Note that the TP type polytopic model can always be given in the form

${\displaystyle \mathbf {S} (\mathbf {p} (t))=\sum _{r=1}^{R}\mathbf {S} _{r}w_{r}(\mathbf {p} (t)),}$ 

where the vertexes are the same as in the TP type polytopic form and the multi variable weighting functions are the product of the one variable weighting functions according to the TP type polytopic form, and r is the linear index equivalent of the multi-linear indexing ${\displaystyle i_{1},i_{2},\ldots i_{N}}$ .

TP model transformation for qLPV models

Assume a given qLPV model ${\displaystyle \mathbf {S} (\mathbf {p} (t))}$ , where ${\displaystyle \mathbf {p} (t)\in \Omega \subset R^{N}}$ , whose TP polytopic structure may be unknown (e.g. it is given by neural networks). The TP model transformation determines its TP polytopic structure as

${\displaystyle \mathbf {S} (\mathbf {p} (t))={\mathcal {S}}\boxtimes _{n=1}^{N}\mathbf {w} _{n}(p_{n}(t))}$ ,

namely it generates core tensor ${\displaystyle {\mathcal {S}}}$  and weighting functions of ${\displaystyle \mathbf {w} _{n}(p_{n}(t))}$  for all ${\displaystyle n=1\ldots N}$ . Its free MATLAB implementation is downloadable at [3] or at MATLAB Central [4].

If the given model does not have (finite element) TP polytopic structure, then the TP model transformation determines its approximation:

${\displaystyle \mathbf {S} (\mathbf {p} (t))\approx {\mathcal {S}}\boxtimes _{n=1}^{N}\mathbf {w} _{n}(p_{n}(t)),}$ 

where trade-off is offered by the TP model transformation between complexity (number of vertexes stored in the core tensor or the number of weighting functions) and the approximation accuracy.^[10] The TP model can be generated according to various constrains. Typical TP models generated by the TP model transformation are:

• HOSVD canonical form of qLPV models,
• Various kinds of TP type polytopic form (this feature is very important in control performance optimization).

Key methodology

Since the TP type polytopic model is a subset of the polytopic model representations, the analysis and design methodologies developed for polytopic representations are applicable for the TP type polytopic models as well. One typical way is to search the nonlinear controller in the form:

${\displaystyle u=-\mathbf {F} (\mathbf {p} (t))\mathbf {x} (t)=-\sum _{r=1}^{R}F_{r}w_{r}(\mathbf {p} (t))\mathbf {x} (t),}$ 

where the vertexes ${\displaystyle \mathbf {F} _{r}}$  of the controller is calculated from ${\displaystyle \mathbf {S} _{r}}$ . Typically, the vertexes ${\displaystyle \mathbf {S} _{r}}$  are substituted into Linear Matrix Inequalities in order to determine ${\displaystyle \mathbf {F} _{r}}$ .

In TP type polytopic form the controller is:

${\displaystyle u=-\mathbf {F} (\mathbf {p} (t))\mathbf {x} (t)=-{\mathcal {F}}\boxtimes _{n=1}^{N}\mathbf {w} _{n}(p_{n}(t))\mathbf {x} (t),}$ 

where the vertexes ${\displaystyle \mathbf {F} _{i_{1},i_{2},\ldots ,i_{N}}}$  stored in the core tensor ${\displaystyle {\mathcal {F}}}$  are determined from the vertexes ${\displaystyle \mathbf {S} _{i_{1},i_{2},\ldots ,i_{N}}}$  stored in ${\displaystyle {\mathcal {S}}}$ . Note that the polytopic observer or other components can be generated in similar way, such as these vertexes are also generated from ${\displaystyle {\mathcal {S}}}$ .

Convex hull manipulation based optimization

The polytopic representation of a given qLPV model is not invariant. I.e. a given ${\displaystyle \mathbf {S} (\mathbf {p} (t))}$  has ${\displaystyle Z=\infty }$  number of different representation as:

${\displaystyle \mathbf {S} (\mathbf {p} (t))={\mathcal {S}}_{z}\boxtimes _{n=1}^{N}\mathbf {w} _{z,n}(p_{n}(t)),}$ 

where ${\displaystyle z=1\ldots Z}$ . In order to generate an optimal control of the given model ${\displaystyle \mathbf {S} (\mathbf {p} (t))}$  we apply, for instance LMIs. Thus, if we apply the selected LMIs to the above polytopic model we arrive at:

${\displaystyle u_{z}=-\mathbf {F} _{z}(\mathbf {p} (t))\mathbf {x} (t)=-{\mathcal {F}}_{z}\boxtimes _{n=1}^{N}\mathbf {w} _{z,n}(p_{n}(t))\mathbf {x} (t).}$ 

Since the LMIs realize a non-linear mapping between the vertexes in ${\displaystyle {\mathcal {S}}}$  and ${\displaystyle {\mathcal {F}}}$  we may find very different controllers for each ${\displaystyle z=1\ldots Z}$ . This means that we have ${\displaystyle Z}$  different number of "optimal" controllers to the same system ${\displaystyle \mathbf {S} (\mathbf {p} (t))}$ . Thus, the question is: which one of the "optimal" controllers is really the optimal one. The TP model transformation let us to manipulate the weighting functions systematically that is equivalent to the manipulation of the vertexes. The geometrical meaning of this manipulation is the manipulation of the convex hull defined by the vertexes. We can easily demonstrate the following facts:

• Tightening the convex hull typically decreases the conservativeness of the solution, so as may lead to better control performance. For instance, if we have a polytopic representation

${\displaystyle \mathbf {S} (\mathbf {p} (t))={\mathcal {S}}\boxtimes _{n=1}^{N}\mathbf {w} _{n}(p_{n}(t)),}$ 

of a given model ${\displaystyle \mathbf {S} (\mathbf {p} (t))}$ , then we can generate a controller as

${\displaystyle u=-{\mathcal {F}}\boxtimes _{n=1}^{N}\mathbf {w} _{n}(p_{n}(t))\mathbf {x} (t),}$ 

then we solved the control problem of all systems ${\displaystyle k=1\ldots K=\infty }$  that can be given by the same vertexes, but with different weighting functions as:

${\displaystyle \mathbf {S} _{k}(\mathbf {p} (t))={\mathcal {S}}\boxtimes _{n=1}^{N}\mathbf {w} _{k,n}(p_{n}(t)),}$ 

where

${\displaystyle u_{k}=-{\mathcal {F}}\boxtimes _{n=1}^{N}\mathbf {w} _{k,n}(p_{n}(t))\mathbf {x} (t).}$ 

If one of these systems are very hardly controllable (or even uncontrollable) then we arrive at a very conservative solution (or unfeasible LMIs). Therefore, we expect that during tightening the convex hull we exclude such problematic systems.

• It can also be easily demonstrated that the observer design is typically needs large convex hull. So, as when we design controller and observer we need to find the optimal convex hull between the tight one and the large one. Same papers also demonstrate that using different convex hulls (if the separation principal is applicable) for observer and controller may lead to even better solution.

• It can be executed uniformly (irrespective of whether the model is given in the form of analytical equations) resulting from physical considerations, or as an outcome of soft computing based identification techniques (such as neural networks or fuzzy logic based methods, or as a result of a black-box identification), without analytical interaction, within a reasonable amount of time. Thus, the transformation replaces the analytical and in many cases complex and not obvious conversions to numerical, tractable, straightforward operations that can be carried out in a routine fashion.
• It generates the HOSVD-based canonical form of qLPV models, which is a unique representation. This form extracts the unique structure of a given qLPV model in the same sense as the HOSVD does for tensors and matrices, in a way such that:

• the number of LTI components are minimized;
• the weighting functions are one variable functions of the parameter vector in an orthonormed system for each parameter (singular functions);
• the LTI components (vertex components) are also in orthogonal positions;
• the LTI systems and the weighting functions are ordered according to the higher-order singular values of the parameter vector;
• it has a unique form (except for some special cases);
• introduces and defines the rank of the qLPV model by the dimensions of the parameter vector;

• The core step of the TP model transformation was extended to generate different types of convex polytopic models, in order to focus on the systematic (numerical and automatic) modification of the convex hull instead of developing new LMI equations for feasible controller design (this is the widely adopted approach). It is worth noting that both the TP model transformation and the LMI-based control design methods are numerically executable one after the other, and this makes the resolution of a wide class of problems possible in a straightforward and tractable, numerical way.
• Based on the higher-order singular values (which express the rank properties of the given qLPV model, see above, for each element of the parameter vector in ${\displaystyle L_{2}}$  norm), the TP model transformation offers a trade-off between the complexity of the TP model (polytopic form),^[10] hence, the LMI design and the accuracy of the resulting TP model.
• The TP model transformation is executed before utilizing the LMI design. This means that when we start the LMI design we already have the global weighting functions and during control we do not need to determine a local weighting of the LTI systems for feedback gains to compute the control value at every point of the hyperspace the system should go through. Having predefined continuous weighting functions also ensures that there is no friction in the weighting during control.