Mathematical Modeling, Analysis, and Advanced Control of Complex Dynamical SystemsView this Special Issue
Research Article | Open Access
Guangbin Cai, Changhua Hu, Baojuan Yin, Huafeng He, Xiaojun Han, "Gain-Scheduled Controller Synthesis for Continuous-Time Polytopic LPV Systems", Mathematical Problems in Engineering, vol. 2014, Article ID 972624, 14 pages, 2014. https://doi.org/10.1155/2014/972624
Gain-Scheduled Controller Synthesis for Continuous-Time Polytopic LPV Systems
This paper is concerned with the problem of gain-scheduled controller synthesis for continuous-time linear parameter-varying systems. In this problem, the system matrices in the state-space form are polytopic and patameterized and the admissible values of the parameters are assumed to be measurable on-line in a polytope space. By employing a basis-parameter-dependent Lyapunov function and introducing some slack variables to the well-established performance conditions, sufficient conditions for the existence of the desired gain-scheduled state feedback and dynamic output feedback controllers are established in terms of parameterized linear matrix inequalities. Based on the polytopic characteristic of the dependent parameters and a convexification method, the corresponding controller synthesis problem is then cast into finite-dimensional convex optimization problem which can be efficiently solved by using standard numerical softwares. Numerical examples are given to illustrate the effectiveness and advantage of the proposed methods.
It is well known that linear parameter-varying (LPV) systems are a class of linear systems whose state-space matrices depend on a set of time-varying parameters which are not known in advance but can be measured or estimated upon operation of the systems. Gain-scheduled control strategies for LPV systems have been studied intensively in the last two decades and significant progress has been made in this area (see, e.g., [1–27]). There are many examples of parameter-dependent systems in practice, such as in aeronautics, aerospace, mechanics, and industrial processes (see, e.g., [2, 4, 12–14, 26]). This has motivated extensive studying of the gain-scheduled analysis and controller synthesis methods for various LPV systems from many aspects, including continuous-time and discrete-time systems, state-space formula and linear fractional transformation representation, affine-type and polytopic systems, state feedback and output feedback controllers, quadratic Lyapunov function-based and parameter-dependent Lyapunov function-based methods, and robust and control performances.
In most of the existing work, the gain-scheduled LPV control synthesis problems are performed through semidefinite programming and especially linear matrix inequality (LMI) techniques [2, 5–8, 10, 15–17, 19, 26]. This is due mainly to the fact that a number of methods of gain-scheduled control design for LPV systems proposed in the literature are based on small-gain approach (see, e.g., [1–4, 17]) or on the notions of quadratic Lyapunov function (see, e.g., [1, 7, 28]). The advantage of small-gain approach and quadratic Lyapunov function-based methods is that the associated computation is relatively straightforward (e.g., standard numerical software, LMI Control Toolbox ). However, the drawback of these methods is in that a single parameter-independent Lyapunov function must be used to guarantee both stability and control performance for all parameter values, and it can produce conservative results (see, e.g., [5, 10, 15, 26]). For the sake of reducing the abovementioned conservativeness, several control methods have been developed in the past decade, such as gain-scheduled and control based on parameter-dependent Lyapunov function (PDLF) method (see, e.g., [4, 5, 9, 10, 15, 18–21, 26–28, 30]). Until now, some researches have been carried out on performance synthesis problems for continuous-time LPV systems (see, e.g., [9, 10, 26]). In [9, 10], de Souza et al. presented two novel state feedback controllers for affine LPV systems based on quadratic PDLF frameworks. Also, Xie recently developed a gain-scheduled state feedback for polytopic LPV systems with new LMI formulation by introducing additional slack variables [24, 26, 27]. Despite the recent development of gain-scheduled analysis and controller synthesis for LPV systems, the issue associated with gain-scheduled control via PDLF is not well documented so far, even in the case of state feedback.
From the above analysis, it is clear that the gain-scheduled control problem for LPV systems has not been studied thoroughly, and this leads to the first objective of this paper for reducing the conservativeness of the existing state feedback controller. The second objective of this paper is to realize the dynamic output feedback control design for continuous-time polytopic LPV systems. It has to be stressed that the determination of a dynamic output feedback controller for polytopic LPV systems is indeed a difficult problem. The dynamic output feedback control is more flexible than static output feedback since additional dynamics of the controller are introduced [18–24]. Both are new contributions to the existing literature. To begin with, the result of gain-scheduled analysis in  is introduced with some explanations. To reduce the conservativeness of the state feedback controller synthesis, an improved sufficient condition for the existence of desired gain-scheduled state feedback controller is obtained in terms of parameterized linear matrix inequalities (PLMIs). Furthermore, based on polytopic characteristic of the parameter-dependent system, the corresponding controller synthesis problem is cast into a finite-dimensional convex optimization problem by a convexification method.
Considering the commonly encountered case in practice that the full state variables are unavailable for state feedback control design, we make further research on the gain-scheduled dynamic output feedback controller synthesis. Inspired by the work of the basis-PDLF approach proposed in [20, 21, 31, 32], some auxiliary slack matrix variables are introduced in the process of expressing the relationships among the terms of the system equation. A sufficient condition for the existence of desired gain-scheduled dynamic output feedback controller is initially obtained by PLMIs. Such a sufficient condition can guarantee that the closed-loop system is exponentially stable and has a prescribed disturbance attenuation performance. Similar to the case of state feedback control design, the new convexification method is introduced to derive a finite-dimensional PLMI condition for the dynamic output feedback controller synthesis, which can be efficiently solved by using standard numerical software. Finally, simulation results of an example in a gain-scheduled state feedback control indicate that our approach can generate less conservativeness than the existing results. The effectiveness of the proposed dynamic output feedback controller is verified by the other numerical example. It should be noticed that performance in this paper can be used to capture both the response to stationary noise and the transient response of the closed-loop system. Different from the Lyapunov-based robust performance, other methods lean too heavily on robustness and sacrifice an adequate view of performance. For example, robust method treats disturbances or commands as being the worst in a very broad class which is often unrealistic.
The rest of this paper is organized as follows. The problem formulation and some preliminary results are presented in the next section. Section 3 gives our main results of gain-scheduled state feedback and dynamic output feedback control design, respectively. Two numerical examples are given in Section 4 and we conclude this paper in Section 5.
Notations. We use the following notations throughout this paper. The superscript “” stands for matrix transposition, denotes the -dimensional Euclidean space, and the notation (≥0) means that is real symmetrical and positive definite (semidefinite). denotes the matrix trace, and stands for . In symmetric block matrices or long matrix expressions, we use an asterisk to represent a term that is induced by symmetry, and stands for a block-diagonal matrix. In addition, and denote identity matrix and zero matrix, respectively. Matrices, if their dimensions are not explicitly stated, are assumed to be compatible for algebraic operations.
2. Problem Description and Preliminaries
2.1. Problem Description
Consider the following class of continuous-time LPV systems: where is the state vector, is the measured output, is the controlled output, is the control input, and is the disturbance input. All the system matrices have compatible dimensions. The system matrices , , , , , and are parameter-dependent matrices with respect to the time-varying scheduling parameter . Similar to the previous gain-scheduled control problems for LPV systems [10, 26], the following assumptions are given.
Assumption 1. The state-space matrices , , , , , and are continuous and bounded functions and depend affinely on .
Assumption 2. The parameter values of vector are not known in advance but are measurable in real time. In addition, the parameter is limited to a given convex bounded polyhedral domain described by vertices as
and the rate of variation is well defined over the time horizon and varies in a polytope as
Given the above sets and , we define the parameter set described by vertices as Moreover, the LPV system in (1) is called polytopic, when it ranges in a matrix polytope, that is, the LPV system (1) can be expressed as where and is also a given convex bounded polyhedral domain described by vertices:
Here, we are interested in designing both gain-scheduled state feedback controller and dynamic output feedback controller for the system described by (1). Therefore, two gain-scheduled control laws are described by and , respectively, as follows: where is controller state vector and and are appropriately dimensioned LPV controller matrices to be determined.
Substituting the state-feedback control law into (1), the closed-loop system can be obtained as where
Augmenting the model of to include the state of the gain-scheduled dynamic output feedback control , we obtain the closed-loop LPV system : where and Then, the problems of gain-scheduled control design for LPV systems can be expressed as follows.
Gain-Scheduled Controller Synthesis Problem. Given the polytopic LPV system in (1), our concerned problem is to determine the gain-scheduled state feedback controller in (7) and dynamic output feedback controller in (8), such that both the closed-loop LPV systems and in (9) and (11) are exponentially stable for all , and reaches the desired controlled output in the sense of the performance with respect to the disturbance input .
In order to solve the gain-scheduled control design problem, we present some preliminary results for later use.
First, we introduce the notion of norm for LPV systems borrowed from linear time-varying (LTV) systems (see [9, 33] for details). In this paper we use the stationary white noise approach and the average output variance to define the norm. This kind of norm can be used to capture both the transient response of the system and the response to stationary noise. Furthermore, it has also been proven to be the most appropriate for the Lyapunov-based performance analysis and control design methods that will be developed in this paper [9, 10].
Definition 3 (see ). Let the closed-loop LPV system in (9) or (11) be exponentially stable. The norm of system can be defined as when and is a stationary zero-mean white process with an identity power spectrum density matrix, where denotes the mathematical expectation.
From the above definition, norm performance can be regarded as an index or criterion assessing the elimination of the disturbance or noise. It is clear that the optimal attenuation levels by the latest approaches are less conservative than that by the approach in the existing literature, and the improvement on conservativeness of the optimal attenuation level is more apparent [9, 10, 33]. Based on Definition 3, we introduce an important result based on the conclusion in  using a PDLF, which is a preliminary result for solving the gain-scheduled controller synthesis problem in this paper.
Lemma 4 (see ). Given a scalar , the closed-loop system in (9) or (11) is exponentially stable with the prescribed performance index if there exist matrices , , and and a sufficiently small positive scalar satisfying where
Remark 5. Note that there exists a term in condition (16) which cannot be implemented since it is not convex in the parameter . However, for the polytopic LPV system (1), we can solve this difficulty by using the following method from [11, 26]. Choose the parameter-dependent matrix as Based on this expression, its time derivation can be derived as From Assumption 2, we have and then in condition (16) can be substituted by convex parameter-dependent matrix .
It can be seen from Lemma 4 that, by introducing an extra matrix variable , the LMIs (14)–(16) provide a decoupling between Lyapunov function matrix and system matrices and will be useful for a gain-scheduled controller synthesis for LPV systems. In addition, it has been shown, both theoretically and numerically, that the parameter-dependent approach is less conservative than the results in the quadratic framework, where a common Lyapunov matrix is used for the entire uncertainty domain . However, we have to mention that the result developed in  is also conservative due to the imposition of when the result is used to synthesise a gain-scheduled state feedback controller. The reason is that the introduced slack matrix has been involved in the products with system matrices.
Then, there is a natural question: whether the conservativeness could be further reduced if we adopt different approaches other than the imposition of parameter independence as described above in the process of controller synthesis? The answer is affirmative. For state feedback controller synthesis, a possible alternative is the introduction of a new approach in  that helps to cast the infinite-dimensional LMI condition into finite-dimensional one. In the case of dynamic output feedback controller synthesis, a possible alternative is the introductions of structural block matrices and basis-parameter-dependent Lyapunov function [20, 21]. To the best of the authors’ knowledge, these approaches have not been investigated for gain-scheduled control problem of LPV systems so far. In the following, we will present some methods to solve both the state feedback and dynamic output feedback controller syntheses for the gain-scheduled control of LPV systems.
3. Gain-Scheduled Control Design
To reduce the conservativeness of state feedback controller synthesis mentioned above, we present a new sufficient condition for the existence of desired state feedback controller in terms of finite-dimensional PLMIs. In order to solve the gain-scheduled dynamic output feedback controller syntheses, a decoupling technique and a convexification method are introduced to obtain some sufficient conditions for the existence of the desired controller. The following two parts present the main results of gain-scheduled state feedback and dynamic output feedback controller syntheses, respectively.
3.1. State Feedback Control Design
Theorem 6. Consider the system in (1). Given a scalar and a sufficiently small positive scalar , there exists a gain-scheduled state feedback controller in the form of (7) such that the resulting closed-loop system in (9) is exponentially stable with a prescribed disturbance attenuation level if there exist matrices , , , , and satisfying where In this case, a desired gain-scheduled state feedback gain is given by
Note that the matrix variables and in Theorem 6 are dependent on time-varying parameter and are not assumed to be constant matrices, which makes the new state feedback controller design conditions (21)–(23) less conservative than the results in . However, the LMI conditions (21)–(23) in Theorem 6 cannot be implemented since they are not convex in the parameter . To solve this problem, we will introduce a new technique that helps convexify the matrix inequalities in Theorem 6 based on the polytopic characteristic of the dependent parameters. Then, we have the main result in the following theorem.
Theorem 7. Consider the system in (1). Given a scalar and a sufficiently small positive scalar , an admissible gain-scheduled state feedback controller in the form of in (7) exists if there exist matrices , , , , and satisfying where Moreover, under the above conditions, the admissible gain-scheduled state feedback gain is given by
Proof. From Theorem 6, an admissible gain-scheduled state feedback controller in the form of in (7) exists if there exist matrices , , , , and satisfying (21)–(23). Now, assume that the above matrix functions are of the following forms: Then, with (33), we rewrite and in (22)-(23) as On the other hand, (27)-(28) are equivalent to Then, from (34)–(35), we have where . Inequalities (29)-(30) guarantee and , respectively. As to (26), since and , if (26) is satisfied, we can get (21). By substituting the matrices defined in (33) into (25), we readily obtain (32), and the proof is completed.
Remark 8. From the proof of Theorems 6 and 7, it can be seen that in the process of solving the gain-scheduled state feedback control problem, we actually define parameter-dependent Lyapunov function-based matrix for performance objective. In other words, takes the form of . The gain-scheduled state feedback control design for continuous-time LPV systems has been investigated in , where parameter-dependent idea is realized at the expense of setting an additional slack variable to be constant for each vertex of the polytope. Notably, in Theorem 7, we do not set any matrix variable to be constant for the whole polytope domain. Therefore, Theorem 7 has the potential to yield less conservative results in the applications of gain-scheduled state feedback controller synthesis.
Remark 9. The idea behind Theorem 7 is to use convex combinations of vertex matrices in the form of (33) to substitute the matrix functions in Theorem 6. By introducing these matrices and by means of the convexification method used in the proof of Theorem 7, the infinite-dimensional nonlinear matrix inequality conditions in Theorem 6 are cast into finite-dimensional PLMIs conditions, which depend only on the vertex matrices of the polytope . Therefore, these PLMIs conditions can be readily checked by using standard numerical software . Note that the conditions in Theorem 7 are PLMIs for prescribed scalar not only over the matrix variables but also over the scalar . This implies that the performance index can be included as optimization variable to obtain a reduction of the attenuation level bound. As in [26, 31], it is usually desired to design controller with minimized performance , which can be readily found by solving the following convex optimization problem:
3.2. Dynamic Output Feedback Control Design
Theorem 10. Consider the system in (1). Given a scalar and a sufficiently small positive scalar , there exists a gain-scheduled dynamic output feedback controller in the form of (8) such that the resulting closed-loop system in (11) is exponentially stable with a prescribed disturbance attenuation level if there exist matrices , , , , , , , , , and satisfying where In this case, a desired gain-scheduled dynamic output feedback controller in the form of (8) can be obtained by solving the following equations: where and can be obtained by taking any full-rank factorization of .
Proof. It can be seen from Lemma 4 that the matrix is nonsingular if (15) holds since and . For notational simplicity, we denote in the following. Then and can be partitioned as follows:
Without loss of generality, we assume that and are nonsingular (if not, and may be perturbed, respectively, by matrices and with sufficiently small norms such that and are nonsingular and satisfy (15)). Then we can define the following nonsingular matrices:
Performing congruence transformations to (15) and (16) by matrices and , respectively, we have
Define the following matrices:
Then, substituting (12) into (46) and (47) and considering (44) and
we obtain that (39) and (40) hold.
Define the following matrices: It is noted that Finally, from (50), (47), and (54), (42) holds. This completes the proof.
Remark 11. Theorem 10 casts the nonlinear matrix inequality condition of dynamic output feedback control design based on Lemma 4 into an LMI condition by using linearization procedures. Based on these procedures, the desired LPV controllers can be constructed by using the obtained matrix functions , , , , , , , , , and . However, these LMI conditions of testing the feasibility in Theorem 10 are infinite-dimensional constraints in terms of the parameter . Therefore, these conditions still cannot be implemented since they are not convex in the parameter . It is noted that if we set , , , , , , , , , and , we will readily obtain a new gain-scheduled output feedback control result in a quadratic framework. Then, we can obtain the following corollary based on Theorem 10 immediately.
Corollary 12. Consider the system in (1). Given a scalar and a sufficiently small positive scalar , then there exists a gain-scheduled dynamic output feedback controller in the form of (8) such that the resulting closed-loop system in (11) is exponentially stable with a prescribed disturbance attenuation level if there exist matrices , , , , , , , , , and satisfying where In this case, a desired gain-scheduled dynamic output feedback controller in the form of (8) can be obtained by solving the following equations: where and can be obtained by taking any full-rank factorization of .
Although Corollary 12 gives a finite-dimensional LMI approach to design a gain-scheduled dynamic output feedback controller in the form of (8), all vertices of the polytope share a common Lyapunov function, which may lead to the conservative result. In order to reduce the conservativeness and derive a solvable condition, we develop a new PLMI condition in the following. Similar to the introduction of the convexification method used in Theorem 7, a finite-dimensional PLMI condition that depends on the vertices of the polytope is presented in the following theorem, which can be efficiently solved by using standard numerical software.
Theorem 13. Consider the system in (1). Given a scalar and a sufficiently small positive scalar , then an admissible gain-scheduled dynamic output feedback controller in the form of in (8) exists if there exist matrices , , , , , , , , , , , and satisfying where Moreover, under the above conditions, the matrix functions for an admissible gain-scheduled dynamic output feedback controller in (8) are given by solving the following equations: where , , , , , , , and and can be obtained by taking any full-rank factorization .
Proof. From Theorem 10, an admissible gain-scheduled output feedback controller in the form of in (8) exists if there exist matrices , , , , , , , , , and and a scalar satisfying (38)–(40). Now, assume that the above matrix functions are of the following form: Then, with (65), we rewrite and in (39)-(40) as On the other hand, (59)-(60) are equivalent to where and . Then, from (66)-(67), we have where . Inequalities (61)-(62) guarantee and , respectively. As to (58), since and , if (58) satisfies, we can get (38). By substituting the matrices defined in (65) into (42), we readily obtain (64), and the proof is completed.
Remark 14. From the proof of Theorem 13, it can be seen that the Lyapunov function-based matrix for performance objective is also parameter dependent; that is, takes the form of . Notably, here in Theorem 13, we do not set any matrix variable to be constant for the whole polytope domain, and therefore, Theorem 13 has the potential to yield less conservative results in the applications of gain-scheduled LPV control design than the ones presented in Corollary 12. Similar to the case of state feedback control design, the gain-scheduled dynamic output feedback controller synthesis problem can be also cast into a finite-dimensional convex optimization problem as follows:
Remark 15. From the results in the existing literature, it is known that the definition of quadratic Lyapunov function is simple, and the computation cost in the design procedure is low. However, the common quadratic Lyapunov functions tend to be conservative and might not exist for some highly nonlinear systems. To reduce the conservatism and to establish well-performance condition, parameter-dependent Lyapunov functions and new slack variables have been adopted in this paper. It can be seen that the quadratic Lyapunov function is a special case of PDLF. Thus, the proposed method in this paper is more general and less conservative. Meanwhile, the PDLF-based approach also has some disadvantages: the design procedures become more complex, and the computational requirement is usually demanding. The number of PLMIs conditions in Theorems 7 and 13 increases rapidly with the number of system dimensions. Thus, a computational problem might arise for high-order systems. One effective way to solve this problem is to try to reduce the number of variables with the tradeoff between computational burden and conservativeness. For example, Theorem 13 can be replaced by Corollary 12 with increasing the conservativeness and decreasing computational burden.
4. Illustrative Example
In this section, we use Example 1 to show the less conservativeness of the result developed in Theorem 7. Example 2 is provided to show the effectiveness of the gain-scheduled dynamic output feedback controller proposed in Theorem 13.
Example 1. Consider the following numerical example borrowed from [26, 29]. The problem is to control the yaw angles of a satellite system. The satellite system consisting of two rigid bodies joined by a flexible link has the state-space representation as follows:
where and and are torque constant and viscous damping, and they vary in the following uncertainty ranges: ; .
For this system, our purpose is to design a gain-scheduled state feedback control in the form of (7), such that the closed-loop system is exponentially stable with a minimized disturbance attenuation level .
Define It is easy to check that , , are convex coordinates, since they satisfy and . It should be noted that the choice of scalar is important to converge to minimum performance . In this example, the value of minimum guaranteed performance is with fixed and with fixed by the method in , and with fixed and with fixed by using Theorem 7. Table 1 shows the minimum performance and the numbers of decision variables when different methods are used. It is clearly shown in Table 1 that the guaranteed performance obtained by our approach is much better than that obtained by the method in , which indicates the less conservativeness of the controller design result developed in this paper, even though this procedure increases some numerical complexity. From Table 1, we can also see that the smaller the value of , the better the value of . Although the computational complexity of Theorem 7 for this example is relatively more than the approach in , the reduced conservatism is significant. With the rapid development of computer technology and computational method, the computational burden problem may be solved.
Example 2. Consider a continuous-time LPV system in (1) with the following matrix functions: where