You are on page 1of 8

Robust stability of time-varying polytopic systems via

parameter-dependent homogeneous Lyapunov functions

G. Chesi a, A. Garulli a, A. Tesi b, A. Vicino a
Dipartimento di Ingegneria dellInformazione, Universit`
a di Siena
Dipartimento di Sistemi e Informatica, Universit`
a di Firenze


This paper deals with robust stability analysis of linear state space systems affected by time-varying uncertainties with
bounded variation rate. A new class of parameter-dependent Lyapunov functions is introduced, whose main feature is that
the dependence on the uncertain parameters and the state variables are both expressed as polynomial homogeneous forms.
This class of Lyapunov functions generalizes those successfully employed in the special cases of unbounded variation rates and
time-invariant perturbations. The main result of the paper is a sufficient condition to determine the sought Lyapunov function,
which amounts to solving an LMI feasibility problem, derived via a suitable parameterization of polynomial homogeneous
forms. Moreover, lower bounds on the maximum variation rate for which robust stability of the system is preserved, are shown
to be computable in terms of generalized eigenvalue problems. Numerical examples are provided to illustrate how the proposed
approach compares with other techniques available in the literature.

Key words: Polytopic system, Bounded variation rate uncertainty, Robust stability, Lyapunov function, LMI

1 Introduction Comparably less attention has been devoted to the inter-

esting case when bounds on the variation rate of the un-
Robust analysis of linear systems subject to time- certain parameters are given, except for the special case
varying parametric uncertainties has been tackled via of null variation rate, corresponding to time-invariant
Lyapunov functions since long time (see e.g. [29, 25]). parametric uncertainty. In the latter case, the class of
Within this context, a popular uncertainty model is parameter-dependent Lyapunov functions has been suc-
the one assuming that the uncertain parameters affect cessfully employed (see e.g. [2, pp. 342-347], [16]), and
affinely the state space matrix and belong to a given several conditions in terms of Linear Matrix Inequalities
polytope. The simplest approach consists in looking for (LMIs) have been recently derived ([28, 27, 5, 23, 10]).
a common quadratic Lyapunov function that proves sta- In [10], a new class of parameter-dependent quadratic
bility of the entire polytope of matrices (see e.g. [21]). Lyapunov functions has been introduced, whose depen-
However, it is well known that this condition, although dence on the uncertain parameters is expressed as a
appealing from a computational point of view, can lead polynomial homogeneous form.
to conservative results. In order to reduce conserva- On the other hand, few results are available for the
tiveness, more general classes of Lyapunov functions case when the variation rate is bounded by a known
have been considered, including polyhedral Lyapunov quantity, and they mostly concern the use of affine
functions (see e.g. [8, 3]), piecewise quadratic Lya- parameter-dependent quadratic Lyapunov functions. A
punov functions ([31, 1]), and homogeneous polynomial first contribution has been given in [17], where an LMI-
Lyapunov functions ([32, 9]). In particular, several ex- based sufficient condition has been provided exploiting
amples are reported in the last reference, showing the a multiconvexity property of the time-derivative of the
effectiveness of conditions based on Lyapunov functions Lyapunov function. More recently, different conditions
whose dependence on the state vector is expressed as a have been derived in [24, 18], taking into account the
polynomial homogeneous form. dynamics of the uncertain parameter vector. Sufficient
conditions based on quadratic Lyapunov functions with
This paper was not presented at any IFAC meeting. Corre- polynomial dependence on the parameters have been
given in [6, 30].
sponding author G. Chesi. G. Chesi is now with the Depart-
ment of Electrical and Electronic Engineering of the Univer- In this paper, the class of Homogeneously Parameter-
sity of Hong Kong. Tel. +852-28578482. Fax +852-25598738. Dependent Homogeneous Lyapunov Functions (simply
Email addresses: (G. Chesi), abbreviated as HPD-HLFs) is introduced to investigate (A. Garulli), robust stability in presence of time-varying uncertain-
(A. Tesi), (A. Vicino). ties with a polytopic bound on the variation rate. Such

Preprint submitted to Automatica 24 January 2007

a class, where the dependence on the uncertain pa- for given vertices dj Rq such that 0q D and
rameter vector and the state vector are both expressed
as polynomial homogeneous forms, can be seen as a q
generalization of the Lyapunov functions previously dji = 0 j = 1, . . . , h. (5)
employed for unbounded variation rates ([9]) and null i=1
variation rates ([10]). It is first shown that the exis-
tence of a HPD-HLF to prove robust stability can be Condition (5) is necessary to ensure that p(t) P, t.
established through an LMI feasibility test. Then, lower
bounds on the maximum variation rate for which the Remark 1. The model (1)(5) has been introduced
system remains stable are obtained by solving General- independently in [12] and [18]; it can be seen as an ex-
ized EigenValue Problems (GEVPs) (see [7] for details tension of models adopted in previous works ([17, 24]).
about LMIs and GEVPs). Finally, numerical examples Notice that this model encompasses the special cases
are reported to illustrate the behavior of the proposed of time-invariant uncertainty (p = 0) and slowly time-
condition, in comparison with results available in the varying uncertain parameters (|p i | , i = 1, . . . , q),
literature. In particular, it is shown that in presence of through appropriate choices of the set D.
bounds on the parameter variation rate, one can benefit
from increasing the degree of the HPD-HLF in both The problems we address can be stated as follows.
the state variables and the uncertain parameters. This
turns out to be a remarkable difference with respect P1: Robust stability: Establish if system (1) is robustly
to the cases of time-invariant parameters (when one asymptotically stable under the constraints (2).
can restrict to quadratic Lyapunov functions) and un-
bounded variation rates (where parameter dependence P2: Maximum variation rate: Compute the stability
in the Lyapunov function is useless). margin , defined as the maximum scaling factor of
polytope D for which asymptotic stability is still guar-
anteed, i.e.
2 Problem formulation and preliminaries
= sup {a R : (1) is robustly asymptotically
In the paper, the following standard notation is adopted: stable with p(t) P and p(t)
aD} .
0n , 0mn : origin of Rn and of Rmn ; Rn0 : Rn \ {0n }; In :
identity matrix n n; A : transpose of matrix A; A > The key step to tackle the above problems is the con-
0 (A 0): symmetric positive definite (semidefinite) struction of a HPD-HLF
matrix A; A B: Kroneckers product of matrices A X
and B; A[k] : k-th Kronecker power A A . . . A (k v(x, p) = ai,j pi xj (7)
times); co{d1 , . . . , dh }: convex hull of vectors d1 , . . . , dh . Pq
i N ,P
jN n
i n
Moreover: p = [p1 , . . . , pq ] Rq ; pi = pi11 pqq , i = k=1 i k = s, k=1 jk = 2m
2 2
[i1 , . . . , iq ] N ; sq(p) = [p1 , . . . , pq ] R , p Rq ;
q q
where s is the sum of the powers of the variables pi (i.e.,
sqr(p) = [ p1 , . . . , pq ] Rq , p Rq .
the degree of the p-part), 2m is the sum of the powers of
Consider the continuous-time state space model the variables xj (i.e., the degree of the x-part) and ai,j
are real coefficients. Such a class of Lyapunov functions
X can be seen as a generalization of those employed in [9]

x(t) = A(p(t))x(t), A(p(t)) = pi (t)Ai (1) for unbounded variation rates (s = 0) and in [10] for
i=1 time-invariant perturbations (m = 1). Moreover, the
affine parameter-dependent quadratic Lyapunov func-
where x Rn is the state vector, p(t) Rq is the time- tions considered in [17, 24, 18], for the case of bounded
varying uncertain parameter vector and Ai are given variation rates, are singled out for s = 1 and m = 1.
matrices. Assume that
Remark 2. Notice that the choice of a Lyapunov
function v(x, p) homogeneous in the uncertain pa-
p(t) P
(2) rameters p is not conservative with respect to a more

p(t) D general polynomial dependence. This is due to the
fact that in the uncertainty model (1)(5), p belongs
where P and D are given polytopes. Specifically, to the unit simplex. Indeed, consider for example the
function f (x, p) = f0 (x) + f1 (x)p1 + f2 (x)p22 , where
q p P = {p R2 : p1 + p2 = 1} and fi (x) are
( )
P= pR : pi = 1, pi 0 (3) given functions of x. If we define the new function
i=1 h(x, p) = f0 (x)(p1 + p2 )2 + f1 (x)p1 (p1 + p2 ) + f2 (x)p22
which is clearly homogenous in p, it turns out that
D = co{d1 , . . . , dh } (4) h(x, p) = f (x, p) for all p P and for any x.

Before proceeding, let us recall the Square Matricial Let us introduce a suitable representation of v(x, sq(p)),
Representation (SMR) of homogeneous scalar forms. which is a homogeneous form of degree 2m in x and 2s
Let w(x) be a homogeneous form of degree 2m in in p. Following the SMR of scalar forms, one can set
x Rn . The complete SMR of w(x) is defined as

w(x) = x{m} (W + L()) x{m} where x{m} R(n,m) v(x, sq(p)) = (V, s, m) (12)
is a vector containing all monomials of degree m in x,
W R(n,m)(n,m) is any symmetric matrix satisfying where

w(x) = x{m} W x{m} , R(n,m) is a vector of free    
parameters and L() is a parameterization of the linear (V, s, m) = p{s} x{m} V p{s} x{m} (13)

{m} {m}
space {L = L : x Lx = 0 x}. The quantities
(n, m) and (n, m) are given respectively by (n, m) = and V is a suitable symmetric matrix (dependence on
(n+m1)! 1
(n1)!m! , (n, m) = 2 (n, m)((n, m) + 1) (n, 2m). x{m} is omitted for ease of notation). Matrix V in (13)
The interested reader is referred to [11] for detailed must belong to the linear space
formulas and algorithms to generate the SMR of a ho-
mogeneous form. It should be remarked that the SMR V = {V = V : (V, s, m) does not contain
is also known in the literature as Gram matrix represen- (14)
monomials pi with any odd power ik .

tation ([15]) and plays a key role in several techniques
for checking positivity of polynomials based on sum-of-
squares decompositions ([26]). The dimension of such linear space V turns out to be
(2m, s) = (q, s)(n, m) [(q, s)(n, m) + 1]
3 Stability via HPD-HLFs 2 (15)
[(q, 2s) (q, s)] (n, 2m).
Let us consider problem P1. A sufficient condition to
establish whether (1) is asymptotically stable under the Indeed, observe that the first term on the right side of
constraint (2), can be obtained by finding a HPD-HLF (15) is the number of free entries in a symmetric matrix
v(x, p) such that of size (q, s)(n, m). The second term is the number of
distinct monomials with at least one odd power on the
components of p achievable by the product (V, s, m) in
v(x, p) > 0 (x, p) Rn0 P
(8) (13) for some matrix V , that is the number of constraints
v(x, Rn0 P D.
p) < 0 (x, p, p) on the entries of any matrix V V.
Let us remark that v(x, p) is uniquely defined by
We have that
v(x, p) v(x, p) v(x, p) = sqr(p){s} x{m} V sqr(p){s} x{m} .
p) =
v(x, A(p)x + p
x p
q Hence, the set V provides, through equations (12)(13),
v(x, p) X v(x, p)
= A(p)x + pi p (9) a complete parameterization for the HPD-HLFs in (7).
x i=1
Let us consider now v(x,
sq(p)). Let D1 (V ) and D2 (V, p)

that is v(x,
p) can be written as a homogeneous form of be suitable symmetric matrices such that
degree 2m in x and s + 1 in p, because qi=1 pi = 1 for
all p P. This is important because it allows us to get v(x, sq(p))
rid of the set P in (8) through the following result. (D1 (V ), s + 1, m) = A(sq(p)) x
Lemma 1 Let g(p) be a homogeneous form. Then, v(x, p) X
(D2 (V, p),
s + 1, m) = pi
p p=sq(p) i=1
g(p) > 0 p P g(sq(p)) > 0 p Rq0 . (10)
Notice that D1 (V ) depends linearly on V , while D2 (V, p)

Proof. See Lemma 3 in [10].  is multilinear in V and p,
i.e. it is linear in V for fixed p
and viceversa. From (9), one has
From (9) and Lemma 1, (8) can be rewritten as
( sq(p)) = (D1 (V ), s + 1, m)+(D2 (V, p),
v(x, s + 1, m)
v(x, sq(p)) > 0 (x, p) Rn0 Rq0 = (D1 (V ) + D2 (V, p)
+ N, s + 1, m)
v(x, Rn0 Rq0 D.
sq(p)) < 0 (x, p, p) (16)

where N is any symmetric matrix belonging to It is worth observing that the second inequality in (20)
does not reduce the set of feasible since 0q D.
N = {N = N : (N, s + 1, m) = 0, x p} . (17) The following theorem states that the conservativeness
of the condition of Theorem 1 does not increase by suit-
The linear space N has dimension (2m, s + 1) where ably increasing m and s.
(2m, s) = (q, s)(n, m) [(q, s)(n, m) + 1] Theorem 2 If there exist m and s such that the condi-
2 (18) tion of Theorem 1 is satisfied, then it is also satisfied for
(q, 2s)(n, 2m). am and as + b, for all integers a 1 and b 0.
Now we are ready to state the main results of the paper. Proof. We first prove the theorem for b = 0. Let
and 1 , . . . , j be the parameter vectors satisfying (19)
Theorem 1 (Sufficient condition for P1) Let V () and for given m and s, and be v(x, p) the corresponding
N () be linear parameterizations of the sets V and N HPD-HLF. Let us define v(x, p) = {v(x, p)}a . We want
where and are free parameter vectors. Then, (1) is
to show that there exist and 1 , . . . , j correspond-
asymptotically stable under the constraint (2) if there
ing to v(x, p) satisfying (19) for am and as. One has
exist and j , j = 1, . . . , h, such that the following set
of LMIs is satisfied: v(x, sq(p)) = {(V (), s, m)}a = (V , as, am) where
V = H V ()[a] H and H is the matrix satisfying the re-
lationship p{s} x{m} = H p{as} x{am} for all

0 < V ()

0 > D1 (V ()) + D2 (V (), dj ) + N ( j ) (19) (x, p). Observe that V > 0 because V () > 0 and H is

a full rank vertical matrix. Moreover, V belongs to the
j = 1, . . . , h set V because v(x, sq(p)) does not contain components
of p with odd powers. Hence, there exists satisfying
the first inequality of (19). Let us consider now the time
Proof. Suppose that there exist and j satisfying
derivative in vertex dj . By using standard properties of
(19). Then, the first inequality in (19) implies that
Kroneckers products, it can be shown that v (x, sq(p)) =
v(x, sq(p)) > 0. From the second inequality in (19) one , as+ 1, am),
has that v(x,
sq(p)) in (16) is negative definite in each a{(V (), s, m)}a1 (M, s+ 1, m) = a(M
vertex dj D. Hence, (11) is satisfied because D is the where M = D1 (V ()) + D2 (V (), dj ) + N ( j ),
convex hull of vectors dj , and therefore (8) holds.  M = J (V ()[a1] M )J, and J is the matrix satisfying
the relationship p{s} x{m} p{s+1} x{m} =

Table 1 shows the total number of free variables involved J p{as+1} x{am} for all (x, p). We have that M

in (19) for some system dimensions.
because V () > 0, M < 0 and J is a full rank vertical
m\s 1 2 3 m\s 1 2 3 matrix. Therefore, there exists j satisfying the second
inequality of (19) in vertex dj .
1 19 45 83 1 45 105 192 We have now to show that the theorem holds also for
2 56 121 213 2 255 531 915 b > 0. This can be done by showing that, if the con-
dition of Theorem 1 is satisfied for m and s, then it
3 115 238 409 3 832 1657 2782
is also satisfied for m and s + 1. Let and 1 , . . . , j
(n = 2) (n = 3) be the parameter vectors satisfying (19) for given m
Table 1 and s, and be v(x, p) the corresponding
Total number of parameters (2m, s)+h(2m, s+1) involved us define v(x, p) = v(x, p) ( i=1 pi ) . It follows that
in (19) for q = h = 2 and some values of n, m and s. Pq 2

+ 1, m)
v(x, sq(p)) = (V (), s, m) i=1 pi = (V , s
where V = K1 (V () Iq )K1 and Kr is the matrix

Corollary 1 (Lower bound for P2) Define = b 1 satisfying the relationship p{s+r1} x{m}
p =
where b is the solution of the GEVP Kr p{s+r} x{m}

for all (x, p).
Observe that V > 0 since V () > 0 and K1 is a full
b = inf b rank vertical matrix (i.e., a matrix whose number of
b,, 0 ,..., h
rows is not less than its number of columns). Moreover,

0 < V () V belongs to the set V for s + 1 because v(x, sq(p))

0 > D (V ()) + N ( 0 )

does not contain components of p with odd powers.
s.t. Hence, there exists satisfying the first inequality of
0 > b D1 (V ()) + N ( 0 ) + D2 (V (), dj )

(19) for s + 1. Let us consider now the time deriva-

tive in vertex dj . By using (5), one has v (x, sq(p)) =

+N ( j ) j = 1, . . . , h

Pq , s + 2, m)
(20) (M, s + 1, m)p p + v(x, sq(p)) i=1 dji = (M
Then, . where M = D1 (V ()) + D2 (V (), d ) + N ( j ) andj

M = K (M Iq )K2 . We have that M < 0 since M < 0 systems in the form (1), for the case of time-invariant
and K2 is a vertical matrix with full rank, and that M uncertainty p. It has been shown that HPD-QLFs are
represents v (x, sq(p)). Therefore, there exists j satisfy- nonconservative, that is if the polytope of matrices is
ing the second inequality of (19) in vertex dj for s + 1.  robustly stable, then there exists a HPD-QLF with pa-
rameter dependence of suitable degree s. Moreover, an
upper bound on the degree s can be given.
Several remarks can be made on the results above. Finally, the use of HPD-HLFs can be extended to sys-
1) The family of HPD-HLFs in the case m = s = 1 tems in the form (1) where the dependence of A(p(t))
boils down to quadratic Lyapunov functions with affine on p(t) is polynomial instead of linear, as done in [14]
parameter dependence, which have been considered by for the case of HPD-QLFs. This clearly allows one to
several authors ([17, 24, 18]). The condition provided by consider larger classes of uncertain systems.
Theorem 1 is based on the parameterizations (12)-(14)
and (16)-(17), which rely on the SMR of homogeneous
polynomial forms. Since the SMR exploits all the pos- 4 Examples
sible degrees of freedom in the representation of such
forms, the only source of conservatism is the gap be- 4.1 Example 1
tween sum-of-squares and positive homogeneous forms.
Conversely, the cited works are based on specific choices
of the parameterizations of v and v, thus requiring in Let us consider the following system, which is quite pop-
general a smaller number of free LMI parameters and re- ular in the literature ([32, 31, 1, 9, 24]),
sulting usually in a higher degree of conservatism. This " #
fact appears to be supported by the numerical examples 0 1
discussed in the next section.
x(t) = x(t), 0 r(t) k. (21)
2) The conservativeness of Theorem 1 does not increase 2 r(t) 1
by increasing s for a fixed m (see Theorem 2), but may
increase by increasing m for a fixed s 1 (see Example We want to compute the maximum variation rate
1 in Section 4). Instead, it is worth recalling that conser- of r(t), such that (21) is asymptotically stable for any
vativeness does not increase by increasing m for s = 0 |r(t)|
. System (21) can be rewritten as (1)(2) with
(see [9, 22]).
3) It can be observed that conservativeness is generally
" # " #
0 1 0 1
reduced by suitably increasing both m and s (see The- A1 = , A2 =
orem 2 and Figure 1). This confirms that it is useful 2 1 2 k 1
to increase the degree of HPD-HLFs in both the state
i h i
variables and the parameters, in presence of bounds on D = co , , , .
k k k k
the parameter variation rate. Notice that this is not the
case if such bound is zero (as there is no need to choose Lower bounds have been computed by using HPD-
m > 1) or infinity (when s = 0 must be chosen). HLFs with m = 1, 2, 3 and s = 0, 1, 2, 3 (see Table 1
for the number of LMI parameters involved). In Fig-
It is also worth remarking that the proposed class of ures 1(a)(c), the obtained lower bounds are plotted
Lyapunov functions is a general tool to check robust versus different values of the parameter bound k. The
stability of polytopic systems. In fact, HPD-HLFs con- bounds are compared to those provided by the suffi-
tain as special cases the following classes: cient conditions in [17] (dash-dot line, 6 LMI parame-
1) Homogeneous Polynomial Lyapunov Functions ters), [24] (dashed line, 6 LMI parameters), and [18] (22
(HPLFs), corresponding to s = 0. This class has been LMI parameters). In this example, the lower bound pro-
proposed in [9] to deal with systems in the form (1), vided by [18] is exactly equal to that obtained by using
for the case of time-varying uncertainty p(t) with un- the HPD-HLF technique proposed in this paper with
bounded variation rate. It turns out that HPLFs are m = s = 1 (solid line corresponding to s = 1 in Figure
nonconservative for such systems, in the sense that if 1(a)). Note that robust stability against unbounded p(t)

the system is robustly asymptotically stable, then there can be guaranteed for k = 6.8643 by using a HPD-HLF
exists a HPLF of sufficiently high degree m, proving with m = 10 and s = 0, i.e. a common Lyapunov func-
robust stability. Indeed, in [4] it has been shown that tion that does not depend on the parameters (see [9] for
robust stability implies the existence of a Lyapunov details). As one can see, the conservativeness of the con-
function which can be written as a sum of squares, dition of Theorem 1 does not increase by increasing s for
while in [22] it has been proven that, for this problem, a fixed m, but may increase by increasing m for a fixed
polynomial Lyapunov functions can be constrained to s. This is clearly shown in Figure 1(d) which reports the
be homogeneous without loss of generality. lower bounds for s = 1 and m = 1, 2, 3.
2) Homogeneously Parameter-Dependent Quadratic In order to show another instance of this behavior of
Lyapunov Functions (HPD-QLFs), corresponding to HPD-HLFs, let us consider system (21) for k = 110
m = 1. This class has been proposed in [10] to deal with and r(t)
0, which is obviously asymptotically stable.

30 30
are homogeneous forms of degree 4 in two variables (x1
25 25
and x2 ). Such homogeneous forms are positive if and
only if they admit a positive definite SMR matrix (see
20 20
Lemma 1 of [9]). Therefore, (22) is satisfied if and only


15 s=2 15 s=2
if there exist V1 , V2 and 1 , 2 , 3 R such that
s=1 s=1
10 10

Vi > 0 i = 1, 2
s=0 s=0

5 5
2 4 6 8 10 12 14 16 18 20 2 4 6 8 10 12 14 16 18 20

k k Vi Ai + Ai Vi + N
(i ) < 0 i = 1, 2
(a) m = 1 (b) m = 2
(V1 + V2 )(A1 + A2 ) + (A1 + A2 ) (V1 + V2 ) + N (3 ) < 0
30 (23)

where N (i ) is any linear matricial function satisfying


x{2} N (i )x{2} = 0, x and i R. Since it can be

checked via any LMI solver that the set of LMIs (23)


is infeasible, one can conclude that the sought linearly
parameter-dependent quartic Lyapunov function satis-

fying (22) does not exist.
5 m=3
2 4 6 8 10 12 14 16 18 20 5

k 2 4 6 8

10 12 14 16 18 20

(c) m = 3 (d) s = 1 4.2 Example 2

Fig. 1. Example 1: lower bounds versus parameter bound Let us consider the system
k, for s = 0, 1, 2, 3 and m = 1 (a), m = 2 (b) and m = 3 (c);
plots for s = 1 (linear parameter dependence) and m = 1, 2, 3

x(t) = A(p(t); k) x(t), p(t) P, p(t)
are compared in (d). The dash-dot plot and the dashed plot P3 (24)
correspond to the lower bounds provided respectively by [17] A(p; k) = pi Ai (k), Ai (k) = A0 + k Ai


and [24]; the one given by [18] coincides with the solid plot
for m = s = 1.
Its robust stability can be ensured by using Theorem 1 2 3 2 3
0.6 1.7 3.1 1.1 0.6 0.3 0.1
with m = 1 and s = 1, in particular a HPD-HLF is 6 7 6 7
6 3.6 7
7 6
6 2.8 7
v(x, p) = x (p1 V1 + p2 V2 )x with A0 = 6

0.7 2.1 2.6
7, A1 = 6

0.8 0.2 1.1
4 0.5 2.4 5 1.6 7
5 6
4 1.9 0.8 1.1 275
" # " # 0.6 2.9 2 0.6 2.4 3.1 3.7 0.1
1 0.14286 47.6085 0.02062
V1 = , V2 = . 2 3 2 3
0.14286 0.42857 0.02062 0.43251 6
6 3.4
3.4 1.7 1.5
7 6
1 1.4 0.7 0.7
1.4 7 6 2.1 2.1 7
2 = 6 7 3 = 6 7
1.4 1.3 0.6 0.1
6 7, 6 7.
3.4 7 6 0.7 7
4 1.1 2 1.5 5 4 0.4 1.4 1.3 5
However, robust stability cannot be established by any 0.4 0.5 2.3 1.5 1.5 0.9 0.4 0.5
HPD-HLF with m = 2 and s = 1. Indeed, there does
not even exist any linearly parameter-dependent quar- The set D in (4) is chosen such that h = 2, d1 =
tic Lyapunov function simultaneously verifying the sta- [1, 0, 1] and d2 = [1, 0, 1]. Notice that this corre-
bility of the matrix pencil A(p) at its vertices A([1, 0] ) sponds to |p 1 | , p 2 = 0, |p 3 | , and p 1 + p3 = 0
and A([0, 1] ) and middle point A([ 12 , 12 ] ). In fact, let us (one time-invariant parameter and two time-varying pa-
write such a candidate Lyapunov function as v(x, p) = rameters on the unit simplex). The aim is to compute

the maximum variation rate of p1 (t) and p3 (t) so that

x {2}
p1 V1 + p2 V2 x{2}
where V1 , V2 R33 are sym-
(24) is asymptotically stable, for different values of k.
metric matrices. Then, v(x, p) should satisfy the follow- The lower bounds provided by HPD-HLFs with m =
ing conditions: s = 1 (348 LMI parameters) are plotted against k in Fig-
) (" # " # " #) ure 2, and compared to those provided by the sufficient
v(x, p) > 0 1 1
0 conditions in [24] (dashed line, 30 LMI parameters) and
x 6= 0n p , , (22) in [18] (dotted line, 94 LMI parameters). Notice that
p) < 0
v(x, 0 2 1 the three plots are based on different sufficient condi-
tions, but they are obtained using Lyapunov functions

where v(x, p) = x{2} H(p)x{2} with H(p) = p21 (V1 A1 + with the same structure (quadratic in the state variables
and linear in the parameters). Figure 2 reports also the
A1 V1 ) + p1 p2 (V1 A2 + V2 A1 + A2 V1 + A1 V2 ) + p22 (V2 A2 + curve corresponding to HPD-HLFs with m = 1, s = 2
A2 V2 ) and Ai R33 is the extended matrix of Ai satis- (1290 LMI parameters), which confirms the benefits of
fying xx Ai x = Ai x{2} (see [13] for a closed-formula of increasing the degree s of the homogeneous form in the
this extended matrix). For a fixed p, v(x, p) and v(x, p) uncertain parameters p.

5 [3] F. Blanchini. Nonquadratic Lyapunov functions for
4.5 robust control. Automatica, 31:451461, 1995.
4 [4] F. Blanchini and S. Miani. A universal class of
3.5 smooth functions for robust control. IEEE Trans.
3 on Automatic Control, 44(3):641647, 1999.
2.5 [5] P.-A. Bliman. Nonconservative LMI approach to

2 robust stability for systems with uncertain scalar

1.5 s=1 s=2 parameters. In Proc. of 41st IEEE CDC, pp. 305
1 310, Las Vegas, Nevada, 2002.
0.5 [6] P.-A. Bliman. A convex approach to robust stabil-
1.2 1.4 1.6 1.8 2 2.2
ity for linear systems with uncertain scalar param-
k eters. SIAM Journal on Control and Optimization,
42(6):20162042, 2004.
Fig. 2. Example 3: lower bound versus k, for m = 1 and [7] S. Boyd, L. El Ghaoui, E. Feron, and V. Balakr-
s = 1, 2 (solid lines). The dashed line and the dotted line ishnan. Linear Matrix Inequalities in System and
show the lower bounds provided respectively by [24] and [18]. Control Theory. SIAM, Philadelphia, 1994.
5 Conclusions [8] R. K. Brayton and C. H. Tong. Stability of dynam-
ical systems: a constructive approach. IEEE Trans.
on Circuits and Systems, 26:224234, 1979.
Robust stability of linear systems affected by time- [9] G. Chesi, A. Garulli, A. Tesi, and A. Vicino. Homo-
varying polytopic uncertainty has been considered for geneous Lyapunov functions for systems with struc-
the case when a polytopic bound on the variation rate tured uncertainties. Automatica, 39(6):10271035,
of the uncertain parameters is given. Sufficient condi- 2003.
tions have been obtained in terms of LMIs, via the use [10] G. Chesi, A. Garulli, A. Tesi, and A. Vicino. Ro-
of Homogeneously Parameter-Dependent Homogeneous bust stability for polytopic systems via polynomi-
Lyapunov Functions (HPD-HLFs), which are a gener- ally parameter-dependent Lyapunov functions. In
alization of the affine parameter-dependent quadratic 42nd IEEE CDC, pp. 46704675, Maui, Hawaii,
Lyapunov functions previously employed in the litera- 2003.
ture. Numerical examples suggest that HPD-HLFs can [11] G. Chesi, A. Garulli, A. Tesi, and A. Vicino. Solv-
be successfully employed to establish robust stability of ing quadratic distance problems: an LMI-based
systems involving parameter and state vectors of rea- approach. IEEE Trans. on Automatic Control,
sonable dimensions. 48(2):200212, 2003.
Concerning the degrees m and s of the state and the [12] G. Chesi, A. Garulli, A. Tesi, and A. Vi-
uncertain parameter vectors in the HPD-HLFs, it has cino. Parameter-dependent homogeneous Lya-
been shown and discussed how the conservativeness of punov functions for robust stability of linear time-
the proposed approach does not increase by increasing varying systems. In 43rd IEEE CDC, pp. 4095
s for fixed m and by suitably increasing both s and m. 4100, Paradise Island, Bahamas, 2004.
It is believed that these results capture the essential [13] G. Chesi, A. Garulli, A. Tesi, and A. Vicino. Ro-
features of the the trade-off between m and s. In this bust analysis of LFR systems through homogeneous
respect, an interesting open problem is to provide upper polynomial Lyapunov functions. IEEE Trans. on
bounds for these two degrees in order to prove stability. Automatic Control, 49(7):12111216, 2004.
Future research will be devoted to further enhance [14] G. Chesi, A. Garulli, A. Tesi, and A. Vicino. An
the potential of homogeneous Lyapunov functions. It LMI-based technique for robust stability analysis of
is expected that more complex uncertainty structures linear systems with polynomial parametric uncer-
and parametric uncertainty sets can be dealt with, for tainties. In D. Henrion and A. Garulli (Eds.), Pos-
example by applying approaches based on hierarchical itive Polynomials in Control, LCNIS no. 312, pp.
LMI relaxations recently proposed in [20] and [19]. 87101, Springer-Verlag, London, 2005.
[15] M. Choi, T. Lam, and B. Reznick. Sums of squares
References of real polynomials. In Proc. of Symposia in Pure
Mathematics, pp. 103126, 1995.
[1] H. L. S. Almeida, A. Bhaya, D. M. Falcao, and [16] S. Dasgupta, G. Chockalingam, B. D. O. Anderson,
E. Kaszkurewicz. A team algorithm for robust sta- and M. Fu. Lyapunov functions for uncertain sys-
bility analysis and control design of uncertain time- tems with applications to the stability of time vary-
varying linear systems using piecewise quadratics ing systems. IEEE Trans. on Automatic Control,
Lyapunov functions. Int. Journal of Robust and 41:93106, 1994.
Nonlinear Control, 11:357371, 2001. [17] P. Gahinet, P. Apkarian, and M. Chilali. Affine
[2] B. R. Barmish. New Tools for Robustness of Lin- parameter-dependent Lyapunov functions and real
ear Systems. Mcmillan Publishing Company, New parametric uncertainty. IEEE Trans. on Automatic
York, 1994. Control, 41(3):436442, 1996.

[18] J. C. Geromel and P. Colaneri. Robust stability
of time varying polytopic systems. Systems and
Control Letters, 55(1):8185, 2005.
[19] D. Henrion and J.-B. Lasserre. Convergent relax-
ations of polynomial matrix inequalities and static
output feedback. IEEE Trans. on Automatic Con-
trol, 51(2):192202, 2006.
[20] C. Hol and C. Scherer. Sum of squares relaxations
for robust polynomial semi-definite programs. In
Proc. of 15th IFAC World Congress, Prague, 2005.
[21] H. P. Horisberger and P. R. Belanger. Regula-
tors for linear time invariant plants with uncertain
parameters. IEEE Trans. on Automatic Control,
21(5):705708, 1976.
[22] Z. Jarvis-Wloszek and A. K. Packard. An LMI
method to demonstrate simultaneous stability us-
ing non-quadratic polynomial lyapunov functions.
In Proc. of 41st IEEE CDC, pp. 287292, Las Ve-
gas, Nevada, 2002.
[23] V. J. S. Leite and P. L. D. Peres. An improved LMI
condition for robust D-stability of uncertain poly-
topic systems. IEEE Trans. on Automatic Control,
48(3):500504, 2003.
[24] V. F. Montagner and P. L. D. Peres. A new LMI
condition for the robust stability of linear time-
varying systems. In Proc. of 42nd IEEE CDC, pp.
61336138, Maui, Hawaii, 2003.
[25] K. S. Narendra and J. H. Taylor. Frequency domain
criteria for absolute stability. Academic Press Inc.,
New York, 1973.
[26] P. A. Parrilo. Structured semidefinite programs and
semialgebraic geometry methods in robustness and
optimization. PhD thesis, California Institute of
Technology, 2000.
[27] D. Peaucelle, D. Arzelier, O. Bachelier, and
J. Bernussou. A new robust D-stability condition
for real convex polytopic uncertainty. Systems and
Control Letters, 40:2130, 2000.
[28] A. Trofino. Parameter dependent Lyapunov func-
tions for a class of uncertain linear systems: a LMI
approach. In Proc. of 38th IEEE CDC, pp. 2341
2346, Phoenix, Arizona, 1999.

[29] D. D. Siljak. Nonlinear Systems: Parametric Anal-
ysis and Design. John Wiley & Sons, New York,
[30] F. Wu and S. Prajna. Sos-based solution approach
to polynomial lpv system analysis and synthesis
problems. Int. Journal of Control, 78(8):600611,
[31] L. Xie, S. Shishkin, and M. Fu. Piecewise Lyapunov
functions for robust stability of linear time-varying
systems. Systems and Control Letters, 31:165171,
[32] A. L. Zelentsovsky. Nonquadratic Lyapunov func-
tions for robust stability analysis of linear uncer-
tain systems. IEEE Trans. on Automatic Control,
39(1):135138, 1994.