Professional Documents
Culture Documents
of the state w of the exosystem. Thus, the problem under considera- Let fc : d ! be any locally Lipschitz function of compact
tion includes problems of tracking as well as problems of disturbance support which agrees on (A0 ) with the function f defined in (4), i.e.,
attenuation. / a function such that, for some compact superset S of (A0 ) satisfies
The analysis in [1] was based on three standing hypotheses. The first
of these hypotheses is that the exosystem is Poisson stable, namely, the fc ( ) = 0; for all 62 S
following. f c ( ) = f ( ); for all 2 (A ):
Assumption 0: The set W r of admissible initial conditions for
0
the exosystem (2) is compact and W = w2W !(w). / Note that, by definition, there is a number C > 0 such that
Letting Z 2 E n 2 be the compact set of initial states of (1) for jf ()j C; 2 d: for all (5)
c
which the problem of output regulation is to be solved, the second hy-
pothesis is that the trajectories of the zero dynamics of (1), augmented Let now 8 ( 1 ) be the smooth vector field of d defined as
c
with (2), are bounded, namely, the following.
Assumption 1: The positive orbit of Z 2 W under the flow of
2
3
z_
= f0 (z; w) 8 c ( ) = 111
w_ = s(w ) (3) d
It follows from this assumption that the set and let 0 be the 1 2d matrix
A := !(Z 2 W )
0 0 = (1 0 1 1 1 0):
i.e., the ! -limit set—under the flow of (3)—of the set Z 2 W , is a Trivially, for any (z0 ; w0 ) 2A the function (z (t); w(t)) is such
0
nonempty, compact, invariant set which is stable in the sense of Lya-
punov and uniformly attracts Z 2 W .
that
d (z (t); w(t)) = (z (t); w(t))
dt i i+1
The third assumption was the following.
Assumption 2: There exist an integer d and real numbers
a0 ; a1 ; . . . ; ad01 such that, for any (z0 ; w0 ) 2 A0 , the solution
for i = 1; . . . ; d 0 1. If, in addition, Assumption 2-nl holds, then
(z (t); w(t)) of (3) passing through (z0 ; w0 ) at t = 0 is such that the
function '(t) := 0q (z (t); 0; w(t)) satisfies d (z (t); w(t)) = 0f ( (z (t); w(t)))
d + ad01 '(d01) + 1 1 1 + a1 '(1) + a0 ' = 0: dt d
= 0fc ( (z (t); w(t))):
( )
'
'
d + f ('; '(1) ; . . . ; '(d01) ) = 0:
( )
(4)
Moreover
_ = 8c ( ) + Gv
III. OUTPUT REGULATION VIA NONLINEAR INTERNAL MODELS
We proceed now with the construction of a controller which solves u = 0 + v (9)
the problem of output regulation for (1). To this end, consider the se-
quence of functions recursively defined as with
which, viewing v as input and as output, has relative degree 1 and a of W; Z , and 4 and of the parameter . This concludes the proof that
zero-dynamics the positive orbit of B is bounded.
To find !(B), consider now the (closed) solid cylinder C = A0 2
z_ = f0 (z; w) d . A simple argument shows that !(B) C . In fact, for any point
_ = 8c () + G(0q(z; 0; w) 0 0) p = (z; w; ) 2 !(B), there must exist sequences pk = (zk ; wk ; k )
w_ = s(w): and tk , with tk ! 1 as k ! 1, such that limk!1 (tk ; pk ) =
p. Because of the triangular structure of (12), the point (z; w) is by
The asymptotic properties of the latter are summarized in the fol- definition in A0 and, hence, (z; w; ) 2 C .
lowing results. It is immediate to see that graph( jA ) is invariant for (12). In fact,
Lemma 1: Suppose Assumptions 0, 1, and 2-nl hold. Consider the observe that, for any (z0 ; w0 ) 2 A0 , the solution (z(t); w(t)) of the top
triangular system two equations of (12) passing through (z0 ; w0 ) at time t = 0 remains
z_ = f0 (z; w) in A0 for all t 2 , because the latter is invariant for (3). Thus, bearing
in mind (8), for all such trajectories the bottom equation of (12) can be
w_ = s(w) rewritten as
_ = 8c () + G(0q(z; 0; w) 0 0): (12)
_ = 8c () + G(0(z; w) 0 0):
Let 4 d be a bounded subset such that (A0 ) int(4). Choose
numbers c0 ; c1 ; . . . ; cd01 such that the polynomial Set (t) = (t) 0 (z(t); w(t)). Then, using (6), we have
p() = d + cd01 d01 + 1 1 1 c1 + c0 _ = 8c ( + (z; w)) 0 8c ((z; w)) 0 G0: (14)
is Hurwitz, set The point = 0 is an equilibrium of this equation and, therefore,
G0 = col(cd01 ; cd02 ; . . . ; c0 ) graph( jA ) is invariant for (12). In particular, for any point p 2
graph( jA ) it is possible to find sequences pk 2 graph( jA ) and
D = diag(; 2 ; . . . ; d ) tk , with tk ! 1 as k ! 1, such that limk!1 (tk ; pk ) = p. This
and shows that graph( jA ) !(B).
G = D G0 : To complete the proof, we need to show that no point in
C n graph( jA ) can be a point of !(B). For, pick any point
Then, there is a number 3 such that, if 3 p0 2 C n graph( jA ), i.e., a point p0 = (z0 ; w0 ; 0 ) in which
graph ( jA ) = !(Z 2 W 2 4) (z0 ; w0 ) 2 A0 and 0 =6 (z0 ; w0 ). The complete orbit of (12) through
p0 is in C , because A0 is invariant under (3). Thus, the -component of
under the flow of (12). In particular, graph( jA ) is a compact in- the corresponding trajectory is such that (t) = (t) 0 (z(t); w(t))
variant set which uniformly attracts Z 2 W 2 4. obeys (14), with (0) = 6 0.
Proof: Set, for convenience, B = Z 2 W 2 4. Set
First of all, we show that the positive orbit of B is bounded, so that
!(B) is nonempty, compact, invariant and uniformly attracts B (see = D01
[1, Lemma 2.1]). To this end, set
= D01
and observe that the variable, thus, defined obeys
_ = (A 0 G0 0) 0 B1(; (z; w); ) (15)
and observe that the variable thus defined obeys
_ = (A 0 G0 0) 0 D01 Bfc (D )
with
0 G0 q(z; 0; w)
1(; (z; w); )) = 1d [fc (D + (z; w)) 0 fc ((z; w))]:
(13)
in which
111
0 1 0 0 0 Since the function fc ( 1 ) is locally Lipschitz, and bounded, there
111
0 0 0 0 0 exists a number L such that, for any 1 ; 2 2 d
A = 1 1 111 1 1 B= 1 : jfc (1 + 2 ) 0 fc (2 )j Lj1j:
0 0 111 0 1 0
0 0 111 0 0 1 Thus, for any > 1
It is seen from (5) that, for any > 1 (which we can assume without j1(; (z; w); ))j 1d LjDj Ljj:
loss of generality) and for any 2 d
On the other hand, the matrix (A 0 G0 0) is Hurwitz by construction
D01 Bfc (D )
C: and, hence, there exists a positive–definite symmetric matrix P such
Thus, the integral curves of (13) are maximally defined on the entire that
real axis. Knowing that (t) exists for any t > 0, and setting
P (A 0 G0 0) + (A 0 G0 0)T P = 0I:
u(t) = D01 Bfc (D (t))
+ G0 q(z(t); 0; w(t))
From this, it is immediately seen that the function V () = T P
system (13) can be rewritten in the form satisfies, along the trajectories of (15)
_ = (A 0 G0 0) 0 u: V_ () 0( 0 2LjP j)jj2 :
Since the matrix (A 0 G0 0) is Hurwitz by construction, and u(t) is If > 2LjP j, there exist numbers M > 0 and > 0, both depending
bounded (by some fixed number which only depends on the choice on , such that
of W and Z ), it is concluded that also j(t)
j is bounded. As a conse-
quence, (t) itself is bounded, by number which depends on the choice j(t)j Me0t j(0)j: (16)
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 12, DECEMBER 2004 2247
This property can be used to show that no point of C n graph( jA ) from which, using again the same Lyapunov function V () introduced
can be a point of ! (B ). For, suppose by contradiction that a point p0 = before and bearing in mind (19), standard arguments show that, if >
(z0 ; w0 ; 0 ), with (z0 ; w0 ) 2 A0 and 0 6= (z0 ; w0 ), be a point of maxf2LjP j; 1g, an estimate of the form
! (B ). Set
j(t)j M^ e0^ t (j(0)j + dist((z0 ; w0 ); A0 ))
d0 = j0 0 (z0 ; w0 )j: (17)
for every (0) and for every (z0 ; w0 )
As the trajectory of (12) through this point is defined for all t 2 and
holds, satisfying
bounded, there exists a number K such that j(t)j K for all t < 0.
dist((z0 ; w0 ); A0 ) 0 . From this, the result follows. /
Pick now a number T > 0 such that As shown in [1], the properties indicated in these two Lemma (which
in [1] were proven to hold under the much stronger Assumption 2)
M e0T K 0: 5 d 0 : guarantee that, if the input v of (11) is chosen as in (10), the resulting
closed-loop system has the desired asymptotic properties.
Then, using (16), we obtain As a matter of fact, the following conclusion holds.
Proposition 1: Consider (11) controlled by (10). Let Z; W be fixed
j0 0 (z0 ; w0 )j M e0T j(0T ) 0 (z(0T ); w(0T ))j compact sets of initial conditions and suppose Assumptions 0, 1, and
M e0T K 0:5 d0 2-nl hold. Pick any compact set 4 as indicated in Lemma 1 and any
closed interval E of . Choose G as indicated in Lemma 1, with
/. large enough so that the conclusions of Lemma 1 hold. Then, for every
" > 0, there exists a number k3 such that, if k k3 , the positive orbit
which contradicts (17). This concludes the proof of the Lemma.
Lemma 2: Suppose Assumptions 0, 1, and 2-nl hold. Choose G as
indicated in Lemma 1, with 3 . If A0 is locally exponentially of Z 2 W 2 4 2 E is bounded and there exists t such that je(t)j "
attractive for (3), then graph( jA ) is locally exponentially attractive for all t t. If, in addition, A0 is locally exponentially attractive for
for (12). (3), then e(t) ! 0 as t ! 1.
Proof: To say that A0 is locally exponentially attractive for (3) The proof of this proposition follows a standard paradigm. Changing
is to say that there exists positive numbers ; A; such that, for any the variable into = 0 Ge and setting k = k 0 0G yields a system
(z0 ; w0 ) in the (closed) set of the form
in which