Lecture Notes in Control and Information Sciences Edited by M.Thoma and A.VVyner
120 L. Trave, A. Titli, A. Tarras
Lar...
94 downloads
936 Views
10MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
Lecture Notes in Control and Information Sciences Edited by M.Thoma and A.VVyner
120 L. Trave, A. Titli, A. Tarras
Large Scale Systems: Decentralization, Structure Constraints and Fixed Modes
Springer-Verlag Berlin Heidelberg New York London Paris Tokyo
Series Editors M. Thoma • A. Wyner
Advisory Board L D. Davisson • A. G. J. MacFarlane • H. Kwakernaak .I.L. Massey • Ya Z. Tsypkin. A. J. Viterbi Authors Louise Trave Andre Titli Ahmed Maher Tarras Laboratoire d'Automatique et d'Analyse des Systemes du Centre National de la Recherche Scientifique Toulouse France
ISBN 3-540-50787-6 Springer-Verlag Berlin Heidelberg NewYork ISBN 0-387-50787-6 Springer-Verlag NewYork Berlin Heidelberg Library of Congress Cataloging in Publication Data Trave, L. (Louise) Large scale systems : decentralization structure constraints and fixed modes L. Trave, A. Titli, A. Tarras. (Lecture notes in control and information sciences ; 120) Bibliography: p. Includes indexes. ISBN 0-387-50787-6 (U.S.) 1. System theory. 2. Control theory. I. Titli, Andre. I1. Tarras, A. (Ahmed). II1. Title. IV. Series. Q295.T73 1989 88-35984 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in other ways, and storage in data banks. Duplication of this publication or parts thereof is only permitted under the provisions of the German Copyright Law of September 9, 1965, in its version of June 24, 1985, and a copyright fee must always be paid. Violations fall under the prosecution act of the German Copyright Law. © Springer-Verlag Berlin, Heidelberg 1989 Printed in Germany Offsetprinting: Mercedes-Druck, Berlin Binding: B, Helm, Bedin 2161/3020-543210
PREFACE
The
growing
dimensions and
c o m p l e x i t y of
the
present
day
technological,
e n v i r o n m e n t a n d societal p r o c e s s e s is one o f t h e f o r e m o s t c h a l l e n g e s to s y s t e m t h e o ry.
Determining a
solution
for
the
problems
arising
in l a r g e
scale
systems
may
become e i t h e r v e r y uneconomical o r e v e n impossible if u s i n g t h e c l a s s i c a l mathematical tools d e v e l o p e d f o r s y s t e m a n a l y s i s a n d c o n t r o l .
T h e main r e a s o n i s t h a t classical
t h e o r i e s a r e n o t b u i l t for d e a l i n g with h i g h d i m e n s i o n a l i t y models. Now, t h e e s s e n t i a l c h a r a c t e r i s t i c s of l a r g e scale s y s t e m s a r e a h u g e n u m b e r of i n p u t a n d o u t p u t v a r i a b l e s on s u b s y s t e m s w h i c h a r e g e n e r a l l y g e o g r a p h i c a l l y d i s t r i b u t e d . T h e s e new f e a t u r e s i n v o l v e l a r g e a n d complex m o d e l s , problem
may
not
be
solvable.
Moreover,
we m u s t
face
though the
modelling
economical a n d
reliability
p r o b l e m s r e l a t e d to t h e i n f o r m a t i o n t r a n s f e r b e t w e e n c o n t r o l s t a t i o n s . For t h e s e r e a s o n s , t h e d e c o m p o s i t i o n , a g g r e g a t i o n a n d model r e d u c t i o n t e c h n i c s h a v e r e c e i v e d c o n s i d e r a b l e a t t e n t i o n in t h e l a s t t e n y e a r s . A g r e a t deal of t h e o r e t i c a l a n d p r a c t i c a l r e s u l t s c o n c e r n i n g t h e i r a p p l i c a t i o n s h a v e b e e n o b t a i n e d in t h e a r e a o f stability and decentralized control.
In p a r t i c u l a r ,
t h e p r o b l e m of s t a b i l i z a t i o n a n d
pole p l a c e m e n t with d e c e n t r a l i z e d dynamic c o m p e n s a t i o n is of g r e a t p r a c t i c a l i n t e r e s t . Despite the numerous advances around
this problem,
which are
materialized by
a
l a r g e n u m b e r of p a p e r s , t h e r e is n o n e s y n t h e t i c a l s u r v e y work e x c l u s i v e l y c o n c e r n e d with t h i s p r o b l e m a n d t h e v a r i o u s o t h e r o n e s which a r e r e l e v a n t . The main o b j e c t i v e of t h i s book is to p r o v i d e s u c h global s u r v e y b y p r e s e n t i n g t h e p r e s e n t d a y r e s u l t s which can b e u s e d f o r : -the
a n a l y s i s of stabiHzability a n d pole p l a c e m e n t u n d e r d e c e n t r a l i z e d c o n s -
traints, - t h e d e t e r m i n a t i o n of a c o n t r o l policy s o l v i n g t h e p r o b l e m of s t a b i l i z a t i o n o r pole p l a c e m e n t w h e n d e c e n t r a l i z e d dynamic c o m p e n s a t i o n fails { p r e s e r v i n g a d e c e n t r a l i z e d s c h e m e of c o n t r o l o r minimizing t h e c o s t a s s o c i a t e d to t h e i n f o r m a t i o n t r a n s fer), - t h e d e s i g n of t h e s e p r e s p e c i f i e d c o n t r o l l a w s .
IV By t h i s w a y ,
t h i s b o o k s u p p l i e s t h e tools for b u i l d i n g a m e t h o d o l o g y w h i c h
b r i n g s a s o l u t i o n to t h e complete p r o b l e m of c o n t r o l in t h e c o n t e x t of l a r g e systems.
Moreover,
the last part
scale
of t h e w o r k t a k e s i n t o a c c o u n t p a r a m e t r i c a n d
structural robustness constraints. C h a p t e r I p r e s e n t s an o v e r v i e w of t h e w e l l - k n o w n r e s u l t s a r o u n d t h e p r o b l e m o f s t a b i l i z a t i o n a n d pole a s s i g n m e n t of l i n e a r t l m e - i n v a r i a n t dynamic s y s t e m s s u b j e c t e d to c e n t r a l i z e d c o n t r o l (no s t r u c t u r a l c o n s t r a i n t s ) . T h e f u n d a m e n t a l c o n c e p t s of c o n t r o l l a b i l i t y a n d o b s e r v a b i l i t y are i n t r o d u c e d a n d t h e y a r e e x t e n d e d to t h e c o n cepts of s t r u c t u r a l
controllability and
observability,
which a r e
of major p r a c t i c a l
i n t e r e s t in t h e s t u d y of l a r g e scale s y s t e m s . I n d e e d , t h e s e p r o p e r t i e s a r e e s t a b l i s h e d from t h e s y s t e m s t r u c t u r e a n d t h e y do n o t d e p e n d on t h e p a r t i c u l a r c o n f i g u r a t i o n o f the parameters I values.
In t h i s f r a m e w o r k ,
t h e p r o b l e m r e d u c e s to one of b i n a r y
n a t u r e t h a t allows f o r t h e a p p l i c a t i o n of g r a p h - t h e o r e t i c c o n c e p t s . T h i s a p p r o a c h is t h u s specially a d e q u a t e for l a r g e scale s y s t e m s . The n e c e s s a r y a n d s u f f i c i e n t c o n d i t i o n s f o r t h e e x i s t e n c e of a s o l u t i o n to t h e problem of stabilization and cases
pole a s s i g n m e n t a r e
presented
for
the
following two
:
- centralized state feedback - centralized output feedback T h e y a r e s t a t e d in t e r m s of t h e c o n t r o l l a b i l i t y a n d o b s e r v a b i l i t y p r o p e r t i e s of the system. It is c l e a r t h a t a good u n d e r s t a n d i n g of t h e
c o n c e p t s of c o n t r o l l a b i l i t y and
o b s e r v a b i l i t y is i n d i s p e n s a b l e b e f o r e p r o c e e d i n g to t h e s t u d y of t h e a b o v e p r o b l e m with s t r u c t u r a l c o n s t r a i n t s on t h e c o n t r o l . T h i s p r o b l e m i s i n t r o d u c e d in C h a p t e r II, In t h e
c o n t r o l of l a r g e s c a l e s y s t e m s w h o s e e s s e n t i a l c h a r a c t e r i s t i c is t h e i r
high dimensionality, conventional techniques
fail to
give r e a s o n a b l e s o l u t i o n s w i t h
r e a s o n a b l e c o m p u t a t i o n a l e f f o r t s . The classical c o n t r o l t h e o r y g e n e r a l l y s t a n d s on t h e assumption of a centralized information pattern ; i.e., s y s t e m is available at a g i v e n c e n t e r ,
all t h e i n f o r m a t i o n on t h e
g e n e r a l l y a g e o g r a p h i c a l p o s i t i o n , w h e r e all
t h e c a l c u l a t i o n s can b e c a r r i e d o u t . F o r most l a r g e scale s y s t e m s , t h i s c e n t r a l i z a t i o n a s s u m p t i o n d o e s n o t h o l d d u e to t h e
g e o g r a p h i c a l d i s t r i b u t i o n of t h e
information.
This new constraint leads
economical a n d r e l i a b i l i t y p r o b l e m s r e l a t e d to t h e i n f o r m a t i o n t r a n s f e r .
to
This implies
t h a t t h e c o n t r o l s y s t e m s h o u l d b e made of a n u m b e r o5 local c o n t r o l l e r s t h a t a r e only allowed to u s e p a r t o f t h e whole i n f o r m a t i o n in o r d e r to g e n e r a t e p a r t of t h e whole
V c o n t r o l . In p a r t i c u l a r ~ t h e d e s i g n of f e e d b a c k c o n t r o l l e r s r e q u i r e s r e s t r i c t i o n s on t h e p a r t i c u l a r s y s t e m o u t p u t - i n p u t p a i r s t h a t t h e c o n t r o l l e r can c o n n e c t . When no t r a n s f e r of i n f o r m a t i o n b e t w e e n t h e d i f f e r e n t local s t a t i o n s is allowed, t h i s y i e l d s to a d e c e n t r a l i z e d s c h e m e of c o n t r o l .
When some b u t
n o t all t r a n s f e r s
( t h o s e of minimum c o s t for example) a r e allowed we o b t a i n a n o n s t a n d a r d r e d u c e d information p a t t e r n . It is c l e a r t h a t t h e d e c e n t r a l i z e d c o n t r o l s c h e m e i s t h e most economically a d v a n t a g e o u s s i n c e no t r a n s f e r of i n f o r m a t i o n for one g e o g r a p h i c a l location to a n o t h e r is r e q u i r e d : system inputs are
a s s i g n e d to a g i v e n s e t of local c o n t r o l l e r s ( s t a -
t i o n s ) , w h i c h o b s e r v e only local s y s t e m o u t p u t s . This is t h e r e a s o n t h e f i r s t s t u d i e s for t h e p r o b l e m of s t a b i l i z a t i o n a n d pole a s s i g n m e n t w e r e i n v e s t i g a t e d w i t h i n a d e c e n t r a l i z e d c o n t r o l s c h e m e . T h e r e s u l t s r e f e r i n g to t h i s s t u d y a r e p r e s e n t e d in t h e f i r s t p a r t of t h e c h a p t e r . T h e s e r e s u l t s w e r e t h e n e x t e n d e d to t h e more g e n e r a l case of a r b i t r a r i l y s t r u c t u r a l l y c o n s t r a i n e d c o n t r o l w h i c h is c o n s i d e r e d in t h e s e c o n d p a r t of t h e c h a p t e r . The main c o n c e p t to deal with t h i s k i n d of p r o b l e m is t h e new n o t i o n of f i x e d modes w h i c h is
f u n d a m e n t a l in t h e
s t u d y o f s t a b i l i z a t i o n a n d pole p l a c e m e n t with
s t r u c t u r a l l y c o n s t r a i n e d dynamic c o m p e n s a t i o n . I n d e e d t
t h e e x i s t e n c e o f a solution
d e p e n d s c r i t i c a l l y on t h e p r o p e r t i e s of t h i s finite s e t of n u m b e r s . T h e p r e s e n c e o f u n s t a b l e f i x e d m o d e s i n d i c a t e s t h a t s t a b i l i z a t i o n is i m p o s s i b l e while t h e p r e s e n c e of a n y s o r t of f i x e d modes r u l e s out a r b i t r a r y pole p l a c e m e n t . Due t o t h e t h e o r e t i c a l a n d p r a c t i c a l i m p o r t a n c e o f t h e notion of f i x e d m o d e s , t h e whole C h a p t e r 3 is c o n c e r n e d with t h e i r c h a r a c t e r i z a t i o n . T h e n u m b e r of d i f f e r e n t c h a r a c t e r i z a t i o n s which can b e f o u n d in t h e s c i e n t i f i c l i t e r a t u r e i s i m p r e s s i v e . Moreover, e v e r y one of them is e x p r e s s e d in t e r m s of i t s own a u t h o r s d e f i n i t i o n s a n d i n t r o d u c e d in a d i f f e r e n t w a y . presented
in two g r o u p s ,
With t h e main o b j e c t i v e of classifieation~
t h e time-domain a n d t h e
they
are
frequency-domain characteriza-
t i o n s . A p a r t i c u l a r a t t e n t i o n is g i v e n to show t h e e x i s t i n g e q u i v a l e n c e s . The a n a l y s i s of e v e r y one of them allows u s to p o i n t o u t t h e c o n d i t i o n s for t h e e x i s t e n c e o f f i x e d modes a n d to g i v e a d e a p i n s i d e into t h e i r i n t e r p r e t a t i o n r e l a t e d to t h e i r o r i g i n s . The d i f f e r e n t t y p e s of f i x e d modes a r e o u t l i n e d : no s t r u c t u r a l l y f i x e d modes w h i c h n e e d a q u a n t i t a t i v e a n a l y s i s of t h e s y s t e m a n d s t r u c t u r a l l y f i x e d modes for w h i c h a s t r u c t u r a l a p p r o a c h is more s u i t a b l e ( r e p r e s e n t a t i o n of t h e s y s t e m b y a g r a p h , u s e o f g e n e r a l c o n c e p t s of g r a p h t h e o r y ) . From
the
above
analysis,
the
different
results
concerning
the
problem
of
d e c e n t r a l i z e d s t a b i l i z a t i o n a n d pole p l a c e m e n t a r e u n i f i e d a n d e x p r e s s e d in t e r m s o f t h e d i f f e r e n t t y p e s of f i x e d m o d e s .
VI Whereas structure
Chapter
2 makes clear
(decentralized
the existence
that
for example)
of fixed modes,
the
choice a priori
can generate
Chapter
of a feedback
some problems
3 provides
control
if it gives
all t h e n e c e s s a r y
rise
to
t o o l s to a n a l y s e
and explain the situation.
As
a
different
natural
methods
consequence,
the
following
chapters
which are available to determine
are
concerned
an acceptable
with
the
control policy such
that stabilization or pole placement is possible. In the tralized
context
control
of large
structure
scale
(Chapter
systems,
allow
to
4 presents
avoid
fixed
a
class
modes
An original approach trol.
Vibrational
thods
(based
control
compatible presence
with
decentralized
too
consider
or
constraints
fixed modes.
From another
when
fixed modes. the
based
on
Chapter
the
an
can
-
the
system
origin.
vibrational
conventional
as
it
solves
point of view,
the
me-
of lack
method
is
problem
in
a particular
a method
con-
control
because
a stabilization
that
for the
applicadesign
of
or non-linear
control laws appears
to
of structurally
fixed modes,
we m u s t
which minimizes the cost
which is of immense practical
be
constraints
of Chapter
interest,
is
5 is to present
feedback
appropriate
more
Roughly
o n t h e c o n t r o l s e e m s to b e t h e m o s t
or pole placement
characterizations
is physically
geographical
and
a new control structure
stabilization
appropriate
s i t u a t i o n we a r e d e a l i n g w i t h .
different
in u s i n g
where
constitutes
in p r e s e n c e
the structural
different
3 : one
structural
which
5.
The purpose of
that
This problem,
to s o l v e t h e
design
a
) do n o t a p p l y
control
of time-varying
we a r e
transfer.
In fact, relaxing way
from
controllers
control laws.
the problem of determining
convenient
not
cases
principles
vibrational
the subject of Chapter
are
such
5).
time-varying
: it c o n s i s t s
in the
control is presented
of the information
for
developed
that
time-varying
difficult
they
or feedforward
When the implementation be
that
decentralization
of unstable
tion of vibrational
decentralized
a decen-
a new control structure
is minimum (Chapter
can be useful
It is shown the
i s to p r e s e r v e
laws are examined and compared.
is then
on feedback
of measurements.
of
provided
Several kinds of time-varying
objective
4) o r t o d e t e r m i n e
that the cost of the information transfer Chapter
the
the
control of
fixed
than
speaking,
partitioned
locations of the inputs
different
structure. modes
another two types
in several and
problem
methods
are
presented
depending
on
of situations
due
In this
of
available methods
These
which
stations,
outputs.
in presence
the
type
are in of
can occur
:
for example
to
case,
it is clear
Vll
that the decentralized structure
would b e t h e m o s t a p p r o p r i a t e .
O u r goal i s t h u s to
d e t e r m i n e t h e minimal i n f o r m a t i o n e x c h a n g e s b e t w e e n s t a t i o n s w h i c h g e t r i d of f i x e d modes.
The
optimality
criterion
can
be
chosen
as
the
number
of f e e d b a c k
links
b e t w e e n two d i f f e r e n t s t a t i o n s o r a s t h e c o s t a s s o c i a t e d with t h e i m p l e m e n t a t i o n of these feedback Hnks,
-
present
either the system does not reflect a prespecified partitioning or the stations the
particularity
that
the
cost
of local
f e e d b a c k s is n o t n e g l e c t a b l e w i t h
r e s p e c t to t h e c o s t of f e e d b a c k s b e t w e e n two d i f f e r e n t s t a t i o n s . I n t h e s e c a s e s , w a n t to d e t e r m i n e t h e minimal c o n t r o l s t r u c t u r e s
(if s e v e r a l )
we
for which t h e s y s t e m
h a s n o f i x e d m o d e s . T h e y do n o t g e n e r a l l y i n v o l v e all t h e local f e e d b a c k s .
Note
that
the
problem resulting
from t h e
second
s i t u a t i o n is more g e n e r a l .
I n d e e d , we a r e b r o u g h t b a c k to t h e f i r s t p r o b l e m b y s e t t i n g to z e r o t h e c o s t s a s s o dated
to t h e local f e e d b a c k s .
Therefore,
all t h e m e t h o d s w h i c h a r e p r e s e n t e d i n t h i s
g e n e r a l f r a m e w o r k c a n also b e u s e d f o r t h e p a r t i c u l a r c a s e .
As a logical following to t h e d e t e r m i n a t i o n of a d e q u a t e f e e d b a c k c o n t r o l s t r u c tures,
Chapter
structural techniques.
6 c o n s i d e r s t h e p r o b l e m of t h e
constraints.
It p r o v i d e s
synthesis
of f e e d b a c k
an o v e r v i e w of a p p r o p r i a t e
C o n s i d e r a t i o n s on the r o b u s t n e s s
gains under
near-optimal design
o f s u c h c o n t r o l l e r s a r e also i n c l u d e d ,
in t h e s e n s e t h a t u n c e r t a i n t i e s d u e to p a r a m e t e r v a r i a t i o n s o r e x t e r n a l d i s t u r b a n c e s are considered.
T h e e f f e c t s of s t r u c t u r a l
t u a t o r s , line c u t s . . . )
Chapter robustness.
7,
perturbations
( f a i l u r e of s e n s o r s
ac-
are studied later.
and
the
last
one,
approaches
indeed
the
problem
of
structural
The chapter extends the results concerning decentralized or structurally
c o n s t r a i n e d c o n t r o l s y s t e m s to s y s t e m s s u b j e c t e d to s t r u c t u r a l f a i l u r e s of s e n s o r s
or
actuators
S e v e r a l w a y s to c o n c l u d e on t h e r o b u s t n e s s are presented.
perturbations,
mamely
or c u t s of l i n e s i m p l e m e n t i n g f e e d b a c k - l o o p s .
n o t i o n s of s t r u c t u r a l l y r o b u s t c o n t r o l a n d s t r u c t u r a l l y r o b u s t structure,
or
of a c o n t r o l ,
The
modes are introduced.
knowing its prespecifled
T h e y a p p e a r a s a n e x t e n s i o n of w e l l - k n o w n r e s u l t s d e r i v e d
from f i x e d m o d e s c h a r a c t e r i z a t i o n s . At l a s t , a g r a p h - t h e o r e t i c
algorithm is presented
to d e t e r m i n e t h e i n f o r m a t i o n p a t t e r n o f a r o b u s t r e g u l a t o r w i t h minimum c o s t . Through ples
an the book,
which make easier
collection of p a c k a g e s book
their
e v e r y r e s u l t is i l l u s t r a t e d b y small s i g n i f i c a t i v e e x a m understanding.
corresponding
( e v a l u a t i o n of f i x e d m o d e s ,
trained structure
Moreover,
the
appendices
contain
to some i m p o r t a n t a l g o r i t h m s p r e s e n t e d
d e t e r m i n a t i o n of t h e i r
feedback matrices...).
type,
a
in t h e
c a l c u l a t i o n of c o n s -
Vlll T h i s b o o k i s t h e c o n s e q u e n c e o f an i n t e n s i v e r e s e a r c h a c t i v i t y of s e v e r a l y e a r s in t h e a r e a o f a n a l y s i s a n d c o n t r o l o f l a r g e s c a l e s y s t e m s a n d more p a r t i c u l a r l y in d e c e n t r a l i z e d c o n t r o l in t h e
Lahoratoire
d'Automatique et
d'Analyse des
Syst~mes
(LAAS). T h e a u t h o r s would like to e x p r e s s t h e i r g r a t i t u d e to all t h e c o l l e a g u e s of t h e i r r e s e a r c h g r o u p a n d to t h e D i r e c t o r of t h e LAAS, P r o f e s s o r A.
COSTES,
for their
scientific and financial s u p p o r t . The a u t h o r s s i n c e r e l y t h a n k Miss C.
FABRE f o r t y p i n g
all t h e s e p a g e s a n d
Mr. E. LAPEYRE-MESTRE for t h e d r a w i n g s of t h i s b o o k ,
Toulouse, January 1989
Louise T R A V E Andr~ TITLI Ahmed TARRAS
TABLE
OF
CONTENTS
INTRODUCTION
CHAPTER
1. C E N T R A L I Z E D
CONTROL
: STABILIZATION
AND
POLE
ASSIGNMENT
I.I. - Introduction 1.2. - Controllahility a n d observablllty
Stability
1 . 2 . I.
-
1.2.2.
-
Controllability
1.2.3.
-
Observability
1.2.4.
- Kalman's canonical form
1.2.5. - Practical importance of the concepts of controllability a n d B
observability
8
1.2.6.
-
Stabilization a n d pole a s s i g n m e n t
1.2.7.
-
Origins of uncontrollable a n d u n o b s e r v a b l e
10
modes
14
1.3. - Structural controllability a n d observability
15
I. 3. I. - Structural controllability 1.3.2. - General results o n structural controllability a n d observability
19
I. 3.3. - Computational
20
considerations
31
I. 4. - Conclusion
CHAPITER POLE
2. S T R U C T U R A L L Y
CONSTRAINED
CONTROL
• STABILIZATION
AND
ASSIGNMENT
2.1. - Introduction
33
2.2. - Decentralized structural constraints
34
2.2. I. - P r o b l e m
formulation
35
2.2.2. - Decentralized fixed m o d e s
37
2.2.3. - Decentralized stabilization a n d pole a s s i g n m e n t
39
X 2.3. - A r b i t r a r y
50
structural constraints
53
2.4. - Evaluation of fixed m o d e s
2.4.1.
- By
the spectra
comparing
of t h e o p e n - l o o p
and closed-loop dynamic
matrix
53
2.4.2.
- By
calculation of the s y s t e m
2.4.3.
- Concluding
modes
sensitivity
remarks
60
2. S. - C o n c l u s i o n
CHAPITER
61
3. C H A R A C T E R I Z A T I O N
OF
FIXED
MODES
3. I. - Introduction
62
3.2. - Characterization
in t e r m s of transmission
3.2.1.
- T a r o c k ' s results
3.2.2.
- Hu
and
66
and
67
Wiswanadham
70
results
71
- Seraji's results
3.2.5. - D a v i s o n 3.2.6.
63
zeros
Jiang results
B.2.3. - V i d y a s a g a r 3.2.4.
and
Wang
72
results
75
- Comments
3.3. - Algebraic characterizations
3.3.1.
- Matrix rank
3.3.2.
- Recursive
3.3.3.
- Particular cases
75
: time d o m a i n
75
test characterization
80
characterization
83 87
3.3.4. - C o m m e n t s
3.4. - A l g e b r a i c
3.4.1.
characterizations
- Necessary
- Transfer distinct
3.5.
: frequency
88
function matrix for 88
of f i x e d m o d e s
function matrix characterization
for systems with 91
poles
3.4.3.
- Polynomial matrix rank
3,4.4.
- General transfer
3.4.5.
- Interpretation
- Structurally
domain
conditions on the transfer
the existence 3.4.2,
54
fixed modes
test characterization
function matrix characterization
94 95 102
104
XI 3.5.1,
- Preliminaries
3,5.2,
- Controllability
104
information 3,5.3,
-
3.5.4.
- Evaluation
observability
under
decentralized
111
structure
Characterization
of structurally
of structurally
structural 3.5.5.
and
sensitivity
fixed
fixed
of the
modes
modes
modes
by
of the
I19
calculation
of the
system
130
- Comments
135 137
3.6. - Graph-theoretic characterization of fixed m o d e s
3.6.1.
- Preliminaries
3.6.2,
- Frequency
3.6.3.
- Time
3.6.4.
- Comments
137 domain
domain
graph-theoretic
graph-theoretic
137
characterization
characterization
141 147
3.7. - Conclusion
CHAPTER
FIXED
4,1.
- Introduction
4.2.
-
4.3.
- Use
4.5.
STABILIZATION
4. D E C E N T R A L I Z E D
STRUCTURALLY
4.4.
148
Sample
IN P R E S E N C E
OF
NON
MODES
150
and
hold
of time-varying
T52 controllers
156
4.3.1. - Piecewise constant f e e d b a c k laws
156
4.3.2. - Sinusoidal f e e d b a c k laws
158
4.3.3. - C o n c l u d i n g r e m a r k s
160
- Vibrational
161
control
4.4. i. - Vibrational control principle
161
4.4.2. - Stabilization b y vibrational control
167
4.4.3. - Vibrational f e e d b a c k control laws
169
175
- Conclusion
CHAPTER
5. C H O I C E
OF
FEEDBACK
CONTROL
STRUCTURE
TO
AVOID
FIXED
MODES
5.1.
- Introduction
177
Xll 5.2.
5.3.
5.4.
- Relaxing
prespecified
5.2.1.
-
Preliminaries
5.2.2.
-
llang
5.2.3.
- Armentano
and
feedback
and based
5.2.5. - S p e c i f i e d
approach
- Choice
of minimal
179
procedure
Singh'
5.2.4. - A p p r o a c h
- Concluding
178 178
Davison'
5.2.6.
constraints
182
procedure
on the for
system
modes
structurally
186
sensitivity
fixed
modes
of type
(i)
197
remarks
control
190
197
structures
5.3.1.
- Preliminaries
5.3.2.
- Senning's a p p r o a c h
198
5.3.3.
- Locatelli
202
5.3.4.
-
5.3.5.
- Concluding
197
et al.
Specified
approach
approaches
for
structurally
fixed
modes
205
remarks
227
- Conclusion
CHAPTER
227
6. D E S I G N
6.1.
- Introduction
6.2.
- The
TECHNIQUES
- PARAMETRIC
ROBUSTNESS
229
optimization
6.2.1.
- Dynamic
6.2.2.
- Static
6.2.3.
- Necessary
problem
229
controllers
230
controllers
231
conditions
for optimality
- Gradient
matrix
233
calculation
6.3.
6.4.
- Decentralized
control
with
parameter
6.3.1.
- The
algorithm
of Geromel
6.3.2.
- The
algorithm
of Jamshidi
optimization
and
236
Bernussou
236 241
6.3.3.
- Iterative
procedure
of Chen
6.3.4.
- Iterative
procedure
of Geromel
et al.
6.3.5.
- Comments
- Design
of robust
6.4.1.
- Controllers
6.4.2.
- Optimal
242
and
Peres
245 247
decentralized
with
control
controllers
a prescribed with
247
degree
performance
of stability
index
sensitivity
248
reduction
249
XlII 6.4.3. - R o b u s t
control with respect to large perturbations
i n the
system dynamics
6.5. - R o b u s t
255
decentralized s e r v o m e c h a n i s m
260
problem
6.5.1. - P r o b l e m formulation
260
6.5.2. - Existence of a solution
262
6.5.3. - R o b u s t
264
decentralized controller design
267
6.5.4. - Sequentially stable robust controller design 6.5.5. - R o b u s t
decentralized controller for u n k n o w n
systems
270
273
6.6. - Decentralized control via hierarchical calculation
6.6.1. - Three-ievel calculation algorithms
273
6.6.2. - Two-level calculation algorithm
279
6.7. - Calculation m e t h o d s using a n interconnection m o d e l
6.7. I. - T h e
general interconnecfion
282 282
model
285
6.7.2. - Model-following m e t h o d
6.8. - Decentralized control for s y s t e m s with overlapping
6.8.1. - E x p a n s i o n ,
contraction,
6.8.2. - O v e r l a p p i n g
information set
a n d inclusion
289
decomposition
291
295
6.9. - Conclusion
CliAPTER
289
7. S T R U C T U R A L
ROBUSTNESS
7.1.
- Introduction
7.2.
- Structural
perturbations
affecting
the system
297
7.3.
- Structural
perturbations
affecting
the control system
299
296
7.3.1. - S t r u c t u r a l
perturbations
7.3.2.
- Structural
robustness
7.3.3.
- Characterization
7.3.4.
- Example
7.3.5.
- Structurally
characterization
299 303
of structurally
robust
modes
304 310
robust
information pattern
control design
- T h e c h o i c e of t h e 313
XIV 7.4.
- Conclusion
318
APPENDIX
I, Multivariable system zeros
319
APPENDIX
2. A Fortran subroutine to evaluate the fixed modes using open-loop
321
and closed loop system poles
APPENDIX
3. A Fortran routine to evaluate the fixed modes using their sensitivity 330
A P P E N D I X 4. A n d e r s o n
and Clements'
A P P E N D I X 5. D e t e r m i n a t i o n using variations
A P P E N D I X 6, A F o r t r a n
test package
of the gradient
for real modes
m a t r i x of t h e p e r f o r m a n c e
340 index by
calculus
routine
with possible robustness
346
to d e t e r m i n e requirements
an optimal constrained
feedback
matrix 349
REFERENCES
368
AUTHOR
379
SUBJECT
INDEX
INDEX
382
I
CHAPTER
CENTRALIZED
STABILIZATION
CONTROL
AND
POLE
:
ASSIGNMENT
I.I. - I N T R O D U C T I O N
The
g e n e r a l i n t r o d u c t i o n p o i n t e d out
control p r o b l e m s are
characterized by
that,
very
structurally
often,
large
scale systems
constrained feedback patterns.
Before t a k i n g i n t o a c c o u n t t h e s e new r e q u i r e m e n t s , t h i s c h a p t e r p r e s e n t s an o v e r view of t h e w e l l - k n o w n r e s u l t s c o n c e r n e d b y t h e p r o b l e m of s t a b i l i z a t i o n a n d pole a s s i g n m e n t of a l i n e a r t i m e - i n v a r i a n t dynamic s y s t e m s u b j e c t e d to c e n t r a l i z e d c o n t r o l (no s t r u c t u r a l c o n s t r a i n t s ) .
The f u n d a m e n t a l c o n c e p t s of c o n t r o l l a b i l i t y a n d o b s e r -
vability a r e i n t r o d u c e d a n d e x t e n d e d to t h e c o n c e p t s o f s t r u c t u r a l c o n t r o l l a b i l i t y a n d o b s e r v a b i l i t y which a r e
of a major p r a c t i c a l i n t e r e s t
in t h e
study
of l a r g e
scale
s y s t e m s . I n d e e d , t h e s e p r o p e r t i e s a r e e s t a b l i s h e d from t h e s y s t e m s t r u c t u r e a n d do not d e p e n d on t h e p a r t i c u l a r c o n f i g u r a t i o n of t h e p a r a m e t e r s ' v a l u e s .
In t h i s f r a -
mework, t h e p r o b l e m r e d u c e s to one of b i n a r y n a t u r e t h a t allows f o r t h e a p p l i c a t i o n of g r a p h - t h e o r e t i c c o n c e p t s .
This
a p p r o a c h is t h u s
especially adequate
for
large
scale systems.
T h e n e c e s s a r y a n d s u f f i c i e n t c o n d i t i o n s for t h e e x i s t e n c e o f a s o l u t i o n to t h e problem of s t a b i l i z a t i o n a n d
pole
assignment are
presented
for t h e
following two
cases :
-
centralized state feedback
- centralized output feedback T h e y a r e s t a t e d i n t e r m s of t h e c o n t r o l l a b i l i t y a n d o b s e r v a b i l i t y p r o p e r t i e s o f the system. It is c l e a r t h a t a good u n d e r s t a n d i n g
of t h e c o n c e p t s of c o n t r o l l a b i l i t y a n d
o b s e r v a b i l i t y is i n d i s p e n s a b l e b e f o r e p r o c e e d i n g to t h e s t u d y of t h e a b o v e p r o b l e m with s t r u c t u r a l c o n s t r a i n t s on t h e c o n t r o l .
2 1.2. - C O N T R O L L A B I L I T Y
AND
OBSERVABILITY
(FOS-77)
(KAI-80)
C o n s i d e r t h e l i n e a r t i m e - i n v a r i a n t dynamic s y s t e m d e s c r i b e d b y t h e following s t a t e - s p a c e model : x(t) = A x(t) + B u(t)
y(t)
= c x(t)
where x ( t ) ~
(1.2.1)
R n, u(t) 6 R m a n d y(t) ~ R r are the state, input and output vectors
respectively, and A, B and C are invariant matrices of appropriate dimensions.
1 . 2 . 1 . - S t a b i l i t y (WIL-70) Definition I . I .
The a u t o n o m o u s s y s t e m ( 1 . 2 . 1 )
a n y g i v e n v a l u e e > 0, t h e r e e x i s t s a n u m b e r
]l X (to)]l (
($I ==> ]Ix(t) ] < E:
(i.e. ~l(e,
f o r all
with u ( t )
= 0) is s t a b l e if for
t0) > 0 s u c h t h a t :
t>t 0
The autonomous s y s t e m ( 1 . 2 . 1 ) is aymptotically s t a b l e if : (i) - it is s t a b l e
(ii)-~
x
(to),
x(t)
~ 0 t -==b0o
It is w e l l - k n o w n t h a t t h e s o l u t i o n of t h e e q u a t i o n s
(1.2.1)
with u ( t ) =
0 is
given by : x(t) = eA(t-t0 ) x 0 Given
{X1,
....
Xn}
t h e s e t of e i g e n v a l u e s o f A, s y s t e m ( 1 . 2 . 1 ) with u ( t ) = 0 is
a s y m p t o t i c a l l y s t a b l e if a n d o n l y if all t h e e i g e n v a l u e s of A h a v e a n e g a t i v e r e a l part. In the opposite case, the state space X can be split into the stable subspace X S which is generated b y the set of eigenvectors associated with the stable eigenvalues and the unstable subspace X U which is generated b y the set of eigenvectors
associated with the
unstable
c o n v e r g e s t o w a r d z e r o . For
eigenvalues.
For
x ( t 0) £ X S,
the system response
x ( t 0) ~ X U, the s y s t e m r e s p o n s e d i v e r g e s .
3 I. 2.2. - Controllability
Definition 1.2. A state x I is said to be controllable at time t O if for every initial state x 0 defined at time t0, there exists a control u(t) that transfers the system from the state x 0 to the state x I in a finite time If every said to be equivalent The are stated
state of the system that the pair
necessary
and
1.1.
The
system
following conditions
holds
(1.2.1)
generate 2. such
AB
-
conditions
Note that
is of rank
n
products n),
(1.2.1)
to b e c o n t r o l l a b l e
if a n d
only if either
of the
two
The columns of the controllability
matrix
:
rank
criterion <w i ,
~C = n . (KAI-80).
There
bj> a r e n o n z e r o ,
exists
j £
(1 . . . . .
m}
w h e r e bj i s t h e j t h c o l u m n
of A.
i s n o t U m i n i m a l ' . More o f t e n t h a n n o t ,
i t will t u r n
:
AB . . . . . for
system
are the left eigenvectors
KahnanWs c r i t e r i o n
out that the matrix
#C = (B,
....
for
is controllable
(KAL-62).
Popov-Belevitch-Hantus
(i=l,
is
this is
An-IB)
. . . . .
all t h e s c a l a r
of B and wi,
the system
(1.2.1),
:
a space of dimension n, i.e.,
that
t o may be, For system
:
1. - KalmanWs c r i t e r i o n ~C = ( B ,
controllable.
( A , B) i s c o n t r o l l a b l e .
sufficient
in the following theorem
Theorem
is controllable whatever
"completely controllable ~ or just to s t a t i n g
(tl-t0).
somev
A~-IB) less
than
n.
The
smallest
such
x),
say
~c'
will t h e n
be
called the controllability index.
Popov-Belevitch-Hantus may be restated The system
Rank
where
criterion
may be more convenient
in some cases since it
in the following form • (1.2.1)
(~I-A B) = n
is controllable if and only if :
V ~ E
o (A)
o (.) denotes the set of eigenvalues of (.).
(1.2.2)
In t h i s new formj t h i s c r i t e r i o n i n t r o d u c e s t h e d e f i n i t i o n o f a c o n t r o l l a b l e pole ( e i g e n v a i u e of A) as a pole f o r w h i c h c o n d i t i o n ( 1 . 2 . 2 ) h o l d s . The c o m p o n e n t s of e v e r y s t a t e x ~ X of t h e s y s t e m can b e p a r t i t i o n e d s u c h t h a t : x = x c ~ Xun c w h e r e x c G X C a n d Xun c ~ XUN C. X C (XuN C) is t h e c o n t r o l l a b l e ( u n c o n t r o l l a b l e ) s u b s p a c e g e n e r a t e d b y t h e e i g e n v e c t o r s a s s o c i a t e d to the controllable
(uncontrollable)
e i g e n v a i u e s o f A.
It
can t h e n b e s h o w n t h a t t h e
e q u a t i o n s ( 1 . 2 . 1 ) can t a k e t h e form :
L unc.j
[:llu
A22
k uncd w h e r e i t a p p e a r s t h a t t h e c o m p o n e n t s o f XUN C a r e n o t c o n n e c t e d to t h e i n p u t . From t h i s p o i n t of viewj P o p o v - B e l e v i t c h - H a n t u s c r i t e r i o n g i v e s a d e e p i n s i g h t i n t o t h e c o n t r o l l a b i l i t y p r o p e r t i e s of t h e s y s t e m .
K a h n a n ' s c r i t e r i o n is s u i t a b l e for
c h e c k i n g t h e global c o n t r o I l a b i l i t y o n l y .
1.2.3.
-
Observabllity
Definition 1 . 3 .
A s t a t e x ( t 0 ) = x 0 is said to b e o b s e r v a b l e at time t O if it can b e
d e t e r m i n e d from t h e k n o w l e d g e of t h e i n p u t u ( t ) a n d of t h e o u t p u t y ( t ) o v e r a finite i n t e r v a l of time ( t 0 , t 1) . I f e v e r y s t a t e of t h e s y s t e m is o b s e r v a b l e w h a t e v e r t o may b e , t h e s y s t e m i s s a i d to be "completely o b s e r v a b l e n o r j u s t o b s e r v a b l e .
For system (1.2.1),
t h i s is
e q u i v a l e n t to s t a t i n g t h a t t h e p a i r ( C , A ) is o b s e r v a b l e . The n e c e s s a r y a n d s u f f i c i e n t c o n d i t i o n s for s y s t e m
(1.2.1)
to b e o b s e r v a b l e
a r e s t a t e d in t h e following t h e o r e m ." T h e o r e m 1.2.
T h e system ( 1 . 2 . 1 )
is o b s e r v a b l e if a n d o n l y i f e i t h e r
of t h e
following c o n d i t i o n s h o l d s : 1. - K a h n a n ' s c r i t e r i o n ( K A L - 6 2 ) . T h e r o w s of t h e o b s e r v a b i L i t y m a t r i x :
two
~D - C A
n-1
generate
a space of dimension n, i.e.,
2.
- Popov-Belevitch-Hantus
such that and vi,
criterion
all t h e s c a l a r p r o d u c t s
(i=l,
ooo, n ) ,
¢O = n . (KAI-80).
There
a r e n o n z e r o ,
are the right
As for controllability,
rank
eigenvectors
i t will g e n e r a l l y
turn
exists
j ~ {1 . . . . .
r}
w h e r e cj i s t h e j t h r o w o f C
of A.
out that the matrix
:
EJ CA
~0
=
A v-
i s of r a n k
n
for
some ~ less
called the observability
than
n.
The
smallest
such
x~, s a y ~ , will t h e n 0
be
index.
In the observability
case,
Popov-Belevitch-Hantus
criterion
may be restated
in
the following form :
The system
(1.2.1)
is observable
if and only if :
IXI-A] = n
and an observable
Xun °
where
(unobservable) (unobservable) observability
of every
xo
subspace
E
state
XO and generated
eigenvalues puts
(1.2.3)
pole is defined as a pole for which condition
The components x0 ~
~4X~c (A)
equations
of A. (1.2.1)
of the system X u n ° ~"
can be partitioned
XUN O .
XO
by the eigenvectors The
(1.2.3)
decomposition
( X u N O) associated
of the
in the following form :
is
holds. such
that
x =
the
observable
to t h e
observable
system
with regard
to
:o]
rail
•u n ° /
LA21
y
[Oo] [] Xun
o
+
A22
= [C1
u
B2
O] [Xo0 Xun]
w h e r e it is clear t h a t t h e c o m p o n e n t s of XUN O a r e n o t c o n n e c t e d to t h e o u t p u t . The
obvious
analogy
between
theorems
between the concepts of controllability and
1.1
and
1.2 p o i n t s out
observability.
the
Two s y s t e m s a r e
duality called
dual if t h e y a r e d e f i n e d r e s p e c t i v e l y b y t h e e q u a t i o n s : = A x + B u
[x* =
A' x* + C' u*
S* :
S • y
C x
~y*
= B' x*
T h e s e s y s t e m s a r e s u c h t h a t , if S is c o n t r o l l a b l e , S* is o b s e r v a b l e a n d vice v e r s a . It is t h u s
p o s s i b l e to c h e c k t h e o b s e r v a b i l i t y of a s y s t e m b y e x a m i n i n g t h e c o n -
t r o l l a b i l i t y of t h e dual s y s t e m .
1.2.4. - K a l m a n ' s c a n o n i c a l form
(KAL-62)
In view of p a r a g r a p h s 1 . 2 . 2
a n d 1 . 2 . 3 , it follows t h a t t h e s t a t e - s p a c e X can
be decomposed into four s u b s p a c e s such that :
X = X1 • X2 • X3 • X4
where :
X 1 = X C n XUN O Xz = XC n XO x 3 = XUN C
n XUN O
X 4 = XUNC
n XO
(controllable and unobservable subspace) (controllable and observable subspace) (uncontrollable and unobservable subspace) (uncontrollable and observable subspace)
Kalman (KAL-62) s h o w e d t h a t t h e r e e x i s t s a r e a l , r e g u l a r t r a n s f o r m a t i o n m a t r i x s u c h that the system (1.2.1)
can be p u t in t h e following canonical form •
x2 x3
y
jail =
0 o 0
=[o
]
AI2
A13
A22
0
A2~ /
0
A33
A3~"[
o
0
A44J
C2
[Xl] x2
x3
B2
+
(1.2.4)
x4
I
x I x2 x 3
x4]
i l l u s t r a t e d b y f i g u r e 1.1 :
w
Fig. 1.1.
: C a n o n i c a l d e c o m p o s i t i o n of a l i n e a r t i m e - i n v a r i a n t s y s t e m
S t a r t i n g from t h e c a n o n i c a l f o r m , t h e t r a n s f e r
f u n c t i o n m a t r i x of t h e s y s t e m
is :
Y(p) W(p) = U(p) = C2 [pl- A22 ]-1 B2
(p : Laplace v a r i a b l e )
in w h i c h o n l y t h e s i m u l t a n e o u s l y c o n t r o l l a b l e a n d o b s e r v a b l e poles a r e p r e s e n t . Note t h a t t h e poles of t h e s y s t e m c o r r e s p o n d i n g to t h e e i g e n v a l u e s of A l l , a n d A44 ( t h e n o n s i m u l t a n e o u s l y u n c o n t r o l l a b l e a n d u n o b s e r v a b l e p o l e s ) condition :
rank
= n
easily d e r i v e d from t h e P o p o v - B e l e v i t c h - H a n t u s c r i t e r i o n ( 1 . 2 . 2 )
A22
verify the
and (1.2.3).
8 1 . 2 . 5 . - Practical importance of the c o n c e p t s of controllability a n d o b s e r v a b i l i t y (FOS-77) It is n o w i n t e r e s t i n g to e x a m i n e t h e c o n s e q u e n c e s o f t h e e x i s t e n c e of u n c o n t r o l l a b l e a n d u n o b s e r v a b l e m o d e s on t h e b e h a v i o u r of t h e s y s t e m .
T h e s e few follo-
wing r e m a r k s c o n s i d e r several cases and point out the practical importance of the c o n c e p t s of c o n t r o l l a b i l i t y a n d o b s e r v a b i l i t y .
Remark 1.1.
As s h o w n i n p a r a g r a p h
to t h e i n p u t .
p e n d e n t l y of t h e c o n t r o l i n p u t , Its
1 . 2 . 3 , a n u n c o n t r o l l a b l e mode i s n o t c o n n e c t e d
T h e r e s p o n s e a s s o c i a t e d w i t h s u c h mode will t h u s e v o l v e in time i n d e -
e v o l u t i o n will d e p e n d
w h e t h e r in o p e n - l o o p o r
closed-loop configuration.
o n l y on t h e mode d y n a m i c s a n d t h e c o r r e s p o n d i n g i n i t i a l
conditions.
Remark 1.2.
C o n s i d e r t h a t a n u n c o n t r o l l a b l e mode is u n s t a b l e .
t h e u n s t a b i l i t y will a p p e a r at t h e o u t p u t a n d will t h u s the
fact
that
the
If it is o b s e r v a b l e ,
be detectable.
Nevertheless,
mode is u n c o n t r o l l a b l e e x c l u d e s all p o s s i b i l i t y of s t a b i l i z i n g t h e
s y s t e m . What is r e q u i r e d is n o t a c o n t r o l law b u t a m o d i f i c a t i o n of t h e s y s t e m s t r u c ture.
Remark 1.3.
C o n s i d e r now t h e c a s e f o r w h i c h a n u n s t a b l e mode is n o t o b s e r v a b l e .
T h e u n s t a b l e d y n a m i c s of t h i s mode will n o t a p p e a r on t h e o u t p u t , s e e n in p a r a g r a p h e
s i n c e we h a v e
1 . 2 . 4 t h a t u n o b s e r v a b l e m o d e s a r e n o t c o n n e c t e d to t h e o u t p u t .
T h e s y s t e m m a y t h u s be o b s e r v e d a s s t a b l e . N e v e r t h e l e s s p t h e i n t e r n a l u n s t a b i l i t y of t h e s y s t e m may come to e i t h e r a b r e a k - u p
o f t h e s y s t e m o r t h e a p p e a r e n c e of a n o n
l i n e a r f u n c t i o n ( s a t u r a t i o n ) so t h a t t h e l i n e a r model is n o l o n g e r v a l i d . These
remarks
strength
the
importance
of
having
criteria
which
allow
the
d e t e c t i o n of u n c o n t r o l l a b l e a n d u n o b s e r v a b l e m o d e s w h e n c o n s i d e r i n g s y s t e m c o n t r o l
problems.
1.2.6. - Stabilization and pole assignment The
problem
system (1.2.1)
of
(i.e.,
stabilization
is
(BRA-70)
formulated
(WON-67) as
follows :
given
h a v i n g some p o l e s w i t h p o s i t i v e r e a l p a r t s ) ,
the
unstable
find a controller
o f t h e form : u = K y
(1.2.5)
such that the closed-loop system : x ( t ) = (A + B K C ) is s t a b I e ;
i.e.
(1.2.6)
x(t)
e v e r y e i g e n v a l u e of t h e c l o s e d - l o o p d y n a m i c m a t r i x (A + BKC) h a s a
negative re~ part.
1,2.6.a.
- State feedback control
First consider the case for which every
s t a t e of t h e s y s t e m
(1.2.1)
can b e
measured, what can be expressed by : C = I n ( I d e n t i t y m a t r i x of o r d e r n x n ) y=x T h e f e e d b a c k c o n t r o l t h e n t a k e s t h e form : u = K x
System
(1.2.1)
(1.2.7)
is s t a b i l i z a b l e u s i n g s u c h a c o n t r o l law if a n d o n l y i f t h e u n s t a b l e
s u b s p a c e X U ( s e e § 1 . 2 . 1 ) is i n c l u d e d in t h e c o n t r o l l a b l e s u b s p a c e X C ( s e e § 1 . 2 . 2 ) and every
pole of ( 1 . 2 . 1 )
can be arbitrarily
c o n t r o l l a b l e . T h i s is c l e a r l y u n d e r s t a n d a b l e However,
more o f t e n t h a n n o t ,
assigned
if a n d o n l y if
(1.2.1)
is
from t h e d e f i n i t i o n of c o n t r o l l a b i l l t y .
t h e s t a t e s a r e n o t d i r e c t l y a v a i l a b l e from t h e
measurements and additional conditions are required.
1.2.6.b.
- Output feedback control
With a c o n t r o l law of t h e (1.2.1)
(see
~2 ~3
form ( 1 . 2 . 5 ) ,
u s i n g t h e Kalman's c a n o n i c a l form of
1. Z. 4), t h e c l o s e d - l o o p s y s t e m is d e s c r i b e d b y : All
A12+BIKC 2
AI3
AI4+BIKC4 -
x1
o
A22 +B2K C 2
0
A24 +B2K C 4
x~
0
0
A23
A34
x3
0
o
0
A##
x~
I t is t h u s a p p a r e n t t h a t t h e c l o s e d - l o o p s y s t e m is s t a b l e if a n d o n l y if :
(i.z.8)
10 (i) t h e u n s t a b l e s u b s p a c e X U is i n c l u d e d in t h e c o n t r o l l a b l e s u b s p a c e X C a n d in t h e o b s e r v a b l e subspace X O ~ i . e . p
Stated in a different way,
the
e i g e n v a l u e s of A l l ,
A33 a n d
A44 a r e
stable.
this is equivalent to have all the unstable poles con-
trollable and observable. (ii) there exists a matrix K such that (A22 + B z K C z) is stable, what is expressed by : F2 = K C 2
and
rank (C2, F 2) = rank C 2
where F 2 is a stabilizing state feedback for the second subsystem that always exists since the second subsystem is controllable. W h e n considering arbitrary pole assignment, condition (i) is replaced by ." (i*) the system (1.2.1) is controllable and observable. When
condition (ii) cannot be verified, a dynamic output feedback control of
the form :
{
~(t) = S z(t) + R y(t)
(1.2.9)
u(t) = Q z(t) + K y(t) + v(t)
is required. Then, condition (i) is sufficient (and necessary) to stabilize the system (1.2.1) and arbitrary pole assignment is possible if and only if (1.2.1) trollable and observable (BRA-70)
showed
(condition
is con-
(i*)). In this latter case, Brasch and Pearson
that the minimal order of the required dynamic
achieve pole assignment is :min ( Vc-1 , ~o-1), where
x)c and
compensator to
~o are the controlla-
bility and observability indices, respectively.
1.2.7. - Origins of uncontrollable and unobservable modes In
order
to
show
the
mechanism
of
uncontrollability
and
unobservability,
c o n s i d e r t h e following simple example of a s i n g l e - v a r i a b l e s y s t e m t a k e n from (FOS-
77) : -2
0
-2
3
0 x +
I
l
1
1
1
0
0
(1.2.10) y
0
0
x
11 that can be r e p r e s e n t e d by t h e b l o c k - d i a g r a m of f i g u r e 1.2 :
xI
q +J
x2
x4
1.2.
Figure
Using conditions (1.2.2) and ( 1 . 2 . 3 ) , it can be easily c h e c k e d t h a t t h e mode ~1=1 is u n c o n t r o l l a b l e and ~2=-1 is u n o b s e r v a b l e :
o
0 3
o o
o
-2-1 3
-I
-1
0
0
0
-I
-1
o
2 rank [M-A
B]kl=l
:
rank
rank[1i-A
= rank
=-I
4
o
0
1
o
o
1
-1
-2
o
-1
-1
o
2
0
o
0,5
0.5
o 0 -
o
o
=3
<4
o
=3<4
This system is composed of two s u b s y s t e m s in cascade and can be r e w r i t t e n in the e q u i v a l e n t form of f i g u r e 1.3.
:
p+l
(p+~) (p-l)
(p+l) (p+2) F i g u r e 1.3.
~_4~ Y
12 where
it a p p e a r s
that
the
uncontroUability
cancellation of a pole of one transfer
and
the
unobservahiltty
result
from the
function by a zero of the other and vice versa.
In fact, if the cancellation is of the form : 1 - "zero upstream,
pole downstream",
2 - npole upstreamt
z e r o d o w n s t r e a m n, i t i n d u c e s
From this not appear
result,
it follows that
it induces
uncontrollability unobservability
the uncontrollable
as poles of the global transfer
a s f o r ~1=1. as for
and unobservable
function of the system
~,2=-1.
m o d e s do
:
l
Indeed, respect
the
uncontrollable
to t h e i n p u t - o u t p u t
and
relation
unobservable
since the
input and the second ones are disconnected It
is
clear
parameters'
that
this
situation
arises
first
¢ on the parameters
from
a31 a n d a 3 2 ,
the
special
of
two
with
from the
configuration
(1.2.10).
0
of
Introducing
the dynamic matrix becomes
-2
configuration
"transparent"
disconnected
from the output.
A
The
are
are
v a l u e s in t h e m a t r i c e s o f t h e m o d e l o f t h e s y s t e m
perturbation
figure
modes ones
the a
:
0
°°° 1
subsystems
in
1+¢
1
o
1
0
-3
cascade
is
1.4 :
x2
I p" I Figure
1.4
preserved
as
shown
in
13 or
e q u i v a l e n t l y in f i g u r e 1.5 :
u.__.~
(p+l)(p+2)
]
-"
[
(p+3)(p-l)
F i g u r e 1.5 In f i g u r e
1.5,
it is clear that
the p o l e - z e r o cancellation g i v i n g r i s e to the
u n o b s e r v a b i l i t y no l o n g e r o c c u r s for ~ ¢ 0. T h e r e f o r e ,
this u n o b s e r v a b i l i t y can be
avoided b y c h a n g i n g t h e v a l u e s of some a d e q u a t e components of the s y s t e m , C o n s i d e r now the case for which a31 and r e f l e c t i n g the i n t e r n a l i n t e r c o n n e c t i o n s t r u c t u r e entries
cannot be p e r t u r b e d
by
any
change
a41 in ( 1 . 2 . I 0 ) a r e fixed z e r o s , of t h e system ( i . e . , t h e s e zero
of the
components
values).
In
this
situation, the system is r e p r e s e n t e d b y f i g u r e s 1.6 and 1.7 below :
xI
x#
2 F i g u r e 1.6.
p+l ~ (p+3)(p- l)
u.l,+
Y
F i g u r e 1.7. and its t r a n s f e r function is :
Y=
where the pole ~2---1 is a b s e n t .
B(p+l) (p+2)(p+3)(p-- 1)
This r e s u l t is not s u r p r i s i n g since F i g u r e 1.6 shows
that the block - 2 / p + l is d i s c o n n e c t e d from the o u t p u t . s e r v a b l e mode.
X2=-I is t h e r e f o r e an u n o b -
14
The i n t e r e s t i n g p o i n t o f t h i s d i s c u s s i o n is t h a t t h e pole %2=-1 will n o t a p p e a r in t h e t r a n s f e r f u n c t i o n a n d will r e m a i n u n o b s e r v a b l e h o w e v e r t h e p a r a m e t e r s o f t h e system are changed.
This s i t u a t i o n a r i s e s from t h e i n t e r c o n n e c t l o n s t r u c t u r e o f t h e
s y s t e m . S u c h a pole is called s t r u c t u r a l l y u n o b s e r v a b l e . A similar d i s c u s s i o n could be
d o n e f o r u n c o n t r o l l a b i l l t y coming to t h e
c o n c e p t of s t r u c t u r a l l ) r
uncontroIlable
pole s . T h e s e c o n c e p t s p r e s e n t a g r e a t p h y s i c a l i n t e r e s t . I n d e e d , p r a c t i c a l l y , most of t h e e n t r i e s o f A, B a n d C in
(1.2.1)
are
k n o w n w i t h t h e a p p r o x i m a t i o n o f some
e r r o r s o f m e a s u r e m e n t s (it is e s p e c i a l l y t r u e f o r l a r g e scale s y s t e m s ) . Only some of t h e s e e n t r i e s a r e k n o w n w i t h 100 p e r c e n t p r e c i s i o n : t h i s h a p p e n s f o r t h e e n t r i e s that
are
equal
to
zero and
reflect
the
internal
interconnection structure
of t h e
s y s t e m . The c o n c e p t s of s t r u c t u r a l c o n t r o l l a b i l i t y a n d s t r u c t u r a l o h s e r v a b i l i t y t h e n makes t h e m e a n i n g of c o n t r o l l a b i l i t y and o b s e r v a b i l i t y more complete from t h e p h y sical p o i n t o f v i e w . T h e following p a r a g r a p h perties and
presents
t h e mathematical formulation o f t h e s e p r o -
some r e s u l t s e x p r e s s i n g t h e n e c e s s a r y a n d
s u f f i c i e n t c o n d i t i o n s for a
s y s t e m to b e s t r u c t u r a l l y c o n t r o l l a b l e a n d o b s e r v a b l e .
1.3. - S T R U C T U R A L
CONTROLLABILITY
These concepts were
AND
OBSERVABILITY
first introduced by
p r o v i d e t h e c o n d i t i o n s for s t r u c t u r a l
Lin in
1974
controllability (and by
(LIN-74).
His r e s u l t s
duality for s t r u c t u r a l
o b s e r v a b i l i t y ) of s i n g l e - v a r i a b l e s y s t e m s in a g r a p h - t h e o r e t i c a p p r o a c h .
They were
e x t e n d e d to m u l t i - v a r i a b l e s y s t e m s b y Shield a n d P e a r s o n in 1976 (SHI-76) b u t in a purely algebraic approach.
I n t h e same y e a r ,
Glover a n d Silverman (GLO-76) p r e -
s e n t e d a simple a l g e b r a i c solution a n d d e r i v e d a r e c u r s i v e algorithm f o r d e t e r m i n i n g structural
controllability
which
utilizes
Boolean
operations
only.
presents these results and establishes the equivalence between the
This
paragraph
graph-theoretic
and the algebraic approaches. C o n s i d e r t h e l i n e a r t i m e - i n v a r i a n t dynamic s y s t e m in t h e form :
{
~(t) = A x(t) + B u(t) y(t) C x(t)
(1.3.1)
where x C R n, u C R m and y ~ R r. A, B, and C are invariant matrices of appropriate dimensions in which the entries are either fixed zeros of undeterminate (arbitrary). Such a system is called a structured system and A, B and C are structured matrices (SHI-76). It is worth noting that the model class of systems.
(1.3.1) refers therefore to a
15 Definition
1.4.
The
triple
e q u i v a l e n t to) t h e t r i p l e
(~,
~,
~)
has
the
same
structure
as
(is s t r u c t u r a l l ~
(C, A, B) of t h e same d i m e n s i o n s if for e v e r y
e n t r y of t h e m a t r i x ( ~ ~ ~ ) ,
fixed zero
t h e c o r r e s p o n d i n g e n t r y of t h e m a t r i x (C A B) is also
a fixed zero, and vice versa. O b v i o u s l y , if t h e t r i p l e ( ~ , X , l~) is s t r u c t u r a l l y A, B ) ,
then the pairs
(~,
~) and
(~, g)
e q u i v a l e n t to t h e t r i p l e (C,
are structurally
e q u i v a l e n t to t h e p a i r s
(C, A) a n d (A, B ) , a n d t h e i n v e r s e i s also t r u e . Definition 1.5.
A pair
(A,
B)
((C,
A)) is s t r u c t u r a l l y
t h e r e e x i s t s a p a i r e q u i v a l e n t to (A, B) ( ( C ,
controllable
(observable)
if
A)) w h i c h is c o n t r o l l a b l e ( o b s e r v a b l e )
in t h e u s u a l s e n s e . 1.3.1.
-
1.3.1.a.
Structural controllability - A l g e b r a i c a p p r o a c h (SHI-76)
Definition 1 . 6 .
T h e m a t r i x (A B) h a s form I if t h e r e e x i s t s a p e r m u t a t i o n m a t r i x P
satisfying :
P' [A B]
F: 0] EAI 0 I
with A l l o f o r d e r t x t ,
1 .~ t ( n .
A21
A22
0] B2
We a s s u m e t h a t B 2 h a s a t l e a s t o n e n o n z e r o e l e -
merit. T h e m a t r i x (A B) h a s form II if : g r ( A B) ( n where gr (.)
d e n o t e s t h e g e n e r i c r a n k 1 of ( . ) .
1 C o n s i d e r a s t r u c t u r e d m a t r i x 1~ w i t h ~ arbitrary entries. Then the parameter s p a c e RV is a s s o c i a t e d w i t h ~ s u c h t h a t e v e r y d a t a p o i n t d ~ R v d e f i n e s a m a t r i x M=~(d). C o n v e r s e l y , a s t r u c t u r e d m a t r i x M is a s s o c i a t e d with e v e r y m a t r i x M s u c h t h a t M=~(d) for d ~ R V. T h e g e n e r i c r a n k of M o r of M is d e f i n e d as follows : g r ( M ) = g r ( ~ ) = m a x { r a n k ~ (d) } dew
16
T h e o r e m 1.3
(SHI-76).
The pair
( A , B) i s s t r u c t u r a l l y
controllable if and only if the
two f o l l o w i n g c o n d i t i o n s b o t h h o l d : 1 - t h e m a t r i x (A B) i s n o t o f f o r m I. 2 - t h e m a t r i x (A B) i s n o t o f f o r m I I ,
1.3.1.b.
- Graph-theoretic
The
structured
approach
nature
of the
(LIN-74) system
(1.2.5)
naturally
comes to
associate
a
digraph. A digraph edges
is a pair D=(V,E),
( v j , v i) d i r e c t e d
w h e r e V is a s e t o f v e r t i c e s
from t h e v e r t e x
vj to t h e v e r t e x
a n d E is a s e t o f
v i , I f ( v j , v I) E; E t h e n vj
is s a i d to b e a d i a c e n t to v i a n d v i a d j a c e n t from v j . T h e a d j a c e n c y r e l a t i o n d e f i n e s a square
binary
m a t r i x R=(~-ij) c a l l e d t h e a d i a c e n c y
a n d o n l y if ( ~ ,
vi)•
E0 A s e q u e n c e o f e d g e s
w h e r e all t h e
vertices
cides with Vl,
then
are distinct,
the path
(or interconnection)
{ ( v 1, v 2 ) ,
is called a path
is a cycle.
from v 1 to v k .
A digraph
m a t r i x ~..=11] i f
( v 2, v 3) . . . . .
(Vk_ 1, v k ) } When v k c o i n -
D is s a i d to b e
a c y c l i c i f it
contains no cycles.
If t h e r e i s a p a t h f r o m v i t o v i , t h e n we s a y t h a t v i is r e a c h a b l e
from vj.
a subset
vertex every
Similarly,
V£
c
V is r e a c h a b l e
from a subset
in V. i s r e a c h a b l e f r o m some v e r t e x in V . . We s a y t h a t V. 1
vertex
lity relation
,]
Vj c
J
c
V if every
V reaches
V. i f 1
i n V. r e a c h e s a t l e a s t o n e v e r t e x in V . . Like a d j a c e n c y , t h e r e a c h a b i ] 1 o n V c a n b e r e p r e s e n t e d b y a b i n a r y m a t r i x R=(r_.j)~ s u c h t h a t r .1j. = l i f
a n d o n l y if v. i s r e a c h a b l e f r o m v . . 1 j A pair of vertices c h a b l e from e a c h o t h e r .
of
D a r e s a i d to b e s t r o n g l y
A maximal s u b g r a p h
strongly connected is called a strong The
strong
components
components D1,...,DN, (i=l . . . . . k ) , performed
of
connected
if t h e y
are rea-
o f D in w h i c h e v e r y p a i r o f v e r t i c e s a r e
c o m p o n e n t o f D.
D are
uniquely
they can be ordered
i s r e a c h a b l e from a n y o t h e r
determined.
If
D has
N strong
s u c h t h a t f o r some 1 ~ k ~ N, n o n e Di ,
Dj, j>i. I f t h e c o r r e s p o n d i n g
o n t h e a d j a c e n c y m a t r i x o f D, i t a p p e a r s
permutation is
t h e n in a b l o c k - t r i a n g u l a r
form
where every block in the diagonal is the adjacency matrix of a strong component.
Let M be a rectangular associated adding
to M a s t h e
(q-p)
zero rows.
pxq structured
digraph
matrix and define the digraph
whose adjacency
m a t r i x is M', o b t a i n e d
D=(V,E)
from M by
17 Definition 1 . 7 .
A d i g r a p h D=(V,E)
c o n t a i n s a dilation if a n d only if t h e r e e x i s t s a
s e t S c V I (V I c V is t h e s e t of v e r t i c e s w h i c h a r e a d j a c e n t from at l e a s t o n e v e r t e x in V) of K v e r t i c e s s u c h t h a t t h e s e t T ( S ) c V
o f v e r t i c e s t h a t a r e a d j a c e n t to a v e r t e x
of S c o n t a i n s no more t h a n ( K - I ) e l e m e n t s . The dilation is d e n o t e d b y { S , T ( S ) } . This
d e f i n i t i o n i s a g e n e r a l i z a t i o n of t h e
c o n c e p t of dilation i n t r o d u c e d b y
(LIN-74) in t h e c o n t e x t of s t r u c t u r a l a n a l y s i s for s i n g l e - v a r i a b l e s y s t e m s . In p r a c t i c e ,
D c o n t a i n s a dilation if a s e t of K rows can be f o u n d in t h e
a d j a c e n c y m a t r i x of D s u c h t h a t t h e r e a r e no more t h a n ( K - l ) columns w i t h n o n z e r o e n t r i e s in t h e s u b m a t r i x formed b y t h e s e K r o w s . Given
the
triple
(C,A,B),
one
defines
{U= U l , . . . , u m} i s t h e s e t of i n p u t v e r t i c e s ,
a
d i g r a p h F = ( U v X u Y,E)
X={Xl,...,Xn}iS
where
t h e s e t of s t a t e v e r -
tices a n d Y={~/1 . . . . y r } is t h e s e t o f o u t p u t v e r t i c e s . E i s t h e s e t o f e d g e s s u c h t h a t (u i,
xj)£E
if a n d
only i f bji#0 i n
B , ( x i , x j) E: E i f a n d only if aji#0 in
A and
( x i , Y j ) ( E if a n d only if cji#0 i n C. In t h i s w a y , t h e d i g r a p h r c o m p l e t e l y d e s c r i b e s t h e s t r u c t u r e o f t h e s y s t e m . Definition 1.8 ( S I L - 7 8 ) . The s y s t e m ( C , A , B ) is s a i d to b e i n p u t r e a c h a b l e (or i n p u t c o n n e c t a b l e (DAV-77a)) if X is r e a c h a b l e from U a n d o u t p u t r e a c h a b l e
(or o u t p u t
c o n n e c t a b l e (DAV-77a)) if X r e a c h e s Y. A l t h o u g h Lints work (LIN-74) d e a l t only with s i n g l e - i n p u t s y s t e m s , it can b e d i r e c t l y e x t e n d e d to m u l t i - i n p u t s y s t e m s .
Consider the pair (A,B) and its associated digraph rl=(U v X,E I) obtained from r by deleting the set of output vertices and every edge from X to Y. Then, we h a v e t h e following r e s u l t : Theorem 1 . 4 .
The
pair
(A,B)
is s t r u c t u r a l l y
c o n t r o l l a b l e if and only if t h e
two
following c o n d i t i o n s b o t h hold : 1 - (A,B) is input reachable. 2 - F1 d o e s n o t c o n t a i n a d i l a t i o n .
1 . 3 . 1 . c . - E q u i v a l e n c e of t h e two a p p r o a c h e s It is now w o r t h v e r i f y i n g t h a t t h e o r e m s 1.3 a n d 1.4 a r e e q u i v a l e n t . C o n s i d e r t h e f i r s t p a r t s of t h e t h e o r e m s .
18
If matrix
(A B)
has
form I,
by
definition 1.6,
there
matrix P satisfying :
P' [A B]
with A l l o f o r d e r t x t ,
a
permutation
o]
=
i
exists
A22
LA21
B2
1 ~ t (n.
T h e f i r s t e q u a t i o n in ( 1 . 3 . 1 ) is t h u s r e w r i t e d v i t h a p a r t i t i o n e d s t a t e v e c t o r :
I17 [ °]Ix,][ °] =
)(2
+
A21
A22
X2
U
132
a n d t h e g r a p h a s s o c i a t e d with t h e p a i r ( A , B ) in t h i s form is g i v e n in F i g u r e 1.8.
F i g u r e 1.8. It is c l e a r t h a t t h e s t a t e v e r t i c e s in X 1 a r e n o t i n p u t r e a c h a b l e . The i n v e r s e also h o l d s : if t h e g r a p h of a p a i r
(A,B)
contains non-input-reachable state ver-
t i c e s , t h e m a t r i x (A B) can b e b r o u g h t to form I. T h e f i r s t p a r t s of t h e t h e o r e m s 1.3 a n d 1.4 a r e t h e r e f o r e e q u i v a l e n t . To p o i n t o u t t h e e q u i v a l e n c e of t h e s e c o n d p a r t s o f t h e t h e o r e m s , we n e e d t h e following r e s u l t due to Shield a n d P e a r s o n ( S H I - 7 6 ) . Theorem 1 . 5 .
(SHI-76).
Assume a r e c t a n g u l a r m a t r i x M of o r d e r p x q with p ~ q .
gr(M) ( t for some t , 1 ~ t ~ p , if for some k in t h e r a n g e q - t < k ~ q , M c o n t a i n s a z e r o s u b m a t r i x of o r d e r ( p + q - t - k + l ) x k . Theorem
1.5
following c o r o l l a r y :
a p p l i e d to M=(A B)
of o r d e r
nx(n+m)
obviously
leads
to t h e
lg Corollary
1.1.
m( k ~ n+m,
: gr(A
B)
Making the change gr(A
B)
submatrix
(n
(i.e,
(A B)
has
(A B) c o n t a i n s a z e r o s u b m a t r i x
: K=n+m-k+l,
of order
the digraph
of variables
Kx(n+m-K+l),
associated
range
(A,B)
if f o r s o m e k i n t h e
1 ~
contains
range
(n+m-k+l)xk.
corollary
1.1 becomes
K
which is equivalent,
with the pair
Figure 1.9 with an example
f o r m II)
of order
(A B)
contains
from definition
a dilation.
:
1.8,
a zero to h a v e
This is illustrated
by
: ¢.q.t..~K + 1
E
m
o
(
~
I
"/iv
o o iil
o
o
o
o
X
X
ii X
i
S = { x 1, x 2 , x 3 } =) K=3
T(S)=(u,
x 1} Figure
1.3.2.
- General results As far
study
as the
on structural
dual concept
controllability
of structural
could be done and the general
1.3.2.a.
1.9
results
Theorem 1.6.
The system
(1.2.5)
is concerned,
a similar
in the following theorems
represented
1 - ( A , B ) i s n o t o£ f o r m I. B)=n
(i.e,
=n ( i . e ,
by
the triple
(C,A,B)
:
is structurally
if a n d o n l y if t h e f o l l o w i n g c o n d i t i o n s h o l d :
2 - (A I, C I) i s n o t o f f o r m I.
4- gr
observability
are stated
- Algebraic approach
controllable and observable
3 - gr(A
and observability
(A B) i s n o t o f f o r m I I ) .
(A ~ C t) i s n o t o f f o r m I I ) .
20
1 . 3 . 2 .b. - Graph-theoretic Theorem
1.7. T h e
system
approach
(1.2.5)
controllable a n d observable
represented
by
i - (A,B)
is input reachable.
2 - (A,C)
is output reachable.
3 - The
digraph
associated with the pair (A,B)
4 - The
digraph
associated with the pair ( M ,
1.3.3.
- Computational
the triple
(C,A,B)
if a n d only if the following conditions hold
is structurally :
does not contain a dilation. G') does not contain a dilation.
considerations
T h e most p r a c t i c a l way to c h e c k s t r u c t u r a l
c o n t r o l l a b i l i t y a n d o b s e r v a b i l i t y of
a given system (C,A,B)
is to combine t h e a l g e b r a i c a n d g r a p h - t h e o r e t i c
Indeed,
output
the
input
and
reachability
can be easily tested
approaches.
a n d on t h e o t h e r
h a n d , a lot of e f f i c i e n t a l g o r i t h m s e x i s t to d e t e r m i n e t h e g e n e r i c r a n k of a m a t r i x .
l. 3.3. a. -Input and output reachability conditions T h e a d j a c e n c y m a t r i x of t h e d i g r a p h a s s o c i a t e d with ( C , A , B )
h a s t h e following
form : X
U
Y
o
o
U
C
o
y
(1.3.z)
:
where ~,B and ~ are obtained by replacing every undeterminate (arbitrary)
entry in
A , B a n d C b y 1. The reachability matrix,
w h i c h h a s t h e same d i m e n s i o n as ~ a b o v e is g i v e n
by :
I R =
X
U
Y
E
F
0
X
0
o
0
U
G
H
o
Y
(1.3.3)
21 R can be computed directly from ~ as s h o w n in (SIL-78). By the (SIL-78) output
;
sole observation
(CjA~B)
reachable
is
of R j
input
if a n d
- Generic rank
A number generic
rank
((SHI-76),
of authors
Among the (PRE-81)
the determination an
nxm
have
no zero columns j and
suggested
matrix.
no
zero
conditions rows,
it i s
it i s i n p u t - o u t p u t
rea-
we m e n t i o n
rank
the
were
the
one b y
of "nontaking
of
the
finding to
Prescott
(LIU-68).
of an nxm structured
zeros
for
shown
be
the
wrong
problem.
mathematics
of the maximum number where
algorithms
algorithms
a tricky
on combinatorial
of the generic
chessboard,
alternative
Several
revealing
algorithms,
based
that the evaluation
reachahiltty
if F h a s
zero rows nor zero columns.
(DAV-77a)),
efficient
(JAM-83)
on the
only
conditions
of a structured
(BUR-81),
if a n d
o n l y if G h a s
c h a b l e if a n d o n l y if H h a s n e i t h e r
1.3.3.b,
we c a n c o n c l u d e
reachable
matrix
and
Pearson
basic
idea is
matrix is equivalent
roots" are
The
to
that can be placed on
interpreted
as
forbidden
by Johnston
et al.
positions. Another
interesting
84) t h a t i s b a s e d matrix
is
disjoint rows
first
blocks
than
on the detection
brought appear
columns
simple procedure
algorithm was presented back
in
to
the
indicate
in a systematic a triangular
diagonal.
a possible
The rank
in ( E V A - 8 4 ) .
e q u a l to t h e
The algorithm
which
appropriate
t h a t we p r e s e n t
is specially reordering
suitable
that
have
deficiency,
fact that
of the
a greater
which
is
The initial
where
different number
determined
of
by
a
entries.
the
nonzero
refering
generic
diagonal
rank
of a matrix is
rank
of a matrix is
blocks
(see the next section)
to large
the global generic
to s m a l l e r d i m e n s i o n e d
way by
in ( J O H - 8 4 ) .
here
for application
of the matrix,
out in a sequential
of t h e a l g o r i t h m
blocks
form
to c o m p u t e t h e g e n e r i c
on the
dimensions
of any dilation.
(JOH-
constituting
the
matrix.
in t e r m s o f c o n d i t i o n s carried
It is based
sum of the
maximal permutation
86a)
manner
block-structure
examining the position of the nonzero
We m e n t i o n a l s o t h a t a n A P L r o u t i n e provided
recently
using,
at e a c h
scale systems.
rank
matrices.
step,
is the one in
(TRA-
Using
an
condition is expressed The checking
a slightly
is t h u s
modified version
22
1,3.3.c. - A sequential algorithm to conclude on structural controllability and observability of large scale systems (TRA-86a) When dealing with l a r g e scale s y s t e m s , c h e c k i n g t h e c o n d i t i o n s f o r s t r u c t u r a l c o n t r o l l a b i l i t y a n d o b s e r v a b i l i t y may c a u s e c o m p u t a t i o n a l d i f f i c u l t i e s a n d r e q u i r e h i g h calculation time. T h i s s e c t i o n p r e s e n t s t h e w o r k in (TRA-86a) which t a k e s a d v a n t a g e of t h e i n h e r e n t s t r u c t u r e of a c l a s s of l a r g e scale s y s t e m s which can be d e c o m p o s e d into hierarchically
ordered
interconnected irreducible
subsystems.
The
underlying
idea is to a c h i e v e computational a n d c o n c e p t u a l s i m p l i f i c a t i o n s b y s u b s e q u e n t l y s o l v i n g each subsystem.
This approach has been used to analyse systems stability in
(SEZ-81c) (MIC-78) and for estimators and controllers design in (PIC-83b). Although (PIC-83b) uses the property that each subsystem is structurally controllable and observable, the conditions guaranteing these properties have not been yet derived within this perspective.
This problem is considered in (TRA-86a)
and
sequential
conditions for structural controllability (observability) of the overall system
are
provided. A n iterative algorithm is proposed and its improvements with respect to an a l g o r i t h m u s i n g a global a p p r o a c h a r e d i s c u s s e d . An i l l u s t r a t i v e example is p r e s e n ted.
1. P r e l i m i n a r i e s In t h i s s e c t i o n , some new c o n c e p t s of g r a p h t h e o r y (TRA-86a) a r e i n t r o d u c e d , Definition 1.9. A G-dilation ( G e n e r a l i z e d dilation) i s d e f i n e d as a n y p a i r of s e t s { S c V ' , T ( S ) c V } s u c h t h a t e a c h v e r t e x of T ( S )
is a d j a c e n t to some v e r t e x o f S. The
o r d e r of a G-dilation is d = c a r d S - c a r d T(S)
w h e r e c a r d * d e n o t e s t h e n u m b e r of
s
e l e m e n t s in t h e s e t *. O b v i o u s l y , a dilation is a G - d i l a t i o n w h o s e o r d e r is p o s i t i v e . T h e n , it is c l e a r that
gr(M)=p
(full
generic rank)
if a n d
only if t h e
order
of all t h e
G-dilations
c o n t a i n e d in D i s - ~ 0 . We s a y t h a t a G - d i l a t i o n { S , T ( S ) }
of o r d e r
d s is maximal i f ,
for all p r o p e r
s u b s e t s L c ( V ' - S ) , t h e G-dilation {~¢=L,T(ScL)} is of o r d e r ~d s . T h e o r e m 1.8. M contains
( T R A - 8 6 a ) . I f t h e d i g r a p h D a s s o c i a t e d with a full g e n e r i c r a n k m a t r i x k
G-dilations {Si,T(Si)},
G-dilation of o r d e r 0 { ~ , T ( ~ ) } 0r i . e . ,
SiC fir T(Si) C T ( ~ ) ,
(i=l, . . . . k ) ,
of
order
0,
then
the
maximal
is u n i q u e a n d " i n c l u d e s " all t h e G - d i l a t i o n s of o r d e r
(i=l . . . . . k ) .
23
2. Seciuential c o n d i t i o n s for s t r u c t u r a l controllability C o n s i d e r the system
(1.2.1)
represented
b y the t r i p l e (C,A,B) and its a s s o -
ciated d i g r a p h F = ( U t K u Y , E) as d e f i n e d in section 1 . 3 . 1 . b . summarizes the r e s u l t s p r o v i d e d in (LIN-74) and (SHI-76) :
The following theorem
Theorem 1.9. The system (1.2.1) is s t r u c t u r a l l y controllable ( o b s e r v a b l e ) if and only if the two following conditions both hold : 1- ( A , B )
( ( C , A ) ) is i n p u t ( o u t p u t ) r e a c h a b l e (SIL-77)
2- gr(A B) = n (gr(A' C')= n)
From the computational p o i n t of v i e w , c h e c k i n g the above conditions r e q u i r e s the evaluation of the t e a c h a b i l i t y matrix of the d i g r a p h associated with ( A , B )
((C,
A)) and the d e t e r m i n a t i o n of the g e n e r i c r a n k of a matrix whose dimension is in the r a n g e of t h e o r d e r of the s y s t e m .
A l t h o u g h e f f i c i e n t algorithms a r e available
(see
(SIL-78) (BOW-76)) for t h e r e a c h a b i l i t y matrix and (JOH-84) (MOA-80) for t h e g e n e ric r a n k ) ,
some computational
difficulties may arise when dealing with l a r g e scale
systems. The s y s t e m is decomposed into t h o s e s u b s y s t e m s for which t h e s t a t e v a r i a b l e s c o r r e s p o n d to the s t r o n g components of F x = ( X , E x ) , o b t a i n e d from Yp and t h e c o r r e s p o n d i n g
edges.
If the s t r o n g
r b y deleting U,
components a r e a d e q u a t e l y o r d e r e d
and a f t e r t h e c o r r e s p o n d i n g p e r m u t a t i o n of the s t a t e v a r i a b l e s , system (1.2.1)
takes
the following form :
]A2L
A2~
Al ] I
~(t): / I:
",,,\,,
LA~, Y(t)=
where Aij ~ R n i x n j ,
[C l
B i E R nixm,
%,
C2 . . . .
x(t)+
2
LB~,J
u(t) (1.3.4)
Csl
Ci ~ R r x n i ,
(i,j=l . . . . . s t .
Elaborated p r o c e d u r e s
for
the d e t e r m i n a t i o n of the s t r o n g components of a d i g r a p h can be found in (HAR-65), (KAU -68).
24 2.i. - Reachabilit~, condition
Using
the above
decomposition,
the reachability condition of Theorem
1.9 is
very easily expressed at the level of each subsystem in (1.3.4).
Theorem 1.10 ( T R A - 8 6 a ) .
The s y s t e m (1.2.1)
(1.3.4)
is i n p u t r e a c h a b l e if and only
if : (B i Ail Ai2 . . .
(1.3.5)
(i=l ..... s)
Ai,i_ 1) ~[~ 0
This r e s u l t is s t r a i g h t f o r w a r d from the definition of s t r o n g components and the hierarchically
reordered
digraph
corresponding
o b s e r v a t i o n of the matrices in (1.3.4)
the
sole
allows to conclude on i n p u t r e a c h a b i l i t y .
to
(1.3.4).
Therefore,
The
dual r e s u l t for o u t p u t r e a c h a b i l i t y is o b t a i n e d b y r e p l a c i n g B i by C's_i+ 1 and Aij by A's_j+lps_i+ 1 in ( 1 . 3 . 5 ) .
2.2. - Generic r a n k condition Our main r e s u l t is p r e s e n t e d in this p a r a g r a p h .
C o n s i d e r t h e system
(1.3.4)
and define the matrices A*I and B*, (i=l . . . . . s) as follows :
A*I : A l l ' B * I : B I '
A~I']---
EAt1
[ --i Ai,i_ 1 t
....
s where A.*~Rni*xn~ and B.* C Rni*xm with n* = Y. i
I
j=l
I
B~i:
-
(1.3.6)
nj.
Theorem 1.11 ( T R A - 8 6 a ) . A n e c e s s a r y and s u f f i c i e n t condition to h a v e g r ( A B)=n is that gr
(A~ B~)
The problem
= n.*l for all (i=l . . . . . s) consists,
therefore,
(1.3.7) in
finding
the
conditions
to h a v e
gr(A* i
B~)=n~ assuming t h a t gr(A~_ 1 B~_ 1) =n~_ 1. Theorem 1.12 ( T R A - 8 6 a ) . Given the r e c t a n g u l a r p x q (p~q) matrix M and its a s s o c i a ted d i g r a p h D=(V,E), assume t h a t gr(M)=p and t h a t { ~ , T ( ~ ) )
is the maximal G-dila-
tion of o r d e r 0 in D. T h e n the n e c e s s a r y and s u f f i c i e n t condition to h a v e
25
gr
= gr (MN) =p+p', w h e r e
N1 N2 m a t r i x , is t h a t
:
I J M
gr
0
~'=V'-£
a n d ME
associated vertices
denotes
(1.3.8)
=p'+card ~"
T(~)
NT ( a )
where
N 1 is a p'xq matrix and N 2 i s a p ) x p )
N2
the submatrlx
c o m p o s e d b y t h e c o l u m n s of M w h o s e
do n o t b e l o n g to t h e s e t E.
T h i s s i t u a t i o n i s c l a r i f i e d w h e n t h e m a t r i x MN i s r e w r l t e d {£,T(~
)}
with respect
to
as follows -"
T( f~)
T(f~)
V2
I I
q£
V=T(~) u~(.~) u V2
I
MT(£)
V': £u~ u V2
I I
I
N
l~(a)t t
--
7(~)
T(n)
N1
I
N2
-i
V2
In o r d e r to a p p l y T h e o r e m 1.12 t o o u r s p e c i a l p r o b l e m ,
define
:
I'-'"-' o ] M l l = [ B I A l l ] , Mii = Ni,i-I
(1.3.9)
Nii
Ni,i_l=[Bi All Ai2 ... Ai,i_l], Nil = [A~I] Theorem
1.13
(TRA-86a).
The necessary
where A and B are given in (1.3.4),
and sufficient
is t h a t
conditions to have gr(A
B)=n
:
1 - gr[Mll]=nl
2 - gr
MT(g2 E-I) i-l,i-I
o
1 /
Ni,i-I
Nil
J
(1.3.10) :gr[F i]:ni +card"i_ l
(i=2,...,s)
26 where{~i_ 1, T ( ~ i _ l ) } Theorem
is t h e maximal G - d i l a t i o n of o r d e r 0 of Mi_l, i - l "
1.13 is
straightforward
1.12 to t h e m a t r i c e s Mii, ( i = l , . . . s ) ,
from t h e
successive
d e f i n e d in ( 1 . 3 . 9 ) .
a p p l i c a t i o n of T h e o r e m
The above result is streng-
t h e n e d b y t h e f a c t t h a t {ff2i, T ( ~ i ) } c a n also b e d e t e r m i n e d in a s e q u e n t i a l way. T h e o r e m 1.14 ( T R A - 8 6 a ) .
A s s u m e t h a t Mii h a s full g e n e r i c r a n k ,
G - d i l a t i o n of o r d e r 0 of Mii is { ~ i ' T (~i)} w i t h ~ i = ~i-1 u 6 i or(6i) w h e r e ( 6 i ' T ( d i ) } is t h e maximal G - d i l a t i o n of o r d e r
t h e n t h e maximal
a n d T ( ~ i ) = T ( ~ i _ 1) 0 of t h e m a t r i x F i
d e f i n e d in ( 1 . 3 . 1 0 ) . Dual r e s u l t s a r e easily o b t a i n e d for s t r u c t u r a l o b s e r v a b i l i t y b y r e p l a c i n g B i b y C's_i+ 1 a n d Aij b y A ' s _ j + l , s _ i + 1 in ( 1 . 3 . 9 ) . T h e a b o v e r e s u l t s p r o v i d e t h e b a s i s f o r an i t e r a t i v e a l g o r i t h m to c o n c l u d e o n structural
c o n t r o l l a b i l i t y ( o b s e r v a b i l i t y ) of l a r g e scale d y n a m i c a l s y s t e m s .
2.3. - Algorithm Since t h e
sequential
require any calculations, tions (1.3.10)
reachability
conditions
the subsequent
in T h e o r e m 1.13 o n l y .
(1.3.5)
in T h e o r e m
1.10 do n o t
a l g o r i t h m r e f e r s to t h e g e n e r i c r a n k c o n d i -
At e a c h s t e p i, we n e e d to v e r i f y w h e t h e r o r
n o t F., h a s a g e n e r i c r a n k d e f i c i e n c y a n d , if n o t , to d e t e r m i n e i t s maximal G - d i l a t i o n of o r d e r 0. T h i s c a n b e p e r f o r m e d b y u s i n g a s l i g h t l y modified v e r s i o n of t h e g e n e ric rank
algorithm in
(JOH-84).
The
first
step
is t h e
same as in
(JOH-84)
and
c o n s i s t s in a r e o r d e r i n g of t h e m a t r i x F i . Algorithm
REORDER
(M)
:
Step 1
i=0, j=0, d e l e t e t h e null c o l u m n s .
Step 2
F i n d t h e row with t h e minimal n u m b e r of n o n - d e l e t e d choice exists,
select
the
one with
entries
minimal n u m b e r of e n t r i e s
(say ~).
If
(deleted or
non-deleted). Step 3 Step 4
A s s o c i a t e t h i s row with i n d e x i a n d d e l e t e i t , i--i+l. A s s o c i a t e t h e columns w h i c h h a v e e n t r i e s i n t h i s row w i t h t h e i n d i c e s j + l , j+2 . . . . .
j + a a n d d e l e t e t h e m , j=j+a.
27 Step 5
If a n y row is l e f t , go to s t e p 2. O t h e r w i s e , w r i t e M o r d e r i n g t h e rows a c c o r d i n g to i n c r e a s i n g i n d i c e s from top to bottom a n d t h e columns a c c o r d i n g to i n c r e a s i n g i n d i c e s from l e f t to right, stop.
T h i s a l g o r i t h m p u t s t h e m a t r i x M in t h e following form :
I .....I-2-: R1
|
IRK Denote
the
number
of rows
and
columns
of
the
block
Ri
by
Pi
and
qi'
(i=l,... ,K). In a s e c o n d s t e p , t h e m a t r i x Fi is a n a l y z e d . If a dilation is d e t e c t e d , F i h a s a g e n e r i c r a n k d e f i c i e n c y . O t h e r w i s e , we d e t e r m i n e i t s maximal G-dilation of o r d e r 0. The p r o c e d u r e i s t h e same as i n {JOH-84), with t h e modification t h a t some r o w s a n d columns are memorized for t h e d e t e r m i n a t i o n of t h e maximal G-dilation o f o r d e r 0. Algorithm ANALYZE (M)
:
Step i
i=l.
Step 2
If p i - q i < 0 , go to s t e p 8. O t h e r w i s e , j = l , k=0.
Step 3
Tag
t h e qi+k f i r s t r o w s in Ri.
Also tag
all t h e
r o w s in
Ri w h i c h
have
e n t r i e s only in t h e same columns as t h e e n t r i e s of t h e t a g g e d r o w s . Step 4
Tag t h e columns w h i c h h a v e n o n z e r o e n t r i e s in t h e t a g g e d r o w s a n d
cal-
culate h i = n u m b e r of t a g g e d r o w s - n u m b e r of t a g g e d c o l u m n s . ] Step 5
If ~i > 0, M c o n t a i n s a d i l a t i o n , s t o p .
i
If 1~'=-0, memorize t h e t a g g e d r o w s a n d c o l u m n s . J Step 6
If all t h e r o w s a b o v e R i a r e t a g g e d , go to s t e p 7. The r o w s a b o v e
Ri w i t h e n t r i e s in t h e t a g g e d columns a r e now s c a n n e d .
Select t h e one with minimal n u m b e r of e n t r i e s in t a g g e d c o l u m n s . If choice e x i s t s , s e l e c t t h e one with minimal n u m b e r of e n t r i e s a n d tag i t , j=j+l, go to s t e p 4.
28 Step 7
If all t h e r o w s in t h e block Ri a r e t a g g e d , go to s t e p 8. O t h e r w i s e , d e l e t e all t h e t a g s , j=j+l, k = k + l .
Step 8
If i=K, s t o p , t h e maximal G - d i l a t i o n of o r d e r 0 of M i s g i v e n b y : : memorized r o w s
T(6)
. memorized columns
O t h e r w i s e , i----i+l, go to s t e p 2. A s s u m i n g t h a t (B A) h a s initially b e e n p u t in form ( 1 . 3 . 4 ) b y u s i n g a n y of t h e m e t h o d s p r o p o s e d in (SIL-78) (BOW-76), t h e global algorithm is t h e following : Step 1
i=l,
B = n u m b e r o f d i a g o n a l b l o c k s , M00=0.
Step 2
S u c c e s s i v e l y d e l e t e t h e r o w s with only one e n t r y
and
the
corresponding
columns. If no r o w is left, gr(B A)=n,
Step 3
stop.
If t h e row block i h a s b e e n d e l e t e d o r F. h a s only one row l e f t , go to s t e p 1
4. O t h e r w i s e , REORDER (Fi) , ANALYZE ( F i ) . If Fi c o n t a i n s a d i l a t i o n , g r ( A B ) < n , s t o p . Otherwise, Step 4
{6i, T( 6i)~
is r e t u r n e d b y t h e algorithm ANALYZE.
If i= B, g r ( A B ) = n , s t o p . Otherwise,
delete
the
columns
corresponding
to
T( 6i ) ,
delete
the
null
r o w s . Fi+ 1 i s o b t a i n e d b y a d d i n g t h e row b l o c k ( i + l ) . .Step 5
i=i+l, go to s t e p 2.
It is a well k n o w n r e s u l t t h a t a r e c t a n g u l a r p x q (p
{S 0,
T ( S 0) } d e f i n e s an i n d e p e n d e n t p e r m u t a t i o n
d e f i n e d b y S 0 h a v e n o n z e r o e n t r i e s only in the
submatrix.
Since t h e
~ columns d e f i n e d b y
g rows
T(S0),
the
n o n z e r o e n t r i e s of t h e final p e r m u t a t i o n m a t r i x (if any) a r e n e c e s s a r i l y l o c a t e d in t h e square
submatrix
d e f i n e d b y {S O,
T ( S 0) } .
It
is
then
clear
that
the
remaining
e n t r i e s in t h e columns T ( S 0) a r e n o t available a n y m o r e ( S t e p 4 ) . This
remark
has
also b e e n
used
to i m p r o v e
the
r e d u c t i o n of t h e whole matrix at e a c h i t e r a t i o n ( S t e p 2).
algorithm
by
a preliminar
29
2.4. - Example To i l l u s t r a t e form (1.3.4))
bI
b2
x x
F1
the algorithm,
described
by
1
let us consider
the system
(1.2.1)
8
II
(already
put in
(B A) a s f o l l o w s :
2
3
4
5
7
6
9
I0
12
13
14
ix
1
Ix
2 3 4
; Y/x× -
--'--'
.
.
.
.
×"
5
-'i
.
×
6
!
7
I
8
9
I I
x
xl
1!
Ix
x
I
,
This system
x
satisfies
x
the reachability
conditions
I
(1.3.5)
12
X
x IX
I
generic rank
10
X
of Theorem
i.I0.
algorithm is now applied.
* i=__!1, ~ = s . S t e p Z : R o w s 3, 4, 8, a n d c o l u m n s 2, 5, 9 a r e d e l e t e d .
* i--2 :
--
S t e p 3 : F 2 d o e s n o t n e e d to b e r e o r d e r e d .
ANALYZE F 2
( ~1={i,2}
--)
~T( Step 4 : These
rows and columns are deleted. b2
3
4
6
X
X
X
7
8
10
(B A) b e c o m e s 11
12
13
:
14 5 6 7 9 10 II
X X
12
X
X X
X
X ×
13 14
13 14
X
61)= { b1,1}
The
30 *
i=3
S t e p 2 : Rows 6, 7, 9, 10, 11 a n d columns b 2, 7, 8, 10, 11 are d e l e t e d . * i:5
:
(i=4 is j u m p e d s i n c e t h e row block 4 h a s b e e n d e l e t e d )
Step 3 : 3
~
6
X
X
X ,I
F5:
12 iI
13
3 5 REORD
X
I X I
18
12
X
13
12
4
X
l~ ~5= ( 12, 14}
I
13
X
X I
ix
a
6 12
x
S t e p 4 : Since i= 8 , s t o p : g r
14
X !
I
ANALYSE[F 5]
13 T(d5)={3,13} 5
I
(B A) = n .
T h e r e f o r e , t h i s s y s t e m is s t r u c t u r a l l y c o n t r o l l a b l e . Comments : It is c l e a r t h a t t h i s a l g o r i t h m d o e s n o t p r e s e n t a n y a d v a n t a g e f o r s t r o n g l y c o n n e c t e d s y s t e m s . Its a p p l i c a b i l i t y is t h e r e f o r e limited to l a r g e scale s y s tems w h i c h can be d e c o m p o s e d i n t o s e v e r a l h i e r a r c h i c a l l y o r d e r e d s u b s y s t e m s a n d it is i n t u i t i v e l y u n d e r s t a n d a b l e t h a t i t s e f f i c i e n c y i n c r e a s e s with t h e n u m b e r of s u b s y s t e m s . Some o t h e r a s p e c t s of t h e s y s t e m like t h e location of t h e dilations o r o f t h e i n d e p e n d e n t G - d i l a t i o n s of o r d e r 0 in (B A) m u s t also b e t a k e n i n t o c o n s i d e r a t i o n . It r e s u l t s t h a t t h e e f f i c i e n c y of t h e a l g o r i t h m may v a r y f o r e a c h p a r t i c u l a r c a s e so t h a t it is d i f f i c u l t to c a r r y out a n y m e a n i n g f u l q u a n t i t a t i v e c o m p a r i s o n w i t h o t h e r a l g o r i t h m s u s i n g a global a p p r o a c h . H o w e v e r , a q u a l i t a t i v e d i s c u s s i o n is p o s s i b l e . The a l g o r i t h m p r e s e n t e d h e r e m u s t be c o n s i d e r e d as a whole f o r t h e s t r u c t u r a l c o n t r o l l a b i l i t y p r o b l e m . If t h e g e n e r i c r a n k alone is of i m p o r t a n c e , t h e n a p p l y i n g t h e a l g o r i t h m in (JOH-84) to t h e global m a t r i x may b e a good c h o i c e . Solving t h e
structural
controllability problem without a decomposition scheme
requires : - T h e d e t e r m i n a t i o n of t h e r e a c h a b i l i t y m a t r i x of t h e
d i g r a p h of t h e
system
w h i c h is e q u i v a l e n t to t h e p r o b l e m of f i n d i n g all t h e p a t h s in t h e d i g r a p h of t h e s y s t e m . I f t h i s l a t t e r p r o b l e m is s o l v e d , it is c l e a r t h a t t h e s t r o n g c o m p o n e n t s a r e determined. Therefore, putting the system (1.2.1)
in form ( 1 . 3 . 4 )
i s an e q u i v a l e n t
t h e d e t e r m i n a t i o n of t h e g e n e r i c r a n k of (B A) b y u s i n g ,
for example, the
problem.
-
a l g o r i t h m of (5OH-84). T h e n , t h e f i r s t s t e p c o n s i s t s in r e o r d e r i n g (B A) i n t o a row
31 echelon form
(algorithm
REORDER),
which can
be
a
heavy
task
for
large
scale
s y s t e m s . This s t e p is a v o i d e d b y o u r algorithm w h i c h u s e s REORDER at t h e s u b s y s tem level. M o r e o v e r , w h e r e a s t h e algorithm in (JOH-84) c a r r i e s out t h e calculations on t h e whole r e o r d e r e d m a t r i x ,
t h i s algorithm p r o c e e d s to a r e d u c t i o n of (B A) at
each s t e p ( S t e p 2), w h i c h can c o n s i d e r a b l y r e d u c e t h e t a s k (see t h e e x a m p l e ) . O v e r t h e s c o p e of t h i s s e c t i o n , t h e algorithm may b e a d a p t e d for t h e s e q u e n tial d e t e r m i n a t i o n of minimal e s s e n t i a l i n p u t
(output)
s e t s which a r e f u n d a m e n t a l in
the p r o b l e m of d e t e r m i n i n g t h e minimal f e e d b a c k p a t t e r n s avoiding s t r u c t u r a l l y f i x e d modes (TRA-86b)
1.4.
-
( s e e C h a p t e r V, Section 5 . 3 . 4 b . 3 ) .
CONCLUSION This c h a p t e r p r o v i d e s an o v e r v i e w o f t h e i m p o r t a n t c o n c e p t s of c o n t r o l l a b i l i t y
and o b s e r v a b i l i t y t h a t play a f u n d a m e n t a l role in t h e p r o b l e m of s t a b i l i z a t i o n and pole a s s i g n m e n t of l i n e a r t i m e - i n v a r i a n t dynamic s y s t e m s . The
s o l u t i o n of t h i s
analysis of t h e
origins
p r o b l e m is e x p r e s s e d
of u n c o n t r o l l a b l e
and
in t e r m s of t h e s e
unobservable
concepts.
modes p o i n t s
i n t e r e s t for e x t e n d i n g t h e s e c o n c e p t s into a s t r u c t u r a l f r a m e w o r k .
out
An the
Structural con-
troUability a n d o b s e r v a b i l i t y a r e t h u s i n t r o d u c e d a n d a p p e a r as s t r o n g e r p r o p e r t i e s than c o n t r o l l a b i l i t y a n d o b s e r v a b i l i t y in t h e u s u a l s e n s e .
Using t h e s e c o n c e p t s , t h e
above p r o b l e m t u r n s to w h i c h of g e n e r i c s t a b i l i z a t i o n a n d g e n e r i c pole a s s i g n m e n t . The s t r u c t u r a l p r o p e r t i e s are e s t a b l i s h e d from t h e s t r u c t u r e o f t h e s y s t e m w i t h o u t any c o n s i d e r a t i o n of t h e p a r a m e t e r s ' v a l u e s of s y s t e m s .
Therefore,
this
approach
:
t h e y are in f a c t c o n c e r n e d w i t h c l a s s e s
allows d e a l i n g
with s y s t e m s w h o s e n o n z e r o
p a r a m e t e r s a r e k n o w n with i n c e r t a i n t i e s . It is w o r t h n o t i n g t h a t t h i s s i t u a t i o n o c c u r s f r e q u e n t l y in l a r g e scale s y s t e m s . The s t u d y
of t h e s e p r o p e r t i e s can be a c h i e v e d with a p u r e l y
p r o a c h or with a g r a p h - t h e o r e t i c a p p r o a c h .
s t r u c t u r a l c o n t r o l l a b i l i t y a n d o b s e r v a b i l i t y is b y Thus,
algebraic ap-
N e v e r t h e l e s s , t h e e a s i e s t way to c h e c k combinating the
two a p p r o a c h e s .
t h e c o n d i t i o n s to be e x a m i n e d involve b o t h t e a c h a b i l i t y of t h e g r a p h a s s o c i a -
t e d with t h e s y s t e m a n d g e n e r i c r a n k d e t e r m i n a t i o n . In s e c t i o n
1.3.3.c,
t h e a l g o r i t h m of (TRA-86a)
troUability a n d o b s e r v a b i l i t y is p r e s e n t e d . large scale s y s t e m s .
Indeed,
for c h e c k i n g s t r u c t u r a l c o n -
It is s p e c i a l l y s u i t a b l e f o r a p p l i c a t i o n in
b y u s i n g an a p p r o p r i a t e
decomposition of t h e s y s t e m
t h e global c o n d i t i o n s a r e e x p r e s s e d in t e r m s of s e v e r a l c o n d i t i o n s r e f e r i n g to smaller dimensioned s y s t e m s ( T R A - 8 6 a ) . tial way.
The c h e c k i n g can t h u s b e c a r r i e d o u t in a s e q u e n -
32 In the investigated require
next in
structural
chapter,
the
context
of large
constraints
We will s e e t h a t the introduction
the problem
the fact of taking control.
systems
and
pole assignment
whose
characteristics
these
new constraints
will b e generally
on the control.
of new concepts
the case of centralized
of s t a b i l i z a t i o n
scale
into account
which appear
as
an extension
of those
y i e l d s to defined
in
CHAPTER
STRUCTURALLY
2
CONSTRAINED
STABILIZATION
AND
POLE
CONTROL
•
ASSIGNMENT
2. I. - I N T R O D U C T I O N
In high
the
control
of
dimensionality,
reasonable assumption system
is
large
conventional
computational
efforts.
of a centralized available
For most large geographical
economical and
systems
techniques
whose fail
to
pattern
center,
control. particular
system
this centralization the
of
problems
information.
related
the design of feedback
When no transfer this yields
to
a
pairs
(those of minimum cost information pattern.
for
These
station 1
the
position,
2.1.a
with on the
on where
the all
example) situations
are
allowed
................
station i
- Decentralized
leads
This that
part
requires
to
implies are only
of the whole
restrictions
on the
can connect.
the different
are illustrated
transfer.
to g e n e r a t e
controllers
of control.
constraint
o f local c o n t r o l l e r s
in o r d e r
between
scheme
does not hold due
new
When
local s t a t i o n s
some but
we o b t a i n by Figure
................
not
structurally-constrained
is allowed, all t r a n s f e r s
a nonstandard 2.1 :
station S
L A R G E SCALE SYSTEM
Figure
stands
information
assumption This
that the controller
of information
decentralized
all
their
solutions
generally
to t h e i n f o r m a t i o n
of the whole information
output-input
reasonable
is
out.
scale systems,
In particular,
characteristic
a geographical
distribution
reliability part
give
~ i.e.,
generally
that the control system should he made of a number allowed to u s e
essential
The classical control theory
information
at a given
the calculations can be carried
to t h e
scale
control
reduced
34
l
i yll
[. . . .
station 1
.............
Controller 1
Controlleri I. . . . station i
ControllerS [
..............
station S
L A R G E SCALE SYSTEM
Figure
2.1.b.
It is clear vantageous
that
: system
which observe
for the
the
decentralized
since no transfer
is required tions),
- Example of arbitrarily
problem
centralized
inputs
second
paragraph
general
case of arbitrarily
of this
scheme
is the
are
to a
assigned and
refering
These
set
l o c a t i o n to a n o t h e r
o f local c o n t r o l l e r s
T h i s is t h e r e a s o n
pole assignment
The results chapter.
given
outputs.
results
the first
were investigated
to t h i s
structurally-constrained
control
most economically ad-
from one geographical
o n l y local s y s t e m
scheme.
control
of information
of stabilization
control
structurally-constrained
study
were
then
(stastudies
within
a de-
are presented extended
in the
to t h e
control which is considered
more in the
third paragraph.
2.2. - D E C E N T R A L I Z E D
Consider
a large
model. As pointed partitioning
The
scale
CONSTRAINTS
system
represented
o u t in t h e i n t r o d u c t i o n ,
of the
tion stations. particular
STRUCTURAL
control
and
reflect
a linear time-invariant
its geographical
the observation
models retained
by
this
in several situation
dynamic
decomposition results
in a
local c o n t r o l a n d o b s e r v a -
and
appear
in t h e
following
forms :
I-Frequency-domain model
Yl
"Wl I(P)
W I S(p)-
I I
I I I I I I
YS
u,! 1 i I
I I I !
wsl(P)
Wss(P)
uS
(2.2.1)
35 2-Time-domaln model
I
x(t) = A x(t)
+
S Z i=l
LYi(t) = C i x ( t ) where
x(t)
uiE:Rmi
~
Rn
(2.2.2)
(i=1 . . . . .
is
the
a n d Yi C R r i
observation station, R e m a r k 2.1.
Bi u i ( t ) S)
state.
The
input
are the input
specified
output
vectors
vectors
Note t h a t t h e s t a t e v e c t o r is n o t p a r t i t i o n e d ,
subsystems. for
are
partitioned
:
of the ith control and
(i=l . . . . . S t .
t h e s y s t e m i t s e l f is t a k e n a s a w h o l e I i . e . , results
and
and the output
The
following
"interconnected
systems"
reflecting
it is n o t d e c o m p o s e d
results
hold
will b e
in
this
presented
as
general
the
fact that
into several wellframework.
a particular
case
The in
a
further paragraph. Let u s d e f i n e : S m ~ iEI= m i
c, =
B = [131, ..., B S]
S r = i~l= I
,
.....
ri
%1
(2.2.37 y'
=
such that system
{
x(t)
u'= [u~ ,..., ~,]
[y~, ..., Y~]
(2.2.2)
= A x(t)
can be rewritten
in t h e following g l o b a l form :
+ B u(t)
(2.2.4)
y(t) = C x(t)
2.2.1.
- Problem
formulation
If a d e c e n t r a l i z e d with e a c h s t a t i o n .
Every
control structure
is desired,
local c o n t r o l l e r i s d e s c r i b e d
a local c o n t r o l l e r i s a s s o c i a t e d by the
following g e n e r a l m o -
del :
fui(t)
= Qi z i ( t ) + Ki Yi (t) + v i ( t ) (2.2.5)
! ~i(t)
S i z i ( t ) + R i Yi (t)
36
w h e r e z i ( t ) E R v i i s t h e s t a t e of t h e i t h c o n t r o l l e r a n d v i ( t ) ~ Rmi is t h e i t h e x ternal input. This control structure
associated with system
(2.2.2)
(2.2.4)
is r e p r e s e n t e d
b y F i g u r e 2.2 :
I
SYSTEM
F i g u r e 2.2 Let u s d e f i n e : S = block-diag.
(S1,...,Ss)
R = block-diag.
(R 1 . . . . ,R S)
Q = block-diag.
( Q I ' . . . . QS )
K = block-diag.
(K1,...,Ks)
z ' ( t ) = (z' 1 . . . . . z' s ) v'(t) = (v' 1 ..... V's)
t h e n , t h e global c o n t r o l l e r is d e s c r i b e d b y • l u(t) = Q z(t) + K u(t) + v(t)
(2.2.6) ~.(t) = S z ( t ) + R y ( t ) where the decentralization
appears
in t h e b l o c k - d i a g o n a l
structure
of t h e m a t r i c e s
S , R , Q a n d K. We c o n s i d e r
t h e p r o b l e m of s t a b i l i z i n g
the
s i g n i n g i t s p o l e s ) w i t h a c o n t r o l law s p e c i f i e d b y
system
(2.2.4)
(or a s -
(2.2.6).
T h i s p r o b l e m is
e q u i v a l e n t to t h e p r o b l e m of e x i s t e n c e of a s e t of m a t r i c e s S , R , Q
and K such that
the closed-loop system :
(2.2.5)
(2.2.2)
37
I 'c :°1
z(t)J
RC
is a s y m p t o t i c a l l y s t a b l e ( i . e . ,
2.2.2.
- Decentralized
Even if t h e (2.2.2)
(2.2.4)
fixed
[:l
[z(t)
v(t)
all i t s p o l e s h a v e a n e g a t i v e r e a l p a r t ) .
modes
conditions
for
the
stabilization
(or pole
h o l d with a c e n t r a l i z e d i n f o r m a t i o n p a t t e r n
assignment}
is n o t always s t a b i l i z a b l e (pole a s s i g n a b l e } with a d e c e n t r a l i z e d c o n t r o l . 78b1 p r o v i d e d
the
example
of a completely
controllable
of
system
(see § 1 . 2 . 6 1 , t h e s y s t e m interconnected
Wang (WANsystem
for
which e v e r y s u b s y s t e m ( A i i , B i ) was also c o n t r o l l a b l e s u c h t h a t t h e c o n d i t i o n s f o r i t s s t a b i l i z a t i o n b y m e a n s of c e n t r a l i z e d s t a t e f e e d b a c k w e r e s a t i s f i e d .
Nevertheless,
showed t h a t
constraints
the
system
could not
be
s t a b i l i z e d if d e c e n t r a l i z e d
he
were
imposed on t h e c o n t r o l . This means that additional conditions
are required.
e x p r e s s e d in t e r m s of t h e new c o n c e p t of d e c e n t r a l i z e d
These
conditions
f i x e d modes.
can b e
This concept
was i n t r o d u c e d b y Wang a n d D a v i s o n i n 1973 (WAN-73bl. Definition 2.1 (WAN-73b). G i v e n t h e t r i p l e ( C , A , B ) a s s o c i a t e d w i t h t h e s y s t e m (2.2.41 w i t h A g R n x n , B ~ R nxm a n d C g: R r x n l e t u s d e f i n e ~d as t h e s e t of block-diagonal matrices :
~d={KlK=block-diag. ( K 1 , . . . , K s I
, K i ~ Rm x r ,
( i : l , . . . . S}}
(2.2.7)
T h e d e c e n t r a l i z e d f i x e d polynomial of s y s t e m ( 2 . 2 . 4 ) is t h e n d e f i n e d as : (p,C,A,B
fld ) = g . c . d
(2.2.8)
{dot ( p I - A - B K C ) }
K ~ ~d Definition 2.2 (WAN-73bl. T h e s e t of f i x e d modes of s y s t e m t h e c o n t r o l law ( 2 . 2 . 6 ) A (C.A,B ~d ) =
(2.2.4)
with r e s p e c t to
( d e c e n t r a l i z e d f i x e d modes1 is g i v e n b y : n o(A + B K C )
Kc~ d w h e r e a ( . ) d e n o t e s t h e s e t of e i g e n v a l u e s of ( . ) .
(2.2.9)
38
It is c l e a r t h a t t h e d e c e n t r a l i z e d f i x e d modes a r e t h e z e r o s of t h e d e c e n t r a l i z e d f i x e d polynomial a n d can t h u s b e d e f i n e d as : h ( C , A , B , ~d ) = { p e ~ Note t h a t
A (C,A,B,
/
~d) c o (A)
s i n c e K--0 i s an element of ~d" T h e d e c e n -
t r a l i z e d f i x e d modes of t h e s y s t e m ( 2 . 2 . 4 ) that
cannot be
(2.Z.10)
~ (p,C,A,B, ~d ) = 0 }
a r e t h e r e f o r e t h e modes of t h e s y s t e m
moved with a decentralized control
(2.2.6),
i n d e p e n d e n t l y of t h e
p a r a m e t e r v a l u e s a s s i g n e d to t h e c o n t r o l l e r ( m a t r i c e s S , Q , R a n d K ) . T h e following f i g u r e i l l u s t r a t e s t h e s i t u a t i o n :
O ( A + B K 3 c) O (A+BI~ IC)
(A) h (C,A,B, ~d )
0 (A+BK
K 1,K 2 ,K 3 C ~d
F i g u r e 2.3
It is now i n t e r e s t i n g to n o t e t h a t t h e s e t o f f i x e d modes d o e s n o t d e p e n d on t h e dynamical o r n o n - d y n a m i c a l n a t u r e of t h e c o n t r o l . If a d e c e n t r a l i z e d s t a t i c f e e d b a c k c o n t r o l is u s e d i n s t e a d of ( 2 . 2 . 6 ) zero,
the
~ i.e.,
the matrices S and R are identically
s e t of d e c e n t r a l i z e d f i x e d modes r e m a i n s t h e same (WAN-73b).
only d e p e n d s on t h e p a r t i c u l a r o u t p u t - i n p u t p a t t e r n
This s e t
specified by the s t r u c t u r e
of
t h e m a t r i x K. From t h e i r d e f i n i t i o n , t h e d e c e n t r a l i z e d f i x e d modes a p p e a r i n t u i t i v e l y as an e x t e n s i o n of t h e w e l l - k n o w n u n c o n t r o l l a b l e a n d u n o b s e r v a b l e modes d e f i n e d in C h a p t e r 1. The r e l a t i o n s b e t w e e n t h e s e c o n c e p t s a r e c l a r i f i e d b y f u r t h e r d i s c u s s i o n . Consider
the
triple
(C,A,B)
associated
to t h e
canonical form
(1.2.4)
of a
g e n e r a l s y s t e m ( 1 . 2 . 1 ) . If t h e s y s t e m is c o n t r o l l e d b y c e n t r a l i z e d o u t p u t f e e d b a c k of t h e form ( 1 . 2 . 9 ) with K e R m x r , Wang a n d Davison (WAN-73b) s h o w e d t h a t : A ( C , A , B , R mxr) = o ( A l l ) u o (A33) V o (A44).
39 T h i s r e s u l t p o i n t s o u t t h a t t h e s e t of c e n t r a l i z e d f i x e d m o d e s i s t h e u n i o n o f t h e u n c o n t r o l l a b l e a n d u n o b s e r v a b l e m o d e s . T h e a n a l o g y is c l e a r w h e n we t h i n k t h a t uncontrollable and unobservable modes are those that cannot be moved by the control : it w a s s h o w n i n C h a p t e r
1 t h a t t h e f i r s t o n e s a r e d i s c o n n e c t e d from t h e i n p u t
a n d t h e s e c o n d o n e s from t h e o u t p u t .
From a n o t h e r h a n d ,
i f we d e n o t e t h e s e t o f
c e n t r a l i z e d f i x e d m o d e s b y Ac p t h e following d e f i n i t i o n h o l d s : h
c
= A (C,A,B,R mxr) =
where the analogy with the
n o (A + BKC) K ( Rmxr
definition
(2.2.9)
(2.2.11)
of d e c e n t r a l i z e d
fixed modes is ob-
vious.
Clearly,
from the
definitions
(2.2.9)
and
(2.2.11),
and since
~d c R m x r ,
the
s e t of c e n t r a l i z e d f i x e d m o d e s i s i n c l u d e d i n t h e s e t o f d e c e n t r a l i z e d f i x e d m o d e s : Ac c Ad
where hd =
(2.2.12)
h
fld).
(C,A,B,
We u n d e r s t a n d
intuitively that the modes that
cannot be moved u s i n g a c e n -
tralized control c e r t a i n l y c a n n o t be moved u s i n g a d e c e n t r a l i z e d control.
2 . 2 . 3 . - D e c e n t r a l i z e d s t a b i l i z a t i o n a n d pole a s s i g n m e n t
Due tralization, tralized
to
the
the
output
great
economical a n d
problem of stabilization feedback
76a,b) (FES-79)
(FES-80)
has
been
reliability and
pole
investigated
(POT-79)
by
advantages assignment
provided by
many authors
by
decen-
of
decen-
(AOK-72)
(COR-
means
(WAN-73a,b).
Only t h e m o s t r e l e v a n t r e s u l t s
are presented
here.
T h e r e s u l t s of Wang a n d
D a v i s o n (WAN-73b) t h a t c l e a r l y p o i n t o u t t h e i m p o r t a n c e of d e c e n t r a l i z e d f i x e d m o d e s in t h i s p r o b l e m a r e Morse ( C O R - 7 6 ) , complete s o l u t i o n .
presented
first.
Then,
we p r e s e n t
the study
of C o r f m a t a n d
who h a d a d i f f e r e n t a p p r o a c h to t h e p r o b l e m a n d p r o v i d e d a m o r e
40 2 . 2 . 3 . a . - Wang a n d Davison r e s u l t s (WAN-73b) The following t h e o r e m a n d c o r o l l a r y s t a t e t h e c o n d i t i o n s f o r t h e e x i s t e n c e of a s o l u t i o n in t e r m s of d e c e n t r a l i z e d o u t p u t
f e e d b a c k in o r d e r to s t a b i l i z e t h e s y s t e m
( o r to a s s i g n i t s p o l e s ) . Theorem (2.2.4) and
2.1
(WAN-73b).
Given
the
triple
(C,A,B)
associated
a n d ~d t h e s e t of b l o c k - d i a g o n a l m a t r i c e s d e f i n e d in
s u f f i c i e n t c o n d i t i o n for t h e
with
(2.2.7),
e x i s t e n c e of a c o n t r o l law
(2.2.6)
the
system
a necessary
such that the
c l o s e d - l o o p s y s t e m ( 2 . 2 . 7 ) i s a s y m p t o t i c a l l y s t a b l e is t h a t : h d = A ( C , A , B ~cl) c where
~-
Corollary
~-
(2.2.13)
d e n o t e s t h e l e f t h a l f p a r t of t h e complex p l a n . 2.1.
Under
the
same a s s u m p t i o n s
as in t h e o r e m
s u f f i c i e n t c o n d i t i o n f o r t h e e x i s t e n c e of a c o n t r o l law ( 2 . 2 . 6 )
2.1,
a necessary
and
s u c h t h a t all t h e poles
of t h e c l o s e d - l o o p s y s t e m a r e in ~) is t h a t : h d = h ( C , A , B ~d ) c ~ where
~
(2.2.14)
is a n a r b i t r a r y p r e s p e c i f i e d s y m m e t r i c r e g i o n of t h e complex p l a n .
As a r e s u l t of t h e a b o v e c o r o l l a r y , t h e p o l e s of t h e s y s t e m can b e a r b i t r a r i l y a s s i g n e d if a n d only if :
Ad= ~ The s i m i l a r i t y b e t w e e n t h e s e r e s u l t s and t h o s e p r e s e n t e d for c e n t r a l i z e d c o n t r o l in p a r a g r a p h e
1 . 2 . 6 e m p h a s i z e s t h e f a c t t h a t d e c e n t r a l i z e d f i x e d modes a r e t h e
g e n e r a l i z a t i o n of u n c o n t r o l l a b l e a n d u n o b s e r v a b l e m o d e s to d e c e n t r a l i z e d c o n t r o l .
[20o E'] II
Example 2.1. C o n s i d e r t h e following 2 - s t a t i o n l i n e a r t i m e - i n v a r i a n t d y n a m i c s y s t e m :
~(t) =
Yl(t) =
o
a
o
0
0
-I
~1
1
OJ
x(t) +
o
0
x(t)
ul(t)
+
u2(t)
41
where a is an a r b i t r a r y r e a l p a r a m e t e r . The d e c e n t r a l i z e d o u t p u t f e e d b a c k matrices K h a v e t h e following s t r u c t u r e
K =
F [ kl
L The
0
0
poles
:
k2 of t h e
system
det(kI-A)=(k.-2)(k+l)(),-a).
are
Since
the
zeros
~=2 is a z e r o ,
of
the
characteristic
polynomial :
the open-loop s y s t e m is u n s t a b l e
i n d e p e n d e n t l y of the s i g n of a. The poles of t h e closed-loop system are the z e r o s of the closed-loop c h a r a c teristic polynomial : det(kI-A-BKC)=(~-2-kl)
(k + l - k 2 ) (k-a)
From Definition 2.1, the d e c e n t r a l i z e d fixed polynomial is ()~-a) and t h e system has a d e c e n t r a l i z e d
fixed mode at
assigned by an a p p r o p r i a t e
k=a.
A l t h o u g h t h e pole
~=2 can be a r b i t r a r i l y
choice of k 1, the pole ;~ =a cannot be m o v e d , N e v e r t h e -
less, if a(0~ the system is stabilizable.
2.2,3.b.
- Corfmat and Morse r e s u l t s (COR-76)
The a b o v e problem was c o n s i d e r e d geometric a p p r o a c h
(COR-75)
by
Corfmat
and
Morse in
1976 u s i n g
a
(WON-74), The problem was a p p r o a c h e d by a n s w e r i n g
the following q u e s t i o n : "Is t h e r e a control law in the form of a s t a t i c d e c e n t r a l i z e d o u t p u t f e e d b a c k such that the system becomes controllable and o b s e r v a b l e by a single station ?" If the a n s w e r is p o s i t i v e ,
the s t a n d a r d
algorithms of c e n t r a l i z e d control can
then be u s e d for the design of an additional dynamic c o n t r o l l e r a s s o c i a t e d with this station s u c h t h a t t h e stabilization or pole a s s i g n m e n t is a c h i e v e d . For the system
(2.2.4),
this a p p r o a c h leads to t h e following control laws and
is i l l u s t r a t e d b y F i g u r e 2.4 :
I
t u i t) = Ki Yi (t) + v i ( t ) ~j(t) Sj z j ( t ) + Rj y j ( t )
/vj(t)
(i=l,...,s) j ¢
Qj zj(t) + Nj y j ( t )
{1 . . . . .
s)
(2.2.1s)
42
1 I I
vl+~ uj
[ I I [ I
~Yl ,] I UlLf
lY-
i
SYSTEM
vs
÷~'I~ ---~-~
I I I I I I
--~
I S I _.i
Observator F i g u r e 2.4 Of c o u r s e ,
the initial system
(2.2.4)
is s u p p o s e d
t o b e globally c o n t r o l l a b l e
and observable. Corfmat and (digraph)
Morse a n a l y s i s is b a s e d
to t h e s y s t e m .
on t h e a s s o c i a t i o n of a d i r e c t e d
graph
A n o d e is a s s o c i a t e d to e v e r y s t a t i o n a n d an e d g e e x i s t s
from t h e n o d e i to t h e n o d e j i f a n d o n l y if : Wij (p) = Cj ( p I - A ) - I Bi ~ 0 i.e.,
if t h e o u t p u t a t s t a t i o n j c a n b e a f f e c t e d b y t h e i n p u t at s t a t i o n t .
Example 2°2. C o n s i d e r t h e following s y s t e m d e s c r i b e d i n t h e f r e q u e n c y - d o m a i n b y :
w11(p) o oj W(p)= 21~p) w32Wz2(P)(p)wa3(P)o T h e a s s o c i a t e d g r a p h is t h e following :
43
3 Definition Z.3. A s y s t e m is s a i d to b e s t r o n g l y c o n n e c t e d if i t s a s s o c i a t e d d i g r a p h is strongly connected.
(Note t h a t t h i s does n o t n e c e s s a r i l y imply t h a t all t h e t r a n s f e r
matrices Wij(p) a r e # 0 ) . A non-strongly-connected
s y s t e m c a n always b e d e c o m p o s e d i n s e v e r a l s t r o n g l y
c o n n e c t e d subsystems c o n s t i t u t e d b y t h e s t a t i o n s a s s o c i a t e d with t h e n o d e s d e f i n i n g the s t r o n g c o m p o n e n t s of t h e d i g r a p h . In t h e e x a m p l e 2 . 2 ,
t h e s y s t e m is n o t s t r o n g l y c o n n e c t e d a n d c a n b e d e c o m -
posed in two s t r o n g l y c o n n e c t e d s u b s y s t e m s ,
Sl
- Yl = W l l ( P )
which are :
Ul
s2 Fy21222(P 2g(P ]
Definition 2.4 ( C O R - 7 6 ) .
A single station system given by the triple (C,A,B) is said
to be complete if :
i - C (pI-A) -I B # 0 ii - the remnant polynomial p (C,A,B) (COR-76) defined as the product of the n~ R (A nI.x n ) t o first invariant polynomials (ROS-70)of the matrlxl},IcA 0BI is equal
Remark 2 . 2 .
rank[
( C O R - 7 6 ) . C o n d i t i o n ii is e q u i v a l e n t to :
> n
for
Vk ~_o(A)
L
C
i.e.j
no p o l e of t h e s y s t e m is s i m u l t a n e o u s l y u n c o n t r o l l a b l e a n d u n o b s e r v a b l e
1.2.4).
(see §
44 Let u s i n t r o d u c e now a f u n d a m e n t a l d e f i n i t i o n in t h e
study
of m u l t i - s t a t i o n
s y s t e m s -" t h e c o n c e p t of c o m p l e m e n t a r y s u b s ) r s t e m s . Definition 2 . 5 . C o n s i d e r t h e S - s t a t i o n s y s t e m ( 2 . 2 . 2 ) . a n d the p a r t i t i o n
Ha= { i l , . . . , i k}
Define t h e s e t s ~ = { 1 , . . . , S }
, ~8 = {ik+l . . . . . i s } .
T h e s y s t e m is t h u s p a r d -
t i o n e d in two a g g r e g a t e d s t a t i o n s a a n d 8 • Define t h e following m a t r i c e s :
°o=
L % .....% ]
i,
C
58 =
(%
=
E B i k + l . . . . . BiS ]
Ii ik
L%J
H e n c e , t h e s e t of c o m p l e m e n t a r y s u b s y s t e m s of s y s t e m (2.2.2) is d e s c r i b e d by t h e t r i p l e s (C B , A , B a ) '
(k=l,...S-1).
T h e f i r s t r e s u l t of Corfmat a n d Morse d e a l s w i t h s t r o n g l y c o n n e c t e d s y s t e m s : Theorem 2.2 (2o2ol)
(COR-76b).
(2°2.2).
Consider the
globally c o n t r o l l a b l e a n d o b s e r v a b l e s y s t e m
T h e n , u s i n g t h e c o n t r o l laws s p e c i f i e d b y ( 2 . 2 . 1 5 ) ,
with a r b i t r a r y
j ¢ {1 .... s} * t h e s p e c t r u m of t h e s y s t e m c a n be a s s i g n e d a r b i t r a r i l y if a n d o n l y i f all i t s comp l e m e n t a r y s u b s y s t e m s a r e c o m p l e t e . T h i s is e q u i v a l e n t to :
i - C 6 (pI-A) -I B a #0
(k=l ..... S-1)
(2.2.1) (2.2.2) is strongly connected. ii - p ( C s , A , B a) = 1 (k=l ..... S-l) with 0 (C B ,A.Ba ) denoting the remnant polynomial of the complementary subsystem (C~ , A , B ). * t h e s y s t e m can b e s t a b i l i z e d if a n d o n l y if : - C o n d i t i o n (i) h o l d s . iii- p (C~ , A , B a) i s a s t a b l e polynomial, (k=l . . . . . S - l ) . Note
that
a necessary
c o n d i t i o n for t h e
e x i s t e n c e of a d e c e n t r a l i z e d s t a t i c
o u t p u t f e e b a c k t h a t makes t h e s y s t e m c o n t r o l l a b l e a n d o b s e r v a b l e b y a s i n g l e s t a t i o n , is t h a t t h e s y s t e m is s t r o n g l y c o n n e c t e d .
Example
2.3
(KAT-81).
Consider
the globally controllable and observable
described by the following matrices :
system
io,,
45
0 0 0
A:
o
o
I
BI=
0 0 0
'
~:[o
[
I
o
o
,
152= 0 I
o]
m a t r i x of t h e s y s t e m is :
o l p2(p_2)
Wll(p)
Wl2(P)]_
l
W21(P)
W22(P)J - p2 (p- l)(p-2)
Since W l Z ( P ) = C I ( P I - A ) - I B 2 strongly connected and condition
* Calculation of
p2 (p=2)
0
p2(p-2)
o
¢ 0,
t h e s y s t e m is
a r e ( C 2 , A , B I) a n d ( C 1 , A , B 2 ) .
O ( C 1 , A , B 2) :
I that can be p u t
p(p=l) _(p_l) 1
¢ 0 and W21(P)=C2(PI-A)-IB1 (i) of t h e o r e m 2.2 h o l d s .
The complementary subsystems
mials :
o
1
0
o
The transfer
=
0
oo oo 1 I o
CI =
W(p)
[, I°J
X
I=A Cl
B21 0
in Smith)s form
=
X
-I
-I
0
X
0
-I I 0
0 0
0 0
),-I 0
0 I 0 X-2 lj 1
l
0
0
i
0
0
(ROS-70)
0
0
0
0 0 1 0
I 0
0
0 0
to make a p p a r e n t
the invariant
polyno-
46 ! o I I 0
0
l !
0
1
I I I
0 0
-,1
=~
0 (CI,A,B 2) : 1
1
o
O.Q_
o
* Calculation o f
0(C2,A,B1)
:
C2
),
-I
-I
0
k
0
0
0
k-I
0
0
0
0
0
1
0 -I 0 k-2 0
a n d S m i t h ' s form is t h e following : i
E
I
1
9_
a
I
I
0 --
o
--
I I
l 0
I
=~
p (C2,A,131) : 1
k 2(I-2)
All t h e c o m p l e m e n t a r y s u b s y s t e m s a r e c o m p l e t e . A c c o r d i n g to T h e o r e m 2 . 2 , the s p e c t r u m of t h e s y s t e m can b e a r b i t r a r i l y a s s i g n e d b y u s i n g
first a static output
f e e d b a c k at s t a t i o n 2, w h i c h m a k e s t h e s y s t e m c o n t r o l l a b l e a n d o b s e r v a b l e b y s t a t i o n 1, a n d t h e n a p p l y i n g an a p p r o p r i a t e dynamic o u t p u t f e e d b a c k at s t a t i o n 1 f o r w h i c h s t a n d a r d d e s i g n t e c h n i q u e s can b e u s e d ( B R A - 7 0 ) . Example 2 . 4 . C o n s i d e r now t h e globally c o n t r o l l a b l e a n d o b s e r v a b l e s y s t e m d e s c r i b e d b y t h e following m a t r i c e s :
47 0
1
0
0
0
1
0
0
l
A =
Cl
0
O
1
0
0
0
0
1
I
o
o
o]
o
I
o
o
o
o
o
I
I
which is also s t r o n g l y
* C a l c u l a t i o n of
0
k-I
0
0
o
o
o
1
0
0
connected.
p (CI1,A,B2)
- 1
0
B2=
Bl=
=
-~,
[°1 il 0
:
o
o
0
0
X-I
0
o
o7
I I I I I I
~,-1
I I
I !
0 0
I
I
0
0
0
o
1
o
o So,
i
o
O
--~
tl J
o__
0 o_
p ( C . 2 ± A , B 1)
k-I
: 0
0
0
0 1 |
o
~.-I
o
o
o
o
o
X-I
O
o
1
l
0
P ( C 2 , A j B 1)
=X-i.
i
1
o
o
o
o
o
I [
o
1
--o
[I
o _
Consequentlyp
0 --
x-ll
-
i
l
Lj ]
0
o
not v e r i f i e d .
o
I
o
0 0 P(CI,~,B2) = 1
* Calculation o f
I I
I
I 1
I
o
I
_o
conditions
(ii)
x (x
and
(iii)
-t)
of Theorem
T h i s s y s t e m c a n n o t b e s t a b i l i z e d b y a c o n t r o l law o f t h e k i n d
2.2
are
(2.2.15)
since t h e mode k 1=1 c a n n o t b e m o v e d b y d e c e n t r a l i z e d c o n t r o l .
In the
case
cedure proposed
for which the
by Corfmat and
conditions of Theorem Morse leads
2.2 a r e
satisfied,
to all m e m o r i l e s s c o n t r o l l e r s ,
the
pro-
save one
48 of h i g h c o m p l e x i t y ( o r d e r n - l ) . s e n t s some d i s a d v a n t a g e s .
From a p r a c t i c a l p o i n t of v i e w , t h i s s i t u a t i o n p r e -
In p a r t i c u l a r ,
it g e n e r a l l y r e q u i r e s h i g h g a i n s : e v e n if
all t h e m o d e s of t h e s y s t e m a r e c o n t r o l l a b l e a n d o b s e r v a b l e a t o n e station~ some of them m i g h t h a v e a weak d e g r e e o f c o n t r o l l a b i l i t y o r o b s e r v a b i l i t y , t h a t n e e d s to be c o m p e n s a t e d b y h i g h g a i n s . It would be b e t t e r to s p r e a d t h e c o n t r o l c o m p l e x i t y more e q u a l l y among t h e local c o n t r o l l e r s , i . e . ,
to e n d o w e a c h local c o n t r o l l e r with some
d y n a m i c s . A r e s u l t in t h i s d i r e c t i o n was o b t a i n e d b y A n d e r s o n a n d L i n n e m a n n (AND84)
for
interconnected systems
(the
subsystems are
interconnected through
their
inputs and outputs). They showed that, t r o l l e r can b e t a k e n
for stabilization p u r p o s e ,
t h e o r d e r of t h e i t h local c o n -
at l e a s t e q u a l to t h e n u m b e r o f s t a b l e z e r o s of t h e i t h
sub-
s y s t e m , while t h e t o t a l o r d e r o f t h e d e c e n t r a l i z e d c o n t r o l l e r (sum of t h e o r d e r s o f t h e local c o n t r o l l e r s ) does n o t e x c e e d n - 1 . A l t h o u g h T h e o r e m 2.2 p r o v i d e s an i n t e r e s t i n g r e s u l t , t h e whole p r o b l e m is n o t solved yet.
The c o n d i t i o n s r e q u i r e d b y T h e o r e m 2.2
guarantee
t h e e x i s t e n c e of a
c o n t r o l law t h a t u s e s only one d y n a m i c c o n t r o l l e r at one s t a t i o n . T h e y a r e t h e r e f o r e much too c o n s t r a i n i n g
for
our
problem which
allows
dynamic
controllers
at
each
s t a t i o n . In t h e s e c o n d p a r t o f t h e i r w o r k , Corfmat a n d Morse (COR-76b) r e l a x e d t h e c o n s t r a i n t s of T h e o r e m 2.2 a n d t h e r e b y p r o v i d e d t h e complete s o l u t i o n of t h e p r o blem. Theorem
2,3.
Consider
the
globally
controllable
and
T h e n , with a d e c e n t r a l i z e d c o n t r o l s u c h t h a t ( 2 . 2 . 6 )
observable
system
(2.2.4).
:
* i t s s p e c t r u m can b e a r b i t r a r i l y a s s i g n e d if a n d o n l y i f t h e sum o f t h e d i m e n s i o n s of t h e s t r o n g l y c o n n e c t e d s u b s y s t e m s is e q u a l to t h e dimension of t h e whole system (2.2.4),
a n d if t h e s p e c t r u m o f e v e r y s t r o n g l y c o n n e c t e d s u b s y s t e m can b e
arbitrarily assigned. * the system spectra
of
the
(2.2.4)
strongly
c a n b e s t a b i l i z e d if a n d o n l y if t h e complement o f t h e connected
subsystems
with
the
spectrum
of . t h e
system
( 2 . 2 . 4 ) is s t a b l e , a n d if e v e r y s t r o n g l y c o n n e c t e d s u b s y s t e m can b e s t a b i l i z e d . Example matrix :
2.5.
Consider
the
2-station
system
described
by
the
following t r a n s f e r
49
W(p)=
[
1
p- 1
p-I-E
o
1 P
This s y s t e m is n o t s t r o n g l y c o n n e c t e d and the two s t r o n g l y c o n n e c t e d s u b s y s tems a r e , in t h i s c a s e , r e d u c e d to s l n g l e - s t a t i o n s y s t e m s .
T h e i r s p e c t r a can t h e r e -
fore be a r b i t r a r i l y a s s i g n e d . Both a r e of dimension 1. * Case 1 • E = 0. In this case,
the dimension o f the global system is 2 and it is
equal to t h e sum of the dimensions of the s t r o n g l y
connected subsystems.
Either
stabilization or pole a s s i g n m e n t a r e p o s s i b l e . * Case 2 : E~ 0. In this c a s e , the dimension of the global system is 3. The pole XI=I+E
c a n n o t be moved b y a d e c e n t r a l i z e d c o n t r o l .
of the system remains possible if Xl=l+c
2.2.3.c.
N e v e r t h e l e s s , the stabilization
is s t a b l e .
Comments
-
The r e s u l t s of Corfmat and Morse were c a r r i e d out using geometrical methods (WON-74) obtained
of system equivalent
theory. results
With the using
same a p p r o a c h ,
polynomial matrix
Fessas
methods
(FES-79) (ROS-?0)
(FES-80) (WOL-74).
Potter et al. (POT-79) also t r e a t e d the same problem in the case of 2 - s t a t i o n systems and p r o v i d e d e q u i v a l e n t conditions e x p r e s s e d in terms of a r a n k condition for the system matrix. T h e i r r e s u l t is s t a t e d in the following theorem :
Theorem 2 . 4 . .
C o n s i d e r a globally controllable and o b s e r v a b l e 2-station
system
(C 1
C 2, A, B 1 B 2) with C I ( P I - A ) - I B 2 ~ 0 and C 2 ( P I - A ) - I B 1 ~ 0 ( i . e . , the system is strongly c o n n e c t e d ) . T h e r e e x i s t s an r e a l - v a l u e d f e e d b a c k matrix K 2 of a p p r o p r i a t e dimension s u c h t h a t the system (C1,A + B2K2C2,B1) is controllable and o b s e r v a b l e if and only if :
I I-A
rank /
X
LC2
~ 11
n
~ % ~ o(A)
(2.2.16a)
50
rank [~I-A
~21
~ n
~ ~ ~ o (A)
(2.2.16b)
As it will b e s e e n in t h e n e x t c h a p t e r ,
conditions (2.2.16) present the interest
C 1
to b e t h e same as t h e c o n d i t i o n p r o v i d e d b y A n d e r s o n a n d Clements (AND-81a) characterize
decentralized
characterizations
fixed modes.
of f i x e d modes
The next
chapter
deals with t h e
to
different
in t h e t i m e - d o m a i n a n d in t h e f r e q u e n c y - d o m a i n .
T h e e q u i v a l e n c e b e t w e e n t h e r e s u l t s of Corrnat a n d
Morse a n d t h o s e of Wang a n d
D a v i s o n e x p r e s s e d in t e r m s of fixed modes will t h u s b e c l a r i f i e d . However,
a n immediate c o r r e l a t i o n c a n b e e s t a b l i s h e d from t h e following t h e o -
rem o b t a i n e d b y F e s s a s ( F E S - 8 0 ) . Theorem 2.5.
C o n s i d e r t h e globally c o n t r o l l a b l e a n d o b s e r v a b l e s y s t e m
suppose
i t is s t r o n g l y
that
connected.
This system
(2.2.4)
and
c a n b e made c o n t r o l l a b l e a n d
o b s e r v a b l e b y a s i n g l e s t a t i o n u s i n g a s t a t i c d e c e n t r a l i z e d c o n t r o l if a n d o n l y if t h e s y s t e m h a s no f i x e d m o d e s .
2.3. - A R B I T R A R Y
STRUCTURAL
CONSTRAINTS
As was p o i n t e d o u t in t h e i n t r o d u c t i o n , metimes allowed to s h a r e information pattern the controller structural
some i n f o r m a t i o n .
reflecting
can connect.
constraints
a particular
t h e d i f f e r e n t local s t a t i o n s a r e s o -
This yields
to a n o n - s t a n d a r d
c o n f i g u r a t i o n of o u t p u t - i n p u t
reduced pairs
that
T h e a n a l y s i s of t h e p r o b l e m of c o n t r o l with a r b i t r a r y
does not require
a model of t h e s y s t e m in w h i c h t h e p a r t i -
t i o n i n g in s p e c i f i e d s t a t i o n s is a p p a r a n t . T h e s y s t e m is now d e s c r i b e d b y t h e following g e n e r a l model : £(t)
= A x(t)
y(t)
C x(t)
+ B u(t)
(2.3.1)
w h e r e x ~ R n , u 6 R m, y ~ R r a n d : B = (b 1 . . . . . b m) E: R n x m CI= (c' 1 . . . . . c' r ) ~ R r x n The particular
information pattern
m a t r i x F of d i m e n s i o n m x r s u c h t h a t '
can b e a d e q u a t e l y
described
by a binary
51 f.. = 1 i f a f e e d b a c k Ij lf'j = 0 o t h e r w i s e . For every
input
is allowed from the output
ui(t),
(i=l,...,m),
j to t h e i n p u t i.
define the following indices set
:
. . . . . r } / fij = 1}
si = { j c { t
The dynamic
controller
(2.3.2)
corresponding
to t h i s i n f o r m a t i o n
pattern
is thus
des-
cribed as follows :
I ~_i(t) = Si zi(t) + ~ rij yj(t) j£3 i [ui(t )
where zi(t)• input.
q[ zi(t) ÷ Z
J~Ji
R ~i i s t h e
state
(i=l,...,m)
kij yj(t) + vi(t)
of t h e
ith controller
Si, qi a n d rij a n d kij a r e c o n s t a n t
matrices,
The concept of fixed modes introduced case of decentralized
Definition 2.6
constraints
(SEZ-81a).
Define the set
by Wang and
vi(t)
is
the
ith
external
and scalars. Davlson
( W A N - 7 3 b ) in t h e as follows :
:
f.. = 0} 1]
t h e n , t h e s e t o f f i x e d m o d e s of s y s t e m is
and
vectors
on the control can now be generalized
~* = {K ~ R m x r / k.. = 0 if 13
by ( 2 . 3 . 3 )
(2.3.3)
(2.3.1)
(2.3.4)
with respect
to t h e c o n t r o l l a w s g i v e n
:
A (C,A,B,
~*)
= K ~ n/ *
o (A + B K C )
(2.3.5)
where a (°) denotes the set of eigenvalues of (.). This definition is the extension an a r b i t r a r y
Note t h a t i f we c o n s i d e r
K1
o f D e f i n i t i o n 2.2 t o a s e t o f m a t r i c e s
structure.
K2 c
.....
the output
feedback
matrices
:
K having
82 with t h e following i n c l u s i o n r e l a t i o n :
the corresponding sets of fixed modes of system (2.3.1) are related by the inclusion relation : A (C,A,B
fl{) c... c A (C,A,B
f~)
c
O(A)
It is c l e a r t h a t if t h e s y s t e m h a s u n c o n t r o l l a b l e o r u n o b s e r v a b l e m o d e s , t h e y will b e p r e s e n t in a n y of t h e p r e c e d i n g s e t s . This s i t u a t i o n is i l l u s t r a t e d b y t h e following f i g u r e :
k
1 F i g u r e 2.5
It was s h o w n b y S e z e r a n d Siljak (SEZ-81a) t h e e x i s t e n c e of a s e t of c o n t r o l laws ( 2 . 3 . 3 )
(SIL-82b) t h a t t h e c o n d i t i o n s for
such that the system (2.3.1)
can be
s t a b i l i z e d (or h a v e all its p o l e s a r b i t r a r i l y a s s i g n e d ) a r e t h e same as t h o s e in T h e o rem 2.1 a n d C o r o l l a r y 2.2 b u t r e p l a c i n g t h e s e t A ( C , A , B , ~ d ) b y Remark 2.3.
h (C,A,B,
~ *).
C o n s i d e r t h e p a r t i c u l a r c a s e for which t h e g e o g r a p h i c a l d i s t r i b u t i o n of
t h e s y s t e m d e f i n e s S s p e c i f i e d c o n t r o l a n d o b s e r v a t i o n s t a t i o n s s u c h t h a t t h e model of t h e s y s t e m is g i v e n b y
(2.2.4).
The i n f o r m a t i o n t r a n s f e r is d e f i n e d b y t h e p h y -
sical c o n n e c t i o n s b e t w e e n s t a t i o n s a n d it can t h e r e f o r e b e a g g r e g a t e d at t h e level of the
stations
(ui(t)
dimension mi a n d r i ) .
and
Yi(t),
(i=l . . . . , S ) ,
are
no l o n g e r s c a l a r s
but
v e c t o r s of
53
The structurally
constrained
control is now represented
a binary
by
square
matrix F o f d i m e n s i o n s S x S : f..x] = 1 i f a f e e d b a c k i s a l l o w e d f r o m s t a t i o n j t o s t a t i o n i f.. = 0 o t h e r w i s e 13 a n d t h e s e t s t h a t w e r e a s s o c i a t e d to e a c h s c a l a r i n p u t
in ( 2 . 3 . 2 )
are now associated
to e a c h c o n t r o l s t a t i o n :
zi = {J E h . . . . .
s} ! ~j = 1}
0=1 . . . . .
The dynamic controller corresponding
~i (t) = Si zi(t) +
where
s)
to t h i s i n f o r m a t i o n p a t t e r n
)~ Qij yj(t) J Jr 3i
ui(t) = H i zi(t)
+ Z
Si,Qij,Hi,Kij
are
j¢3 i
is described
by •
(i=l,...,S)
Kij yj(t) + vi(t)
matrices
of
dimensions
(~)t,vi),
(~)i,rj),
(mi,~)i),
(mi,r j),
r e s p e c t i v e l y a n d v i i s t h e i t h e x t e r n a l i n p u t v e c t o r o f d i m e n s i o n mi . Finally, t h e s e t
~*
f~* is d e f i n e d a s :
= { K 1~ R m x r
2.4. - E V A L U A T I O N
This paragraph
OF
/ K=block (Kij),
FIXED
presents
of a s y s t e m w i t h r e s p e c t routines are provided
(i,j = 1 .....
S) a n d Kij = 0 i f
fij = 0}
MODES
two algorithms for determining
to a s p e c i f i e d c o n t r o l s t r u c t u r e .
in Appendices
2.4.1. - By comparing the spectra
the set of fixed modes
The corresponding
Fortran
2 a n d 3.
of the open-loop and
closed-loop dynamic matrix This algorithm was proposed decentralized (2.2.2)
control.
It
is
based
by Davison and Ozguner on
the
definition
g i v e n b y Wang a n d D a v i s o n ( W A N . 7 3 b ) .
of
( D A V - 7 6 a ) in t h e c a s e o f decentralized
fixed
modes
54 A l g o r i t h m 2.1 : (DAV-76a) T h e s e t of f i x e d m o d e s o f t h e s y s t e m ( 2 . 2 . 4 ) control
whose
structure
d e f i n e d in ( 2 . 2 . 7 )
is
specified
by
the
set
w i t h r e s p e c t to a d e c e n t r a l i z e d
of
output
feedback
matrices
~d
c a n be c o m p u t e d a s follows :
1 - C o m p u t e t h e e i g e n v a l u e s o f m a t r i x A : o (A) 2 - Choose an a r b i t r a r y
f e e d b a c k m a t r i x Kd
C
~d
( b y g e n e r a t i o n of p s e u d o -
r a n d o m n u m b e r s for e x a m p l e ) . 3 - C o m p u t e t h e e i g e n v a l u e s of (A + BKdC) : o (A + B K d C ) . 4 - T h e f i x e d m o d e s a r e t h e e l e m e n t s of t h e i n t e r s e c t i o n of t h e two s e t s a (A) and
a (A + BKdC) ( w i t h a p r o b a b i l i t y 1 ) .
It is c l e a r t h a t t h i s a l g o r i t h m c a n e a s i l y b e e x t e n d e d to t h e c a s e o f a r b i t r a r y structural constraints by replacing the set
~d by
~* d e f i n e d in ( 2 . 3 . 4 ) .
Example 2.6 ( D A V - S 3 ) . C o n s i d e r t h e S - s t a t i o n s y s t e m g i v e n b y t h e following t r i p l e :
ii]l
o Joo i-1ol
_L _2 _i o,i,ooiO,
Following t h e s t e p s of a l g o r i t h m 1, we h a v e : 1 -
o(A) = ( - 1 ( o r d e r
2), - 2 , - 3 }
2 - We c h o o s e a r b i t r a r i l y 3 -
: Kd = diag. (0.13, - 0 . 1 7 , - 0 . 1 )
o ( A + BKdC) = { - 0 . 0 1 , - 2 . 1 5 9 , - 2 . 1 , - 3 )
4 - T h e s e t of f i x e d m o d e s is g i v e n b y : Although our
example considers
c(A)
n
o (A + B K d C ) = { - B }
a s y s t e m of small d i m e n s i o n ,
this
algorithm
a p p l i e s e f f i c i e n t l y f o r l a r g e s c a l e s y s t e m s . For i n s t a n c e , i t w a s u s e d f o r a s h i p s t e a m generator,
w h i c h is a s y s t e m w i t h 119 s t a t e v a r i a b l e s a n d B c o n t r o l s t a t i o n s (DAV-
76a).
2 . 4 . 2 . - By calculation of the s y s t e m modes s e n s i t i v i t y (TAR-84) (TAR-85)
The
preceding
system which remain
paragraphs invariant
showed under
that
fixed
structurally
modes
are
constrained
the
modes
feedback,
of
the
indepen-
55 d e n t l y of t h e n u m e r i c a l of t h i s p r o p e r t y
values of the nonzero
to define
feedback
fixed modes in terms
gains.
of the
We c a n t a k e
concept
advantage
of eigenvalue
sensi-
tivity.
Definition 2 . 7
(TAR-84).
control whose
structure
d e f i n e d in ( 2 . 3 . 4 ) of s e n s i t i v i t y )
The is
fixed
modes of the
specified
by
the
set
are the modes of the closed-loop
with respect
to v a r i a t i o n s
on
the
system of
(2.3.1)
output
system nonzero
with respect
feedback
to a
matrices
which are insensible elements
of the
~* (void
feedback
matrix.
Consider
an arbitrary
problem of determining
the
real matrix variation
v a r i a t i o n dD o n t h e m a t r i x D . the quantities
d~r and
Faddeeva (FAD-63) dk
r
= w'
Where v r a n d
(D-
r
let us
by the
following
analyze
formula due
. v
of order
to F a d d e e v
. v
right
and
left eigenvectors
of D corresponding
:
(2.4.2)
= 0
(2.4.3)
= 1
r
From (2.4.1),
1, and
(2.~+.1)
r
the normalized
; i.e.
- XrI)
the
from a
~rI) v r = 0
W'r ( D
w'
and
kr o f D r e s u l t i n g
F o r t h e c a s e i n w h i c h Xr i s a n e i g e n v a l u e
dD a r e r e l a t e d
wr are
to Xr' r e s p e c t i v e l y
nxn
:
. dD
r
D of dimension
dkr of any eigenvalue
(2.4.4)
it c a n b e s h o w n
(MOR-66)
(ROS-65b)
that
:
Tr {Q (X r.).dD } d~'r=
Tr { Q ( ~ r ) }
(2.4.5)
w h e r e Q(~) i s t h e a d j o i n t m a t r i x o f ( X I - D ) Although
Morgan
formula (2.4.5), (ROS-65b) where
(MOG-66)
proposed
it m a y b e m o r e c o n v e n i e n t Q( ~r ) i s r e p l a c e d
: Q(p)
= adj (kI-D)
a n a l g o r i t h m to e v a l u a t e
dk r d i r e c t l y
to u s e t h e f o r m u l a g i v e n
by its explicit form (ROS-65a)
by
from
Rosenbrock
(GAN-79)
:
56 Tr {[
ir (D-X il)].dD} i(i#r)
(2,#,6)
d~.r= i(ilr)
Another with respect that
the
order
approach
(~ r-
consists
in
Xi)
determining
right
and
gradient
of
the
e i g e n v a l u e Xr
d.. o f t h e m a t r i x D . S i n c e L a n c a s t e r ( L A N - 6 4 ) s h o w e d 1l e i g e n v e c t o r s v r a n d w r a s s o c i a t e d w i t h a n e i g e n v a l u e Xr of
left
1 are continuous
dD ( ~
a t di.,j we d e r i v e
(2.4.2)
dv I) v r + (D-)trI) ~
dXr = d(dij)
B y m u l t i p l y i n g on t h e l e f t b y wr a n d u s i n g
dX
r 'd(dij)
= w' r
a n d we o b t a i n
:
= 0
(2.4.3)
and
(2.4.4)
we o b t a i n
:
dD v d(dij) r
In our particular system
the
to t h e e l e m e n t s
case,
the matrix
(2.4.7)
D is the
dynamic
closed-loop
matrix
: D = A + B K C = A + .E. b i k . . c . 1,] 1] ]
where
bi and
concerned only.
(2.4.7)
J
becomes
tJ
(2.4.8), w e
:
tJ
have
a D _ bi.c.
a kij
(2.4.8)
c. a r e t h e i t h c o l u m n o f B a n d t h e j t h r o w o f C , r e s p e c t i v e l y .
by the variation
8~ r : w' aD ak.. r ~ Vr
From
of the
j
:
o f Xr w i t h r e s p e c t
to v a r i a t i o n s
on the elements
We a r e kij o f K
57 a n d f i n a l l y , we o b t a i n
~X r ak..
:w'
:
(2.~.9)
bic. v I r
r
|J
If the
feedback
matrix
has
some fixed zero elements,
it i s c l e a r t h a t
equal to z e r o f o r k.. = 0. 1]
Definition (2.3.4)
2.8
(TAR-84).
and a feedback
Consider
a
control
structure
m a t r i x K C ~ *. T h e s e n s i t i v i t y
eigenvalue X of order
1 with respect
r
defined
the
is
set
~* i n
matrix of a closed-loop
matrix
to t h i s c o n t r o l i s g i v e n b y
by
~ r ~k.. II
•
SK r = ( s k i j ) i=l,...,m j=l .....
1 (2.4.10)
with
{~
'r
skij =
b i cj v r
Theorem 2.6 (TAR-84). ~*' kr
k. = 0 q
if
Given the system
(2.3.1)
i s a f i x e d m o d e if a n d o n l y if e i t h e r
and the set of feedback
matrices
of the two following equivalent
condi-
tions holds : 1 - the sensitivity 2 - Sr = W r { [ i ( i ~ r )
m a t r i x SK r d e f i n e d i n ( 2 . 4 . 1 0 )
(D-hi)
. dD}
is identically
zero (2.4.11)
= 0
w h e r e D--A+BKC, K E f~*, d D = B d K C a n d dK E: ~ * . This result
is straightforward
from Definition
(2.2.7)
and the relations
(2.4.6)
and (2.4.10).
Using Theorem
2.6,
the fixed modes of a system
poles) can be computed by the following algorithm
:
(not necessarily
with distinct
58 Al$orithm 2.2 (TAR-84).
1
Select
an
system modes
arbitrary
feedback
o(A+BKC)
matrix
K ~ ~*
such
that
the
closed-loop
are distinct.
2 - Compute the sensibility
matrix
SK r in ( 2 . 4 . 1 0 )
o r Sr in ( 2 . 4 . 1 1 )
for
~r ~ o ( A + B K C ) 3 - T h e f i x e d m o d e s a r e t h o s e f o r w h i c h SK r i s i d e n t i c a l l y Remark
2 . 4 : It i s b e t t e r
distinct poles. the
system
systems
Indeed,
has
to r e s t r i c t
the first
multiple
fixed
with multiple poles.
Example
2.7.
described
Consider
application
of Algorithm
step of this algorithm modes.
Obviously,
the
globally
this
controllable
2 to s y s t e m s
situation
is only possible
tI°0 tli
1° o
0
1
I
and
observable
2-station
0
I
0
0
I
l
i
to t h e d e c e n t r a l i z e d
control
:
K = diag.(k I, k 2) = d i a g . ( I , 5 ) The results
obtained
by applying
Algorithm 2 are the following :
Closed-loop
S SK
eigenvalue
-2
: ~,
I
r
:
-o.7645 0
-
1.088
0
--o.49 10-15 o
~Xr ;)K
r
for dK=K
0
1
-29.9999
- @1529
o 0.2177
for
subsequently.
•
1
with
m a y n o t h a v e a s o l u t i o n when
T h i s c a s e will b e d i s c u s s e d
by the following triple
submitted
the
z e r o o r Sr i s z e r o .
I
J
o - %32 10 -17
19.9999
I
J
0.666 10 - 1 4
system
59
T h e r e f o r e Xr = 1 is a f i x e d mode with an a c c u r a c y ) 10 -14. This a l g o r i t h m h a s b e e n u s e d f o r a s h i p s t e a m g e n e r a t o r model in ( T A R - 8 5 ) . The p r e c e d i n g a n a l y s i s is r e s t r i c t e d to simple f i x e d modes a n d t h e a p p r o a c h is specially a d e q u a t e for s y s t e m s w i t h simple m o d e s , w h i c h g u a r a n t e e t h a t t h e f i r s t s t e p of the algorithm c a n b e a c h i e v e d . The g e n e r a l i z a t i o n of t h i s a p p r o a c h to s y s t e m s w i t h multiple modes is n o t e a s y (TAR-85). I n d e e d , if Xr i s a multiple e i g e n v a l u e of o r d e r q o f a real m a t r i x D, i t s variations r e s u l t i n g from v a r i a t i o n s of t h e e l e m e n t s di] of D a r e g i v e n b y t h e s o l u tions of the following a l g e b r a i c e q u a t i o n of o r d e r q (PAR-74) :
q I [d k-I QCk)] X 1_ q~ {d q-I [Tr Q ( k ) ] A =X r } . d X r : Tr {k :E--~-, l
r
(2.4,12)
.dD}
with Q (~) = adj (XI-D). G e n e r a l l y , a multiple e i g e n v a l u e ~ r of o r d e r q g i v e s r i s e , a f t e r t h e p e r t u r b a tion dD,
to
(d~r)i, (i=l
q
. . . . .
simple e i g e n v a l u e s : Xr+
(d~r) 1 .
. . . .
kr+(dkr) i . . . . . ~ r + ( d ~ r ) q ,
where
q ) , a r e t h e s o l u t i o n s of e q u a t i o n ( 2 . 4 . 1 2 ) . From Definition ( 2 . 2 . 7 ) ,
~r is a f i x e d mode o f o r d e r q if ( d k r ) i = 0,
(i=l . . . . . q ) .
So,
from
(2.4.12),
the
following c o n d i t i o n m u s t h o l d :
q 1 s r = Tr { r ~ k=l
[dk-I
Q(X)] X= Xr
.dD}
=0
(2.4./3)
Remark 2.5. A s p e c i a l c a s e may o c c u r f o r w h i c h n o t all t h e v a r i a t i o n s ( d k r ) i , are zero b u t o n l y some of t h e m ,
s a y q' ( q .
Though
condition
(i=l . . . . . q ) ,
(2.4.13)
does not
hold, ~r is a f i x e d mode o f o r d e r q~. Since D=A+BKC, t h i s means t h a t a n o t h e r matrix K ~ ~* can be f o u n d w h e r e b y ~ is an e i g e n v a l u e of o r d e r q ' o f D. In t h i s situationp all the v a r i a t i o n s ( d ~ r ) i ,
(i=1 . . . . q ' ) , a r e z e r o a n d we a r e b r o u g h t b a c k t o t h e e a s e
for which c o n d i t i o n ( 2 . 4 . 1 3 ) h o l d s . The e v a l u a t i o n of S r r e q u i r e s t h e analytical calculation of t h e ad]oint m a t r i x of (~I-D) and of i t s v a r i a t i o n s from t h e o r d e r 1 to ( q - l ) ,
in o u r c a s e r e s u l t i n g from
6O t h e v a r i a t i o n s of t h e e l e m e n t s k.. of t h e f e e d b a c k m a t r i x K. 1] very heavy task.
Obviously,
t h i s is a
Like in t h e case o f simple f i x e d m o d e s t a n o t h e r a p p r o a c h c o n s i s t s in evaluating the
g r a d i e n t s o f kr w i t h r e s p e c t
to t h e
e l e m e n t s kij o f K. We can t h u s
u s e the
following t h e o r e m due to L a n c a s t e r (LAN-64). Theorem 2.7
(LAN-64).
Given ~r a multiple e i g e n v a l u e of o r d e r q of a real matrix
D(R) p w h e r e R is a p a r a m e t e r p c o n s i d e r t h a t t h e r i g h t a n d l e f t e i g e n v e c t o r matrices Vq a n d Wq a r e c h o s e n s u c h t h a t WWqQq=I, T h e n ,
t h e q d e r i v a t i v e s o f ~ r with r e s -
p e c t to R a r e t h e e i g e n v a l u e s of t h e matrix W d D / d R V . (For t h e c o n d i t i o n s of q q e x i s t e n c e of Wq a n d Vq, t h e r e a d e r i s r e f e r e d to ( L A N - 6 4 ) ) . In o u r
case,
D=A+BKC a n d t h e p a r a m e t e r
R must be taken
s u c c e s s i v e l y as
e a c h e l e m e n t k.. o f K. M o r e o v e r , as we h a v e a l r e a d y s e e n : 1]
~D a kij
(A ÷ )~ bikijcj) i,j a kij
:
= bic.= 0 }
a n d we h a v e t h e following r e s u l t : Theorem 2.8 ( T A R - 8 5 ) . Given t h e s y s t e m ( 2 . 3 , 1 ) a n d t h e s e t of f e e d b a c k m a t r i c e s ~*'.;~r is a f i x e d mode of o r d e r q if a n d only if all t h e e i g e n v a l u e s of e v e r y matrix WqbXCjVq,
(i,j
s u c h t h a t ki..j ~ 0 ) ,
are
e i g e n v e c t o r m a t r i c e s c o r r e s p o n d i n g to k
zero.
W'q
and
Vq a r e t h e l e f t a n d right
c h o s e n s u c h t h a t W' V = I. r q q
Note t h a t t h e a b o v e t h e o r e m is not e a s y to u s e , e i t h e r .
This r e q u i r e s ,
first,
t h e d e t e r m i n a t i o n o£ t h e e i g e n v e c t o r m a t r i c e s W a n d V a n d , t h e n , t h e computation q q of t h e e i g e n v a l u e s of ~ m a t r i c e s of dimension q x q ( w h e r e U is t h e n u m b e r of nonzero e l e m e n t s in t h e
feedback matrices
K ~ ~*).
The
c o n c l u s i o n is t h a t
the
approach
b a s e d on t h e s e n s i t i v i t y p r o p e r t i e s of e i g e n v a l u e s is n o t s u i t a b l e to d e t e r m i n e multipie f i x e d m o d e s .
2.4.3
-
Concluding
remarks
T h e two p r e c e d i n g a l g o r i t h m s a r e easily i m p l e m e n t e d . It is i n t e r e s t i n g to note t h a t t h e y can also be u s e d to c o m p u t e t h e u n c o n t r o l l a b l e a n d u n o b s e r v a b l e modes of a system by replacing the set
~* b y R m x r . T h e only p r o b l e m , w h i c h may i n d u c e a
61
difficult i n t e r p r e t a t i o n of t h e r e s u l t s , gorlthm, one h a s equal a n d ,
in t h e s e c o n d a l g o r i t h m ,
computer z e r o .
is t h e c o m p u t e r a c c u r a c y .
For t h e
first al-
to d e c i d e in w h i c h limits two e i g e n v a l u e s can b e c o n s i d e r e d as
However,
t h e p r o b l e m is to d e c i d e t h e a c c u r a c y of t h e
Davison e t a l .
(DAV-78b)
showed that
if a c l o s e d - l o o p
eigenvalue is ' v e r y close' to an o p e n - l o o p e i g e n v a l u e , t h e t r a n s f e r m a t r i x c o m p u t e d when c o n s i d e r i n g t h i s e i g e n v a l u e as a f i x e d mode is a good a p p r o x i m a t i o n of t h e t r a n s f e r m a t r i x of t h e s y s t e m .
2.5.
-
CONCLUSION This c h a p t e r d e a l s with t h e p r o b l e m of s t a b i l i z a t i o n a n d pole a s s i g n m e n t w h e n
a specified r e s t r i c t e d i n f o r m a t i o n p a t t e r n is r e q u i r e d , w h i c h c o n s t r a i n t s t h e f e e d b a c k control s t r u c t u r e . The
ap-
p r o a c h e s of Wang a n d Davison (WAN-73b) a n d of Corfmat and Morse (COR-76)
The c a s e o f a d e c e n t r a l i z e d s c h e m e of c o n t r o l is p r e s e n t e d
are
both c o n s i d e r e d .
the
Their
results
give,
in
different
terms,
the
first.
conditions
for
existence of a s o l u t i o n to t h e a b o v e p r o b l e m . The e q u i v a l e n c e o f t h e s e r e s u l t s will b e d i s c u s s e d in t h e n e x t c h a p t e r a n d we will s e e how t h e r e s u l t s of Corfmat a n d Morse can be e x p r e s s e d in t e r m s of t h e c o n c e p t of f i x e d modes i n t r o d u c e d b y Wang a n d Davison. It will also b e p o i n t e d o u t how t h e s e r e s u l t s a r e r e l a t e d to t h e c o n c e p t of controllability u n d e r d e c e n t r a l i z e d i n f o r m a t i o n s t r u c t u r e . The c a s e o f a r b i t r a r y s t r u c t u r a l c o n s t r a i n t s on t h e c o n t r o l is t h e n c o n s i d e r e d and t h e c o n c e p t of f i x e d modes is e x t e n d e d to t h i s g e n e r a l f r a m e w o r k . Finally, two a l g o r i t h m s f o r t h e e v a l u a t i o n of f i x e d modes a r e p r e s e n t e d . This c h a p t e r p o i n t s out t h e
f u n d a m e n t a l i m p o r t a n c e of f i x e d m o d e s .
Indeed,
the e x i s t e n c e of u n s t a b l e f i x e d modes i n d i c a t e s t h a t s t a b i l i z a t i o n is i m p o s s i b l e , while the p r e s e n c e of a n y k i n d of f i x e d modes r u l e s out a r b i t r a r y pole p l a c e m e n t .
Fixed
modes a p p e a r t h u s as a g e n e r a l i z a t i o n of u n c o n t r o l l a b l e a n d u n o b s e r v a b l e modes in the case of n o n - c o n s t r a i n e d c o n t r o l
(centralized control).
i n t e r e s t e d in t h i s p r o b l e m ( f o r a s u r v e y , different characterizations chapter.
of
fixed
see (TRA-84a))
modes,
which
will be
Many a u t h o r s
have been
and their r e s u l t s provide presented
in
the
next
The a n a l y s i s of t h e s e c h a r a c t e r i z a t i o n s , b o t h in t h e time a n d in t h e f r e -
quency domain,
will allow u s
to p o i n t out
the
situations
that
give r i s e
modes, and to g i v e an i n t e r p r e t a t i o n of f i x e d modes r e l a t e d to t h e i r o r i g i n .
to f i x e d
CHAPTER
CHARACTERIZATION
3
OF
FIXED MODES
3. I. - I N T R O D U C T I O N
The last fixed modes.
chapter Indeed,
pointed
out
the
fundamental importance
t h e e x i s t e n c e of a s o l u t i o n
for the
p l a c e m e n t p r o b l e m of a l i n e a r i n v a r i a n t s y s t e m r e q u i r i n g
of t h e
c o n c e p t of
stabilization or
some s t r u c t u r a l
t h e pole
constraints
on t h e c o n t r o l d e p e n d s c r i t i c a l l y on t h e p r o p e r t i e s of t h i s f i n i t e s e t of n u m b e r s . p r e s e n c e of u n s t a b l e f i x e d m o d e s i n d i c a t e s t h a t
The
s t a b i l i z a t i o n i s i m p o s s i b l e while the
p r e s e n c e of a n y s o r t of f i x e d m o d e s r u l e s o u t a r b i t r a r i l y pole p l a c e m e n t , The
first
important
problem
u n d e r some p r c s p e c i f i e d s t r u c t u r a l
of e v a l u a t i n g
fixed
modes
for
a
given
system
c o n s t r a i n t s on t h e c o n t r o l h a s b e e n t r e a t e d in the
l a s t c h a p t e r a n d two e f f i c i e n t a l g o r i t h m s h a v e b e e n p r e s e n t e d .
Our
present
o b j e c t i v e is to o b t a i n some i n s i g h t i n t o t h e b e h a v i o u r of t h e fixed
m o d e s . For t h i s p u r p o s e ,
t h e p r e s e n t c h a p t e r d e a l s w i t h t h e c h a r a c t e r i z a t i o n of fixed
m o d e s a n d a t t e m p t s to p r o v i d e an u n d e r s t a n d i n g of t h e i r o c c u r e n c e .
We will s u c c e s s i v e l y c o n s i d e r t h e c h a r a c t e r i z a t i o n s of f i x e d m o d e s w i t h a time ° domain a n d
a frequency-domain representation
t h e c o m p a r i s o n of t h e d i f f e r e n t
of t h e
characterizations,
the
system.
From t h e
reasons
of t h e
study
and
o c c u r e n c e of
f i x e d m o d e s a n d t h e c o n d i t i o n s f o r t h e i r e x i s t e n c e will b e p o i n t e d o u t . It will a p p e a r t h a t f i x e d m o d e s m a y o r i g i n a t e f r o m two d i s t i n c t s o u r c e s
: they may have a structu-
ral or
a c l e a r c l a s s i f i c a t i o n of the
a parametric origin.
different types
We will a t t e m p t to p r o v i d e
of fixed modes and
a whole p a r a g r a p h
will deal w i t h
the
specific
c h a r a c t e r i z a t i o n s of f i x e d m o d e s a r i s i n g from s t r u c t u r a l p a r t i c u l a r i t i e s .
The last paragraph
of t h i s
t e r i z a t i o n s of f i x e d m o d e s . I n d e e d ,
chapter
i s an o v e r v i e w of t h e
g r a p h s p r o v i d i n g a n e f f i c i e n t w a y to e x p l o r e v a r i o u s s t r u c t u r a l t h e c o n c e p t s of g r a p h - t h e o r y .
graphical charac-
dynamic s y s t e m s can be r e p r e s e n t e d
by directed
properties by using
N u m e r o u s r e s u l t s h a v e b e e n o b t a i n e d for t h e problem
of c h a r a c t e r i z i n g f i x e d m o d e s in t h i s g r a p h - t h e o r e t i c f r a m e w o r k .
63 3.2. - CHARACTERIZATION IN TERMS OF TRANSMISSION ZEROS This c h a r a c t e r i z a t i o n g i v e s an i n t e r e s t i n g i n s i g h t into t h e r e a s o n s of o c c u r e n c e of fixed modes a n d p r o v i d e s a simple e x p l a n a t i o n f o r t h e i r e x i s t e n c e in t e r m s of t h e familiar c o n c e p t o f s y s t e m p o l e s a n d z e r o s . I t was p r o v i d e d i n d e p e n d e n t l y b y s e v e r a l authors (HUJ-84)
(TAO-84)
and f o r m u l a t e d u s i n g
(DAV-85)
(SER-82)
different methods.
(VID-83) w h o s e r e s u l t s a r e p r o v e d
This c h a r a c t e r i z a t i o n can e q u i v a l e n t l y b e
i n t e r p r e t e d a n d u s e d e i t h e r in t h e f r e q u e n c y - d o m a i n c o n t e x t o r in t h e t i m e - d o m a i n context s i n c e
transmission
zeros are
a c o n c e p t as
well d e f i n e d b y
m e a n s of t h e
system m a t r i x as b y means of t h e t r a n s f e r f u n c t i o n matrix (see A p p e n d i x 1). A l t h o u g h t h e r e s u l t s a r e d e v e l o p p e d in a t i m e - d o m a i n f r a m e w o r k in (DAV-85a) and in a f r e q u e n c y - d o m a i n f r a m e w o r k in
(SER-82)
(VID-83), t h e i r e q u i v a l e n c e a p -
p e a r s c l e a r l y in (HUJ-84) a n d ( T A O - 8 4 ) . In all t h e p a p e r s b u t expression relating
the
(DAV-85),
t h i s c h a r a c t e r i z a t i o n is o b t a i n e d
c l o s e d - l o o p c h a r a c t e r i s t i c polynomial to t h e
using
an
controller pa-
rameters a n d z e r o polynomials of c e r t a i n c o n s t i t u a n t s u b s y s t e m s . C o n s i d e r t h e c l a s s of l i n e a r t i m e - i n v a r i a n t s y s t e m s d e s c r i b e d b y t h e following state=space r e p r e s e n t a t i o n :
{
~:(t) = A x ( t ) + B u ( t ) y(t)
(3.2.1)
C x(t)
where x ( t ) ~ Rn ,
u ( t ) ~ R m, y ( t ) ~ R r a r e t h e s t a t e , i n p u t a n d o u t p u t ,
respecti-
vely and A, B, C a r e real m a t r i c e s of a p p r o p r i a t e d i m e n s i o n s . Many l a r g e scale s y s t e m s a p p e a r to b e g e o g r a p h i c a l l y d i s t r i b u t e d or composed of an i n t e r c o n n e c t i o n of s u b s y s t e m s . T h e s e c h a r a c t e r i s t i c s can be t a k e n i n t o a c c o u n t in the model o f t h e s y s t e m b y a p a r t i t i o n i n g of t h e i n p u t a n d o u t p u t v e c t o r s r e s u l ting in s e v e r a l c o n t r o l a n d o b s e r v a t i o n s t a t i o n s :
{
~(t) : A x ( t ) +
S £ g i ui(t) i=l
Yi(t) = C i x(t)
(3.2,2) ( i=l,...,S )
which is r e l a t e d to ( 3 . 2 . 1 ) b y :
B = (B 1 ..... B S) C'= (C' 1 .... ,C' S)
64
u'(t)
= (U'l(t) ..... U's(t))
y'(t)
= (y'l(t) ..... y's(t))
w i t h u i ( t ) ~ Rmi, Yi(t) E R r i , S m = i Zl_
and
(i=1 . . . . .
S r = i Zl_
mi ,
S),
r i, w h e r e S is t h e n u m b e r
of control and observation
stations. In order traints
to p o i n t o u t t h e p r o b l e m s
on t h e c o n t r o l ,
arising
s p e c i a l l y from t h e s t r u c t u r a l
we make t h e a s s u m p t i o n
that
system
(3.2.1)
cons-
(3.2.2)
is g l o -
bally controllable and observable. The
following
development
is
taken
from
(TAO-84)
in
which
the
chosen
n o t a t i o n s c a n b e s i m p l y m a n i p u l a t e d a n d do n o t l e a d to h u g e f o r m u l a . Consider by
the
system
(3.2.1)
for which the transfer
function matrix
is g i v e n
:
= C
W(p)
(pI-A) -I B =
where N(p)=C adj(pI-A) is t h e c h a r a c t e r i s t i c The called
set
function
matrix
subscripts
q,s
(3.2.3)
B is t h e r x m n u m e r a t o r
polynomial of the system
of i-input
i-dimensional
N(p) ~(p)
i-output
subsystems
subsystems
and
denoted
transfer
function matrix and
@ (p)
(3.2.1). of by
(3.2.1), (Cq,A,B s)
(i=l . . . . . r a i n ( r e , r ) ) , or
by
their
are
transfer
Wi ( p ) = C i ( p I - A ) - l B i = W . i ( p ) , where for notation convenience the q,s q s j h a v e b e e n r e p l a c e d b y j." C lq, ( q = l , . . . , q c ) , are the set of submatrices
f o r m e d from i r o w s o f t h e m a t r i x C a n d Bis, ( s = l , . . . . S b ) , a r e t h e s e t o f s u b m a t r i c e s f o r m e d from i c o l u m n s o f t h e m a t r i x B, w h e r e
r'
qc : ( r - i )
m:
:i:
Sb - (m-i) 'i'
Wlj(p), (j--1 . . . . . ji ) , a r e t h e s e t o f i x i s u b m a t r i c e s o f W(p) a n d j i = q c . Sb . As
was
independent
pointed of the
out
dynamic
in
Chapter or
static
2,
we k n o w
nature
of the
that
the
s e t o f f i x e d m o d e s is
controller.
Therefore,
we will
c o n s i d e r a s t a t i c c o n t r o l law o f t h e f o r m "-
u = K y + v
(3.2.4)
65
where v is the mxl external any a r b i t a r y
input
The closed-loop characteristic
*c(p) where
[ "l
vector
and the
constant
mxr matrix
K can take
structure. p o l y n o m i a l is t h u s o b t a i n e d a s :
(3.2.5)
*(p) stands
for det (.).
The determinant
in
(3.2.5)
+
Z
can be expanded
in terms of the principal
minors
of ( - W ( p ) K) to g i v e :
•c(p) where hi(p)
= ~
(p) (1
is t h e
Cauchy formula
r
i=l
hi(p))
(3.2.6)
sum of principal
(GAN-79),
these
ith order
minors
minors can be written
of
(-W(p)
K),
From
Binet-
in t e r m s o f d e t e r m i n a n t s
of
s u b m a t r i c e s o f W(p) a n d K t a s : Ji
hi(p) = j : [
This r e s u l t
can equivalently
b e s t a t e d in a t i m e - d o m a i n f r a m e w o r k .
tion of t h e z e r o p o l y n o m i a l o f a s y s t e m i-dimensional subsystems
is g i v e n b y
From the defini-
(KWA-72), the set of zero polynomials of the
:
B si
I PI-A
q
where the roots of Z((p) are the set of transmission
zeros of the i-dimensional sub-
systems. From ( 3 . Z . 6 ) , - Frequency
c(P)
(3.2.7)
and
(3.2.8),
t h e two f o l l o w i n g r e s u l t s
are equivalent
:
domain :
(p) +
r
Ji
z
z
i=lj=l
(-l)ilKjl } ~(p)lWi(p)l J
(3.2.9)
66
- Time domain ;
r
¢c(p)=
Ji
qb(p)+ r. Z (-I) i [K';I ZI(p)
(3.2. l O)
i:l j:l
When i rows a n d i columns have b e e n selected in K' to form K]wi,Cqi and Bis denote the submatrices of C and B obtained by selecting the same rows and columns. The
subsystem
of (C,A,B)
or W(p)
corresponding
to the submatrix
K'~ is thus
denoted b y (Cq, i A,Bis) or e q u i v a l e n t l y Wi(p). Now, c o n s i d e r that the controller (3.2.4) is c o n s t r a i n e d to have the following decentralized s t r u c t u r e :
(3.2.11)
K = b l o c k - d i a g . ( K 1 . . . . . KS) where K. ~
Rmixri, (i=1 . . . . . S).
1
The fixed modes are easily c h a r a c t e r i z e d u s i n g the above development.
3 . 2 . 1 . - T a r o c k ' s r e s u l t s (TAO-84) Theorem 3.1.
The n e c e s s a r y a n d sufficient condition for a pole ~0 of t h e system
( C , A , B ) or W(p) to be a fixed mode with r e s p e c t to the controller K in (3.2.11) is that : [~,0 i- A
BSi ]
.
rank
LC'q
<
n+i ,
(i=l,...,min(rn,r))
(3.2.12)
0
or equivalently :
~(~o )
,J wj(~o)J--, 0 ,
(i=1 . . . . . rain (re,r))
(3.2.13)
67 where (Cio,A,B s) or We(p) are the subsystems of (C,A,B) corresponding to non-singular submatrices of K I. The above
theorem
states
t h a t )~0 is a f i x e d
m o d e of
respect to K in (3.2.11) if and only if all. the subsystems responding to non-singular submatrices K~1
(C,A,B)
or
W(p)
with
(Cq,A,B s) or W~(p) cor-
of K ~ have a common
transmission zero
corresponding to the system pole ~0" This result is straightforward from formulae (3.2.9) or (3.2.10).
3.2.2. - H u and Jiang results (HUJ-84) Hu a n d J i a n g
state
their
results
using
some p r e l i m i n a r y
definitions
presented
below. From the integers m i and ri specifying the controller structure in (3,2.11), define : i
m 0 = 0,
~i = j-_~0 mj~,
r 0 = 0,
i Fi = jZ= 0
such that the input
U
=
(i=l . . . . . rj ,
and output
!m
--
m = ~S
Ii] -'-"
r = ~S vectors
U
i
are partitioned
in t h e following w a y :
u~i_l+l =
,, ,,
u~ i YYi] 1 1 y =
y = r
Let n o n n e g a t i v e
integers
i_~is
1
s i a n d qi" ( i = l , . . . . S), s a t i s f y
S
0-~s i . < ~ i ,
S)
S
0
, 0,
i_E1 q~ 0
a n d j for s i ) 0 a n d qi ) O, d e f i n e t h e p o s i t i v e i n t e g e r s
:
the condition
:
68 f i ) j ' (j=l . . . . . s i)
(3.2.14)
gi,j) (j=l . . . . . qi ) "~i-1 +1 "~ fi,1 < "'" < f i , s i
x< ~ i
~i-1 +1 ~ gi,1 < "'" < g i , q i
~ Ti
The following set of s u b s y s t e m s of (C,A)B) or W(p) is now defined : (~,A,~)
(3.Z.l~)
W(p) = : ( p i - A ) - l ~
or
~i : [hfi,l ..... bf~,~i ] ")i
L~SJ
gi,q i
with :
=~=
--i tl
[i]
I!,1 =
Luf u fi,si
-1
I
Yg,i,l
-yi =
=
Ygi,qi
and = b l ° c k - d i a g ' ( ~ l . . . . ' ~ S )) Note that when s.=0, ~ i 1
~i
~i
~
Rsixqi'
(i=l . . . . . S)
d i s a p p e a r and when qi=0, ~ i
(3.2.16) ~i d i s a p p e a r . In
both c a s e s , Ki d i s a p p e a r s .
Definition 3.1. The s u b s y s t e m s ( C , A , B ) or W(p) in (3.2.15) a s s o c i a t e d with the controller ~ in (3.2.16) are called the normal s u b s y s t e m s of ( C , A , B ) or W(p). In p a r t i c u l a r ) when si=qi) t h e y a r e called the n o n s i n g u l a r l y normal s u b s y s t e m s .
69 The set of normal subsystems is denoted by N.sub.(C,A,B)
and the set of
nonsingularly normal subsystems by N.N.sub. (C,A,B). With t h e s e d e f i n i t i o n s , Hu a n d J i a n g s t a t e t h e following r e s u l t s : Theorem 3.2. ~0 i s a f i x e d mode of ( C , A , B )
with r e s p e c t to K i n ( 3 . 2 . 1 1 )
if ~0 is a f i x e d mode of all t h e n o r m a l s u b s y s t e m s
(C,A,B)
if a n d o n l y
with r e s p e c t
to ~ i n
(3.2.16) ; i.e. :
A(C,A,B,K) Theorem 3 . 3 .
(U,A,~) ~
The necessary
D
N.sub.(C,A,B)
h (~,A,B,K)
a n d s u f f i c i e n t c o n d i t i o n f o r a pole ~0 of t h e
system
( C , A , B ) or W(p) to b e a f i x e d mode with r e s p e c t to K i n ( 3 . 2 . 1 1 ) is t h a t •
rank
I°:
< n +
0.2.is)
1 si
0
or e q u i v a l e n t l y • d~(~0)
det ~
(X0) = 0
(3.2.19)
for all t h e n o n s i n g u l a r l y n o r m a l s u b s y s t e m s of ( C , A , B )
or W ( p ) .
T h i s t h e o r e m s t a t e s t h a t 10 i s a f i x e d mode of ( C , A , B )
o r W(p) i f a n d o n l y i f
~0 is a common t r a n s m i s s i o n z e r o of all t h e n o n s i n g u l a r l y n o r m a l s u b s y s t e m s
('C,A,~}
or ~ ( p ) w h i c h c o r r e s p o n d s with a pole of t h e s y s t e m . T h e s i m i l a r i t y of t h i s r e s u l t w i t h t h e o n e of T a r o c k is o b v i o u s . I n d e e d , it is 5 clear t h a t ( C , A , B ) or ~ ( p ) of d i m e n s i o n Z s. c o r r e s p o n d to t h e s u b s y s t e m s i=! 1 ( Ci , A ) ,B n o o r W~(p)j of d i m e n s i o n i while t h e m a t r i c e s Ki in (3.2o16) w i t h 8i=cli correspond
to
the
non
singular
matrices
t h e r e f o r e i d e n t i c a l to formula ( 3 . 2 . 1 2 ) equivalent.
and
K!. Formula ( 3 . 2 . 1 7 ) a n d ( 3 . 2 . 1 8 ) a r e l ( 3 . 2 . 1 3 ) a n d T h e o r e m s 3.3 a n d 3.1 a r e
T h e a d v a n t a g e of Hu a n d J i a n g f o r m u l a t i o n is t h a t t h e s u b s y s t e m s to b e
c o n s i d e r e d a r e s y s t e m a t i c a l l y d e f i n e d b y t h e s e t of i n t e g e r s in ( 3 . 2 . 1 4 } . T h e same r e s u l t was also p r o v i d e d p r e v i o u s l y b y S e r a j i ( S E a - 8 2 ) a n d V i d y a s a gar
a n d Wiswanadham (VID-83) i n a f r e q u e n c y - d o m a i n c o n t e x t .
b u t i o n s of t h e s e
papers
Though the contri-
p r o v i d e t h e same a b o v e e s t a b l i s h e d r e s u l t u s i n g t h e same
e x p a n s i o n of t h e c l o s e d - l o o p c h a r a c t e r i s t i c polynomial g i v e n i n ( 3 . 2 . 9 ) they differ by the notations and the formulations which are used.
and (3.2.10),
70 Their results concepts
are briefly presented
are pointed
in the two next paragraphs.
out and the originalities
The equivalent
which can be advantageously
exploited
are shown.
3.2.3.
- Vidyasagar
and Wiswanadham results
The main result polynomial,
whose
of t h i s p a p e r
zeros are the
the control structure
is presented
as a characterization
f i x e d m o d e s of t h e
system
(3.2.1)
of t h e f i x e d
with respect
to
specified by K in (3.2o11)o
D e f i n e t h e s e t s M= {1 . . . . . m} of elements
(VID-83)
of the
set
(*).
a n d R={1 . . . . , r )
If I = J,
then
and denote by
W[I3] d e n o t e s
*
the number
the minor of W(p)formed
,rom ,ho
'n
way and Z
=
(p) W 3 "
Theorem
3.4.
The
fixed
(3.2.11)
is g i v e n b y
polynomial
F(p)
of s y s t e m
(3.2.1)
with respect
to
K in
:
F(p) = g.c,d
(p) ,
Z
~2
S
L3ilU Ji2 u
u
(3.2.19)
is_]
with : Iij c Rj = {'~]-1 + 1 . . . . . ~]} Jijc
(i=l . . . . .
Mj = { ~ j - 1 + 1 . . . . . ~ j }
and [l~ijl} --]lJijl
,
It is obvious Jiang stated
that
in T h e o r e m s
I I i l u Ii2 u . . .
S)
(3.2.20)
(j=~ . . . . . s ) .
this
result
is equivalent
3.1 and 3.3.
to those
of Tarock
and
Hu a n d
Indeed,
u Iis 1
Z
! / L J i l u 3i2 u . . . v J i s J is a polynomial whose roots
_S [[ Iij[[ c ° r r e s p ° n d i n g j-~l to some 5 ( p )
z e r o s of some s u b s y s t e m
of dimensiol
to some nonsingular m a t r i x K [ I ] . T h i s p o l y n o m i a l c o r r e s p o n d s 3 notations.
in Tarockts
The subsystems Jiang result
are the transmission
to b e c o n s i d e r e d
b y t h e s e t s of i n t e g e r s
are
Jil a n d
specified Ill in
J
sets of integers
{fi,1 . . . . .
fi,s[ }
and
(gi,1 .....
i n a s i m i l a r w a y a s i n Hu a n
(3.2.20)
which correspond
J
gi,q~
in (3.2.14),
respectively.
to t h e
71 Note t h a t
this
work appeared
one year
before
the
two other
ones
in the lite-
rature.
3.2.4.
- Seraji's results This
result
main r e s u l t to b e
is even
is given
considered
The result
very
back
controller
that the controller
a
to t h e o n e o f V i d y a s a g a r
easily
controllers
determinated.
the general is treated
is brough
can thus
Consider
anterior
for diagonal scalar
is
o r i g i n a l i t y to b r i n g decentralized
(SER-82)
Then,
applying
into a diagonal scalar
whose
structure
is
Wiswanadham.
The
set of subsystems
approach
presents
situation.
a transformation
be applied on the transformed
controller
the
case to this particular
by
back
and
for which the
Any arbitrary
on the
structure
the
system
such
in the new basis.
system. specified
by
the
output
feedback
matrix in the following way :
Ks = block-diag.(k
1.....
k S)
ki ~ R
Seraji gives the following result Theorem
3.5.
system (3.2.1) subsystems
The
necessary
with respect
of dimension
and
(3.2.21)
(equivalent
sufficient
to K s i s t h a t
to the three
condition
anterior
f o r ~0 to b e
:
a fixed
X0 i s a c o m m o n t r a n s m i s s i o n
( i = l , . . . . S) f o r m e d s e l e c t i n g
ones)
the same inputs
mode of
z e r o o f all t h e and outputs
of
the system. Now,
if the
controller
r i ~ 1, S e r a j i a p p l i e s
used for the transformed Consider
K
structure
a transformation
by
K as in such
(3.2.11)
that
where
Theorem
m i ~, 1,
3.5 can he
system,
the transformation
=PK
is given
on the system
matrix P :
s
(3.2.22)
W(p) = Wt(p) P P = K diag.
1
l
{F- .... ' k--} "l S
The fixed modes of the system fixed modes of system Theorem 3.5.
Wt(p)
W(p)
with respect
with respect
to K a r e
then
given
to Ks , which can be determined
by
the
by using
72 Despite
of the
termination,
originality
from the original
z e r o s h a v e to b e c h e c k e d
3.2.5.
-
system,
Wang
by
approach,
is
of the subsystems
clear
that
the
direct
de-
for which the transmission
(DAV-85)
the same characterization using
it
s e e m s to b e m o r e c o n v e n i e n t .
Davison and Wang results
Recently, and
of this
a more
direct
of fixed modes was established
method.
Their
result
is
by
Davison
straightforward
to t h e
application of a lemma taken from (AND-82).
Lemma 3.1
(AND-82).
G i v e n M0 ~
e R n , a n d l e t qi b e a r e a l s c a l a r
Rnxn,
d e t M0 ~ 0, l e t Mi = b i e'.x
where
b i, c i
all d i s j o i n t v a l u e s
o f i 1,
; then
S
d e t (M 0 + i~l qi Mi) = 0
~tqi~: R, ( i : l , . . . , s )
if a n d o n l y if t h e f o l l o w i n g c o n d i t i o n s
det
M0
bi I
bi 2
• . .
bit
c!
0
0
...
0
0
0
. . .
0
0
0
...
0
t!
c!
are satisfied
:
= 0
• [2
c~ L tt
(i 1 = 1 , . . . , s )
;
(i 2 = 1 . . . . s )
;
...
;
(i t = 1 . . . . .
s)
for
i 2 . . . . ,i t ; ( t = l , . . . , s ) . Now, t h e s y s t e m
{ and
(3.2.1)
can be rewritten
~(t)
= A x(t)
y(t)
= (Cl,C 2 ..... Cr)' x(t)
the
controller
matrix K in
+ (bl,b 2 .....
information
b m) u ( t )
flow c o n s t r a i n t
(3.2.11) c a n b e r e p r e s e t e n d
{(il,Jl),
(i2,J2) .....
as :
(is,is) }
represented
by
the
output
by the following pairs of integers
feedback :
(3.2.33)
73 where i k 6 {1 . . . . . m } , jk ~ { 1 . . . . . r ) s e n t s a n o n z e r o e l e m e n t i n K. T h e f i x e d modes of ( 3 . 2 . 1 ) the p r o p e r t i e s ~0 ~
o
, ( k = l . . . . . s)
: i.e.,
each pair (ik,Jk) repre-
with r e s p e c t to K i n ( 3 . 2 . 1 1 )
(3.2,23)
have thus
: (A)
(3.2.24) S
det {A- XoI ÷ k__£1qk bi k Cik }
=0
V q k ~ R , (k=l . . . . . s)
a n d from Lemma 3.1, t h e following r e s u l t is s t r a i g h t f o r w a r d : Theorem 3.6 ( D A V - 8 5 ) . T h e n e c e s s a r y a n d s u f f i c i e n t c o n d i t i o n for XOE fixed mode of t h e s y s t e m ( 3 . 2 . 1 ) with r e s p e c t to K in ( 3 . 2 . 1 1 ) a t r a n s m i s s i o n z e r o of all of t h e following s u b s y s t e m s
(3.2.23)
o
(A) to b e a is t h a t k 0 is
:
Ik1 (
lk2 Lc, ,
, A , (b i
, bi kl
..... k2
bi
)
(3.2.25)
kt
]k t where ( k t = l , 2 , . . . , s + l - t ) )
( k 2 = k l + l , k l + 2 . . . . . s+Z-t) ; ( k t = k t _ l + l , k t _ l + 2 . . . . , s )
( t = l , 2 . . . . . rain ( m ) r ) ) I t is c l e a r t h a t
: for
(3.2.26) the above result
is e q u i v a l e n t
to t h o s e
stated
before.
The
o r i g i n a l i t y of t h i s a p p r o a c h s t a n d s on t h e f a c t t h a t it a r i s e s d i r e c t l y from t h e a p p l i cation of Lemma 3 . 1 . Example 3 . 1 .
Consider the linear dynamic system described in the frequency-domain
by t h e fo]lowing t r a n s f e r m a t r i x : l
p(p_ i )
0
0
p-I
0
0
0
0
p-I
i p,-I
- -
I
w(p)
i 1~1
1
0
74 for which
q ( p ) = p ( p - 1 ) 3.
T h e c o n t r o l l e r s t r u c t u r e i s s p e c i f i e d b y t h e following o u t p u t f e e d b a c k m a t r i x :
!Ii K =
Adopting
the
k12
k13
0
0
0
k24
0
0
k34
notations
of
and
Vidyasagar
I(' =
and
kll
0
0
k12
0
0
k13
0
0
0
k24
k34
Wiswanadham,
the
]
J
polynomial
Z
g i v i n g t h e t r a n s m i s s i o n z e r o s of t h e s u b s y s t e m s c o r r e s p o n d i n g to t h e n o n s i n g u l a r s u b m a t r i c e s of K' a r e t h e following : * One-dimensional subsystems •
zI:]0
* Two-dimensional subsystems :
All t h e s e s u b s y s t e m s h a v e a common t r a n s m i s s i o n z e r o at ~0=1 which c o r r e s p o n d s to a pole of t h e s y s t e m . T h e r e f o r e , k0=l i s a f i x e d mode.
75 3.2.6.
- Comments
From the above characterization of fixed modes, several interesting results can immediately be deduced. T h e y are summarized in the following corollaries.
Corollary 3.1 ( T A O - 8 4 ) .
C o n d i t i o n s (i) a n d (ii) below a r e n e c e s s a r y for a s y s t e m to
have a fixed mode a t ~0 : i- The
entries of W(p)
corresponding
to nonzero
elements of K' must have
pole-zero cancellations at P=~0"
ii - For the c a s e m = r, P=~0 must be a transmission zero of the entire system.
Corollary
,3,2
(TAO-84).
If a n y
submatrices of K' is minimum
of
the
phase,
subsystems
corresponding
to nonsingular
the system has no unstable fixed modes.
(All
transmission zeros of m i n i m u m phase systems lie in the open left half plan).
I t is i n t e r e s t i n g
to n o t i c e t h a t f o r s i n g l e - i n p u t s i n g l e - o u t p u t s y s t e m s a t r a n s -
mission z e r o is t h e f r e q u e n c e Therefore,
for which the transfer
function numerator
vanishes.
a f i x e d mode c a n b e v i e w e d as t h e f r e q u e n c e w h i c h c u t s t h e i n f o r m a t i o n
flow b e t w e e n t h e i n p u t a n d o u p u t of some s u b s y s t e m s .
T h i s can p h y s i c a l l y e x p l a i n
why a d e c e n t r a l i z e d c o n t r o l may fail in t h e s t a b i l i z a t i o n o r pole a s s i g n m e n t t a s k .
3.3.
ALGEBRAIC
The
CHARACTERIZATIONS
following
characterizations
: TIME-DOMAIN
are stated
by using
a state-space
represen-
tation of t h e s y s t e m .
3 . 3 . 1 . - Matrix r a n k t e s t c h a r a c t e r i z a t i o n First,
let u s c o n s i d e r a p a r t i t i o n e d s y s t e m in t h e form ( 3 . 2 . 2 )
a n d t h e follo-
wing d e c e n t r a l i z e d c o n t r o l i n a c c o r d a n c e with t h e d e c o m p o s i t i o n of t h e s y s t e m : I u i ( t ) = Qi z i ( t ) + Ki Yi ( t ) + v i ( t ) (i=l ..... S)
(3.3.1)
~i(t) = S i z i ( t ) + Ri Yi (t) where z i ( t ) is t h e s t a t e of t h e i t h c o n t r o l l e r a n d v i ( t ) is t h e i t h e x t e r n a l i n p u t ,
76 In this context,
the following interesting algebraic characterization of de-
centralized fixed modes was provided by Anderson and Clements (AND-81a):
Theorem 3.7.
Let be the s e t ~ { 1 , . . . , S }
s u b s e t s na = { i l , . . . , i
k}
and
B(I = [Bil .... , Bik]
C
L
" Define also the matrices :
B B = [Bik+ 1 ""'Bi s ]
cB:
O~
and define a p a r t i t i o n of ~ into disjoint
~8 = ( i k + l ' ' " ' i s }
I i ik+l
Lis J
'k
Consider t h e system
(3.2.2)
a n d the decentralized control ( 3 . 3 . 1 ) .
n e c e s s a r y a n d s u f f i c i e n t condition for A0
(3.2.2) is that t h e r e exists at least one complementary s u b s y s t e m 2.6, § 2 . 2 . 3 b , C h a p t e r II) s u c h that :
rank
Then, a
o (A) to be a decentralized fixed mode of (see Definition
( n
(3.3.2)
cB Remark 3.1. Condition (3.3.2) is e q u i v a l e n t to 0 (C fl , A , B a )#1 so t h a t an immediate connection a p p e a r s with the r e s u l t s of Corfmat and Morse (COR-76b) (see Theorem 2.2, C h a p t e r I I ) . Example 3.2. C o n s i d e r the following p a r t i t i o n e d system ;
A=
i1o ]
CI= [1
C3=
1
0
0
1
0
0
0
0
0
0]
EOo o1 o1 0,1
B1 =
[i] Iil
B2 =
B3
77 for w h i c h we c o n c l u d e d Example 2 . 1 , This
§ 2.2.3a,
result
by using Chapter
is v e r i f i e d
t h e d e f i n i t i o n o f Wang a n d D a v i s o n
II) t h a t i t h a s a d e c e n t r a l i z e d
by
using
I n d e e d , i f we c h o o s e ~a = {3} a n d
rank
i -A C1
the characterization
(WAN-73)
(see
f i x e d m o d e at X0 = I . stated
in T h e o r e m
3.1.
~ = { 1 , 2 } , we h a v e t h e f o l l o w i n g :
= 3 < 4
C2 which is s u f f i c i e n t to v e r i f y c o n d i t i o n
(3.3.2).
Moreover,
for this example,
we h a v e
also :
I-A
B1
B3
rank C2
0
0
II-A
B2
B 3-
rank c I
o
A Fortran
= 3 < 4
for
~a = { 1 ' 3 }
and
~B = (2}
= 3 < 4
for
~a = (2,3}
and
~'8 = ( 1
o
routine for detecting the real decentralized
which is b a s e d on A n d e r s o n a n d C l e m e n t s ' t e s t , This result
gives some insight
I n d e e d , it p r o v i d e s system
(3.2.2)
stations
a
and
}
into the reasons
an immediate interpretation
if t h e r e
exists
~ such
stations and unobservable
simultaneously
by the other one.
in A p p e n d i x 4.
of occurence
of fixed modes.
• )'O i s a d e c e n t r a l i z e d
a disjoint partition
t h a t ;~0 is
fixed modes of a system,
is p r o v i d e d
of the
system
uncontrollable
fixed mode of
in two a g g r e g a t e by
one
T h i s s i t u a t i o n is i l l u s t r a t e d
3.1 : Aggregate station %0
a
A g g r e g a t e station
uncontrollable a
U,
lI
•.'
Uik
13
X0 unobservable ~
Yi I "" Yik
Uik+ 1 "'" Uis
SYSTEM
F i g u r e 3.1
Yik+ l "'" Yis
4L
of by
these Figure
78 This interpretation is
simultaneously
l e a d s to t h e following i n t e r e s t i n g
controllable and
observable
by one
c o n c l u s i o n ". if k 0 ~ o (A)
single
station
i~{
1 . . . . . S),
then ~ is not a decentralized fixed mode of the system.
U n f o r t u n a t e l y t t h i s c h a r a c t e r i z a t i o n does n o t help p a r t i c u l a r l y in t h e c o m p u t a t i o n of f i x e d modes
s i n c e it r e q u i r e s
t h e e v a l u a t i o n of t h e r a n k
of 2S-2 m a t r i c e s
whose d i m e n s i o n s a r e s u p e r i o r to t h e o r d e r of t h e s y s t e m . A m e t h o d to o v e r c o m e t h i s d e s a d v a n t a g e is p r e s e n t e d
b y P e t e l a n d Misra (PET-B4) in t h e c a s e for w h i c h A h a s
a s u p e r i o r H e s e n b e r g form. T h e y p r o v i d e a c o n d i t i o n w h i c h is n u m e r i c a l l y e q u i v a l e n t to c o n d i t i o n
(3.3.2)
certain transfer
a n d in w h i c h f i x e d modes a p p e a r
functions.
They
apply
thus
their
as t h e t r a n s m i s s i o n z e r o s of
algorithm
for t h e
e v a l u a t i o n of
transmission zeros. C o n s i d e r now t h e g e n e r a l c a s e of a n o n p a r t i t i o n e d s y s t e m some a r b i t r a r y
feedback structure
(3.2.1)
constraints have been specified.
for which
For e a c h i n p u t
u i , we d e f i n e t h e i n d e x s e t : :Ii = {j ~ {1 . . . . . r} / t h e f e e d b a c k is allowed from yj to u i} As we a l r e a d y saw in p a r a g r a p h
(3.3.3)
2.3 of C h a p t e r I I , t h e l i n e a r t i m e - i n v a r i a n t dynamic
controller associated with these feedback constraints is given by : I
Z ~'i( t ) = Si z i ( t ) + j e J
rij y j ( t ) (i=l . . . . . m)
[ui(t)
q i' z i ( t ) + j ~Y' l
(3.3.4)
kij y j ( t ) + v i ( t )
w h e r e z i ( t ) is t h e s t a t e of t h e c o n t r o l l e r a n d v i ( t ) is t h e i t h e x t e r n a l i n p u t .
Sip Cli
a n d r.. a n d k.. a r e c o n s t a n t matrices~ v e c t o r s a n d s c a l a r s of a p p r o p r i a t e d i m e n s i o n s . 11
xl
In t h e g e n e r a l c o n t e x t ,
an e x t e n t i o n of t h e p r e v i o u s c h a r a c t e r i z a t i o n of d e c e n -
t r a l i z e s f i x e d modes was s t a t e d b y Pichai e t al. ( P I C - 8 4 ) p r o v i d i n g a g e n e r a l m a t r i x r a n k t e s t c h a r a c t e r i z a t i o n of fixed m o d e s . T h e o r e m 3 . 8 . For a n a r b i t r a r y s u b s e t
:
I = ( i 1 . . . . . i k } c M = (1 . . . . . m} define I = i ~r M - t
~i = {Jl" - - - , l "q }
w i t h Ji as d e f i n e d in ( 3 . 3 . 3 ) . the
complementary
(k--1,...,m-1).
subsystems
T h e n ~ similarly to t h e c a s e of d e c e n t r a l i z e d c o n t r o l , of
system
(3.2.1)
are
given
by :
(Cj,
A,
BI) ,
79 Then, (3.2.1)
a
with
necessary
respect
subsystem such that
rank
to
and the
sufficient control
condition
(3.3.4)
is
f o r X0
that
to
there
be
exists
a
fixed
mode
of
a complementary
:
[:o I' 1
< n
(3.3.5)
J
Example 3 . 3 . C o n s i d e r t h e f o l l o w i n g s y s t e m w i t h 3 i n p u t s
-1
A=
-2
B=
-3
C=
0
0
1
1]
1
0
0
0
0
1
0
1
for w h i c h t h e f e e d b a c k s t r u c t u r e
Jl = {2}
constraints
1
0
1
1
I
0
0
1
0
0
1
are given by
:
:
; J 2 = {1,3} ; J3 = {I}
c o r r e s p o n d i n g to t h e f e e d b a c k m a t r i x
0 K =
0
and 3 outputs
k21 Lk31
k12
0
0 0
k23 0
:
]
T h e n , if we c o n s i d e r t h e s u b s e t
I = {1,2} , we o b t a i n 5 = {1}
a n d we h a v e ,
for
kO=-3 : I rank
XO I-A
[c I
T h e r e f o r e , X0=-3 is a f i x e d m o d e . In t h i s g e n e r a l case of d e c e n t r a l i z e d tioning of t h e
system
case,
the interpretation
control.
Indeed,
does not appear
so clearly as for the
we h a v e to t a k e i n t o a c c o u n t t h a t t h e p a r t i -
in t w o a g g r e g a t e d
stations
I and
J is not
disjoint.
The
in-
80 t e r p r e t a t i o n can b e g i v e n as follows : a n e c e s s a r y c o n d i t i o n f o r X0 ~
o (A) to b c a
f i x e d mode is t h a t t h e r e e x i s t s a s u b s e t of i n p u t s w h i c h c a n n o t c o n t r o l X0 a n d that t h e s u b s e t of o u t p u t s i n v o l v e d in t h e f e e d b a c k c o n t r o l of t h e c o m p l e m e n t a r y s u b s e t o f i n p u t s c a n n o t o b s e r v e X0" This s i t u a t i o n is i l l u s t r a t e d b y F i g u r e
I UI X 0 uncontrollable Inputs Ul [ XO controllable ....
3.2.
Yj
1
SYSTEM
X0 observable Y3
Outputs
X unobservable 0
. . . .
F i g u r e 3.2
with UI v U~ = {u 1 . . . . . u m}
a n d Y j u Y~ = {Yl . . . . . Yr }
a n d ~ I : C o n t r o l l e r o f t h e s u b s e t o f i n p u t s UI ~T : C o n t r o l l e r of t h e s u b s e t of i n p u t s UT
3.3.2.
-
Recursive
characterization
Consider again decentralized
feedback
a
partitioned controller
s y s t e m in (3.3.1).
In
the
form
this
context,
(3.2.2)
t e r i z a t i o n o f f i x e d modes p r o v i d e d b y Davison a n d O z g u n e r
the
and
its
associated
following c h a r a c -
(DAV-83) p r e s e n t s
the
i n t e r e s t to s h o w e x p l i c i t e l y t h a t t h e e x i s t e n c e of f i x e d modes for a S - s t a t i o n system always r e d u c e s to t h e e x i s t e n c e of f i x e d modes f o r a s e t of 2 - s t a t i o n s y s t e m s (by r e c u r s i v e a p p l i c a t i o n of T h e o r e m 3.9 w h i c h b r i n g s b a c k S to ( S - l ) ) .
Theorem 3 . 9 . I - Given t h e S - s t a t i o n s y s t e m ( 3 . 2 . 2 ) d e c e n t r a l i z e d f i x e d mode of
(3.2.2)
with S )/ 3, t h e n X0 ~
~ (A) is n o t a
if a n d only if ~0 is n o t a d e c e n t r a l i z e d fixed
mode of a n y of t h e following ( S - 1 ) - s t a t i o n s y s t e m s :
81
C2
(2)
, A,
[[BI, B2], B3,-..,B $] )
, A,
[B 1, [B 2, B3],--., BS] )
[BI,...,Bs_ 2, [BS_I, BS~)
(s)
Cs-2 Cs
, A,
[BI,..., BS_3, [Bs_ 2, BS], BS_1 ])
L Cs_13
II - Given the S-station system (3.2.2) with S=2, then X0 ~ o (A) is not a decentralized fixed mode of (3.2.2) if and only if the two following conditions both hold :
|
2
rank
I
X I-A
>.. n C2
rank I X01-A
LCl
BII 0 121 >..n
82 Now, i t is o f i n t e r e s t to a n a l y s e t h e m e a n i n g of t h e c o n d i t i o n s (1) a n d (2) of p a r t II of T h e o r e m 3.9.
T h e s e c o n d i t i o n s c o r r e s p o n d to t h e s i m u l t a n e o u s r e q u i r e -
ments that : S t a t i o n 1 (or 2) can c o n t r o l t h e mode ~0
-
- Station 2 (or 1) can o b s e r v e t h e mode ~0 -
10 is n o t a t r a n s m i s s i o n z e r o of c e r t a i n s u b s y s t e m s of t h e s y s t e m .
In f a c t ,
these conditions are
e q u i v a l e n t to t h e condition ( 3 . 3 . 2 )
of Theorem
3.7 ( s e e § 3 . 3 . 1 ) for a 2 - s t a t i o n s y s t e m . It was a l r e a d y o b v i o u s in c o n d i t i o n (3.3.2) t h a t t h e e x i s t e n c e of d e c e n t r a l i z e d f i x e d modes for a S - s t a t i o n s y s t e m is r e d u c e d to t h e e x i s t e n c e of f i x e d modes f o r a s e t of 2 - s t a t i o n s y s t e m s s i n c e t h i s c o n d i t i o n shows a partition
of t h e
s y s t e m in
Z aggregated
stations a and
B.
It
stated
that
the
s y s t e m h a s no f i x e d modes if a n d o n l y if t h e following condition h o l d s f o r every possible partition .
rank
>~ n C
V )'0 6_ o"(A)
0 6
This is e q u i v a l e n t to c h e c k i n g t h e e x i s t e n c e of f i x e d modes for e v e r y 2-station
system ( B a B 6 ,
A,
Ca
C6), ~ a c ~ ,
~ u~ 6 = ~.
Note t h a t f o r a S - s t a t i o n s y s t e m , t h e n u m b e r o f p o s s i b l e p a r t i t i o n s is e q u a l to ES-2. By u s i n g t h e p r o c e d u r e p r o p o s e d b y Davison a n d O z g u n e r a n d d e s c r i b e d in Theorem 3.9, we o b t a i n t h e same t e s t s .
Nevertheless, the recursive characterization
of t h e s y s t e m s l e a d s to some r e d u n d a n c i e s .
Indeed,
it r e s u l t s in
(S!/Z)
2-station
s y s t e m s and it is c l e a r t h a t some a r e r e p e a t e d . Example 3 . 4 .
C o n s i d e r a 4 - s t a t i o n s y s t e m (C 1 C 2 C 3 C4, A, B 1 B 2 B 3 B 4 ) . Condi-
tion ( 3 . 3 . 2 ) m u s t be t e s t e d for t h e 7 following 2 - s t a t i o n s y s t e m s :
(c I (c z c 3 c 4)
A
B 1 (B 2 B 3 B4))
(z)
(c 2 (c I C 3 c 4)
A
B 2 (B 1 B 3 B4))
(3)
(c 3 (c I c 2 c 4)
A
B 3 (B 1 B 2 B4))
(4)
( c 4 ( c 1 c 2 c 3)
A
B 1 B z (B 3 B4))
(5)
(C 1 C z (C 3 C 4)
A
B 1 B 3 (B 2 B4))
(6)
(c I C 3 (c z C 4)
A
B 1 B 3 (B 2 B4))
(7)
(c I c 4 (c z c 3)
A
B 1 B 4 (B 2 B3))
(i)
83 By using the p r o c e d u r e in Theorem 3.9, we o b t a i n 12 Z-station systems b u t 5 of them are r e d u n d a n t :
((C 1 C 2, C 3) cAt, A, (B 1 B2 B3) BAt ) (1) ((C 1 C 2) C 3 C 4, A, (B 1 B2) B3 B4) ((C 1 C 2) (C 3 C4), A, (B 1 B2) (B 3 BAt)) (2) ((C 1 C 2 C 4) C 3, A, (B 1 B2 B4) B 3 ) (3)
(C 1 (C 2 C 3) C/4, A, B 1 (B2 B3)B4)
((C 1 C 2 C 3) CAt, A, (B 1 B2 B3) B4)
(4)
(C 1 (C 2 C 3 CAt), A, B 1 (B2 B3 B4))
(5)
((C 1 Co) (C2 C3), A, (B 1 BAt) (B2 B3)) (6)
((C 1 C 2) (C 3 Co), A, (B 1 B2) (B 3 BO)) (7) (C 1 C 2 (C 3 CO), A, B 1 B2 (B3 B4)) (C 1 (C 2 C 3 C4), A, B I (B2 B 3 B4))
(8)
((C i C 3 C 4) C 2, A, (B 1 B3 B4 ) B2 )
(9)
((C 1 C 2 C/fl C3, A, (B 1 8 2 B~.) B3 )
(10)
(C 1 (C2 C 4) C 3, A, B I (B2 B/4) B3) (C 1 (C2 C 4 C3), A, B l (B2 B4 B3))
(ll)
((C 1 C 3) (C 2 C4), A, (B 1 B3) (B2 B4)) (/2)
Systems (1) a n d (4) ; (5), (8) and (11) ; (3) a n d (10) ; (2) a n d (7) are the same.
However, this r e c u r s i v e method p r e s e n t s the a d v a n t a g e to p r o v i d e a systematic way to determine all the p a r t i t i o n s .
3,3,3,
-
3,3.3,a,
Particular
-
cases
Diagonal
systems
Consider the diagonal :
following 2 - s t a t i o n system in which the
Xl ~(t)
=
\
N\\
x(t) +
dynamic matrix A is
1 k%J VB] ul(t) +
LB,J
u2(t)
(..3.3.6)
84 Yl(t)
= (C I , C I ) x ( t )
Y 2 ( t ) = (C~, C 2) xCt) where u 1 ~ are
ml,
Rml'
u2 ~
R m 2 ' Yl ~
m2 row vectors,
Rrl
respectively
' Y2 ~ R r 2
a n d k i ~* ~ ' ( i = l ' ' " n ) "
a n d C 1, CZ, a r e
B1, B2
r 1, r 2 c o l u m n v e c t o r s ,
res-
pectively. Let B l = [b I , ..., b ml l ]
B2 : [b~ , ..., b 2
m2 ]
cI
c
'I Izl
CI=
C2=
cI rI
and
assume
that ki'
LCr2
(i=l . . . . , n ) ,
are
all d i s t i n c t
and
occur
in
complex
conjugate
pairs. Then,
by applying
Theorem
manipulations,
t h e following r e s u l t
Theorem
(DAV-83).
3.10
3.7 to this particular is obtained
~'0 i s n o t a d e c e n t r a l i z e d
a n d o n l y if t h e f o l l o w i n g c o n d i t i o n s
c a s e a n d w i t h some matrix
: fixed
m o d e of s y s t e m
(3.3.6)
if
hold :
[_c2 i.e.,
)t 0 i s n o t a c e n t r a l i z e d
f i x e d m o d e (it i s c o n t r o l l a b l e a n d o b s e r v a b l e ) .
ii - T h e f o l l o w i n g c o n d i t i o n s *B
do n o t s i m u l t a n e o u s l y
hold :
=0
*C~=0 * XO i s subsystems
ci
a
transmission
zero
of
all
the
following
single-input
:
,
l
tn-i
V j ¢ { 1,2,...,mq}
q-~l,2
single-output
85
Note t h a t this theorem can easily be e x t e n d e d to the case for which t h e system has more than 2 stations b y applying T h e o r e m 3.9 (DAV-83)
(see also (PET-84)).
3.3.3.b. - Interconnected systems This paragraph deals with a particular class of systems of type (3,2.2) consisring of a n u m b e r
of subsystems interconnected together.
These systems are repre-
sented in the state space b y the following set of equations : S
t ~i(t) : A i i xi(t) + j=l r. Aij xj(t) + Bi ui(t) jti
(i=1..... S)
(3.3.7)
[ Y i ( t ) = Ci x i ( t ) x i £ Rni ' ui £ Rmi ' Yi ~ Rri A=
{Aij, (i=1, .... S), (j=l..... S)} c R n x n (B 1 ..... BS) c
R nxm
C -- block.diag. (GI,...,Cs) c
R rxn
B = block.diag.
Aii, Aij, Bi and Ci, (i=l . . . . ~S), j~i, a r e i n v a r i a n t matrices of a p p r o p r i a t e dimension.
1 - Characterization with c o n s t r a i n e d i n t e r c o n n e c t i o n s Consider the class of i n t e r c o n n e c t i o n s in the form : Aij = Bij Lij Cij
(i,j=l . . . . . S)
jCi
(3.3.8)
where Lij is the matrix of i n t e r c o n n e c t i o n gains a n d Bij a n d Cij are a r b i t r a r y . T h e n , the following r e s u l t was d e r i v e d b y Davison (DAV-83) : Theorem 3.11. Given the system (3.3.7) with s t r u c t u r e ( 3 . 3 . 8 ) , if (Ci,Afi,B i) is controllable a n d o b s e r v a b l e for ~/ i=1,2 . . . . . S t h e n ( 3 . 3 . 7 ) (3.3.8) has no d e c e n t r a lized fixed modes for almost all i n t e r c o n n e c t i o n gains Lij, (i=l, . . . . S), (j=l . . . . , S ) , i~j, i.e. the class of n o n z e r o gains L.. for which (3.3.7) (3.3.8) has fixed modes is 1] either empty or lies on a s u b s e t of a h y p e r s u r f a c e in the p a r a m e t e r space of Lij. A more i n t e r e s t i n g r e s u l t is p r o v i d e d if it is assumed that the system (3.3.7) is i n t e r c o n n e c t e d b y the o u t p u t s ; i . e . :
86
Aij = Bi Lij Cj Note t h a t
(i=l . . . . . S ) ,
e v e n if t h i s
(j=l . . . . . S ) ,
(3.3.9)
j~i
c l a s s o f s y s t e m s s e e m s to
be
very
restrictive
with
r e s p e c t to t h e c l a s s of g e n e r a l s y s t e m s ( 3 . 2 . 2 ) , a lot of p h y s i c a l s y s t e m s h a v e this particular structure.
I n d e e d , t h e d e c e n t r a l i z e d s t a b i l i z a b i l i t y s t u d y f o r t h i s t y p e of
s y s t e m s was t h e p r o b l e m w h i c h m o t i v a t e d t h e e x t e n t i o n to more g e n e r a l s y s t e m s like ( 3 . 2 . 2 ) or ( 3 . 3 . 7 ) . Theorem 3.12.
The s y s t e m ( 3 . 3 . 7 )
with s t r u c t u r e
( 3 . 3 . 9 ) h a s no d e c e n t r a l i z e d fixed
modes if a n d o n l y i f • ( C i , A i i , B i) c o n t r o l l a b l e a n d o b s e r v a b l e for all (i=l
. . . . .
S).
For t h i s t y p e of s y s t e m s , t h e s e t of d e c e n t r a l i z e d f i x e d modes is e q u a l to the s e t of c e n t r a l i z e d f i x e d modes ( u n c o n t r o l l a b l e o r u n o b s e r v a b l e modes) which is itself equal to t h e union of t h e s e t s of c e n t r a l i z e d f i x e d modes of e a c h d i s c o n n e c t e d system.
This r e s u l t was also d e r i v e d b y
Saeks
(SAE-79)
a n d s t a t e d in t h e following
way ; Theorem 3¢12bis.The s e t of c e n t r a l i z e d f i x e d modes of ( 3 . 3 . 7 )
with s t r u c t u r e
(3.3.9)
is g i v e n b y : 5 Ad(C,A,B) = ~ ( C , A , B ) :
u
i=l
Ac(Ci,Aii,8 i)
T h e r e f o r e , f o r t h i s c l a s s of s y s t e m s , a d e c e n t r a l i z e d c o n t r o l is e q u i v a l e n t to a c e n t r a l i z e d c o n t r o l as f a r as t h e pole a s s i g n m e n t p r o b l e m is c o n c e r n e d .
2 - C h a r a c t e r i z a t i o n u s i n G t h e p r o p e r t y of b l o c k - d i a g o n a l dominance C o n s i d e r t h e s y s t e m ( 3 . 3 . 7 ) a n d t h e following s e t of local c o n t r o l l e r s :
ui = Kii Yi
(i=l . . . . . S) s u c h t t h a t K = b l o c k . d i a g . ( K l l , . . . . KSS)
The dynamic m a t r i x of t h e c l o s e d - l o o p s y s t e m is •
!/~I! A + BKC=
AI2 ........
AI5
'~22
' ' . ". " . . . ASI
" ~SS
87 where ~ii = Aii + Bi Kii Ci ' ( i = l , . . . , S ) . If the diagonal s u b m a t r i c e s ~.. a r e non s i n g u l a r a n d i f : 11
S
<
i-z_ II A i(I
v
j/~
then {A+BKC) i s s t r i c t l y b l o c k - d i a g o n a l d o m i n a n t .
.....
s
*
d e n o t e s a norm of t h e m a t r i x
(*), for i n s t a n c e :
I[*i =
l
1
laijl
The following w e l l - k n o w n r e s u l t : Theorem 3.13.
I f t h e m a t r i x (A + BKC) is s t r i c t l y b l o c k - d i a g o n a l l y d o m i n a n t , t h e n
(A + BKC) is n o n s i n g u l a r . leads to t h e s u b s e q u e n t c h a r a c t e r i z a t i o n of fixed m o d e s . Corollary 3.3 (ARM-82). If k0 ~ o (A) i s a d e c e n t r a l i z e d f i x e d mode of ( 3 . 3 . 7 ) , there e x i s t s i C { 1 , . . . , S }
then
such that :
s II(~ii-x° I)-lll-l~ j-~l [iAijll
for
VKii
e~
Rmixri
(3.3.1o)
j/i The i n t e r e s t o f t h i s c h a r a c t e r i z a t i o n will a p p e a r l a t e r (in C h a p t e r 5) s i n c e it is used by A r m e n t a n o a n d S i n g h to d e t e r m i n e a c o n t r o l s t r u c t u r e s u c h t h a t f i x e d modes are avoided.
3.3.4. - C o m m e n t s The c h a r a c t e r i z a t i o n s p r e s e n t e d in t h i s p a r a g r a p h
a r e s t a t e d in a t i m e - d o m a i n
framework. It is c l e a r t h a t t h e most r e l e v a n t is t h e m a t r i x r a n k t e s t c h a r a c t e r i z a t i o n which was p r o v i d e d b y A n d e r s o n a n d Clements (AND-81a) a n d , as it h a s b e e n p o i n t e d out, all the o t h e r o n e s a r e e q u i v a l e n t . This c h a r a c t e r i z a t i o n allowed u s to i n t e r p r e t e t h e f i x e d modes in t e r m s of t h e concepts of
controllability
and
observability
and
the
s u b s y s t e m s . We will f i n d a g a i n t h i s p a r t i t i o n i n g of t h e
d e f i n i t i o n of c o m p l e m e n t a r y s y s t e m in
two a g g r e g a t e d
88
s t a t i o n s in t h e
f r e q u e n c y - d o m a i n c h a r a c t e r i z a t i o n s w h i c h will give us t h e
tools to
i n t e r p r e t e in a d e e p e r way t h e r e a s o n s for t h e o c c u r e n c e o f f i x e d m o d e s . D e s p i t e t h e t h e o r e t i c a l i n t e r e s t of t h e m a t r i x r a n k t e s t c h a r a c t e r i z a t i o n , it is c l e a r t h a t it d o e s n o t seem to b e v e r y e f f i c i e n t from t h e c o m p u t a t i o n a l
p o i n t of view
s i n c e it r e q u i r e s to t e s t all t h e c o m p l e m e n t a r y s u b s y s t e m s . An
interesting
result
has
been
obtained
for interconnected systems
whose
i n t e r c o n n e c t i o n s a r e made b y t h e out-puts s i n c e t h e f i x e d modes of t h e s e s y s t e m s are j u s t t h e i r u n c o n t r o l l a b l e a n d u n o b s e r v a b l e modes.
3.4. - A L G E B R A I C
CHARACTERIZATIONS
This paragraph
matrix $ i.e.
DOMAIN
d e a l s with t h e c h a r a c t e r i z a t i o n o f f i x e d modes from t h e i n p u t -
output relations describing the system. nomial m a t r i c e s
: FREQUENCY
The s y s t e m is r e p r e s e n t e d e i t h e r b y poly-
( " m a t r i x f r a c t i o n d e s c r i p t i o n n) or
by
a rational
transfer
function
;
U(p) = W(p) Y(p)
(3.4.1)
w h e r e U a n d Y a r e t h e i n p u t a n d o u t p u t v e c t o r s of dimension m a n d r r e s p e c t i v e l y , a n d W(p) is t h e t r a n s f e r f u n c t i o n m a t r i x of dimension m x r . Let s - l ( p ) T ( p )
be a l e f t coprime f r a c t i o n d e s c r i p t i o n of W(p), t h e n t h e system
can be d e s c r i b e d b y •
s(p) Y(p) = T(p) U(p)
(3.4.2)
w h e r e S ( p ) a n d T ( p ) are polynomial m a t r i c e s with r a n d m c o l u m n s , r e s p e c t i v e l y .
3 . 4 . 1 . - N e c e s s a r y c o n d i t i o n s on t h e t r a n s f e r f u n c t i o n m a t r i x f o r t h e e x i s t e n c e of f i x e d m o d e s Before
presenting
the
general
frequency-domain
characterizations
of
fixed
m o d e s , t h i s p a r a g r a p h p r o v i d e s some n e c e s s a r y c o n d i t i o n s for t h e i r e x i s t e n c e , which are i n t e r e s t i n g b e c a u s e
they can b e c h e c k e d b y t h e sole examination of t h e t r a n s f e r
matrix. C o n s i d e r t h e s y s t e m d e s c r i b e d b y ( 3 , 4 . 1 ) with :
89 p) w(p) = N¢ ( (p)
(3.4.3)
where N ( p ) = C a d j ( p I - A ) B is a polynomial m a t r i x a n d ¢ (p) is t h e c h a r a c t e r i s t i c p o l y nomial of t h e s y s t e m . Now,
if we c o n s i d e r
the
c o n t r o l law in
matrix K can t a k e a n y a r b i t r a r y
structure,
(3.2.4)
where
the output
the closed-loop transfer
feedback
m a t r i x is g i v e n
by : Wc(P,K) = [ I - W ( p ) K ] - I w ( p )
(3.4.4)
= C(pI-A-BKC)-IB
which can b e r e w r i t t e n as : Nc(P,K )
Wc(P,K) =
(3.4.5)
where N c ( P , K ) = C a d j ( p I - A - B K C ) B
is a polynomial m a t r i x a n d
~(p,K)
is t h e c l o s e d -
loop c h a r a c t e r i s t i c polynomial. If t h e
system
has
fixed
modes,
it is c l e a r
that
the
fixed
polynomial F ( p )
divides t h e c l o s e d - l o o p c h a r a c t e r i s t i c polynomial s u c h t h a t we can w r i t e : $c(P,K)
=
F(p).P(p,K)
If we d e r i v e
~bc(P,K) with r e s p e c t to K :
,a¢c (p,K) ~) K
~ p(p,K) =
F(p)
8 K
and it is c l e a r t h a t if P=;~0 is a f i x e d mode, t h e n :
a~c (~ o' K)
(3.~.6)
=0 8K
C o n s i d e r now t h e following t h e o r e m • Theorem 3.14
(BIN-78)
(BER-81).
T h e J a c o b i a n m a t r i x of t h e c l o s e d - l o o p c h a r a c t e -
ristic polynomial qbc(P,K) with r e s p e c t to K is g i v e n b y :
~¢c(pJ<) - - N c (p,K) aK
(3.4,7)
90
w h e r e N ' c ( P , K ) i s t h e t r a n s p o s e of N c ( P , K ) i n
(3.4.5).
T h e o r e m 3 . 1 4 a n d f o r m u l a ( 3 . 4 . 6 ) l e a d to t h e following r e s u l t :
Theorem respect
3.15. to
A necessary
K in
(3.2.4)
is
condition that
the
f o r ~0 to be projection
a
fixed
of t h e
mode o f
(3.4.1)
with
closed-loop
transfer
matrix
parameter
v a l u e s in
K, it
n u m e r a t o r N c ( P , K ) on K ~ i s z e r o f o r P=~0" Since this
result
must
hold i n d e p e n d e n t l y
of t h e
m u s t in p a r t i c u l a r hold for K=0. T h e r e f o r e t h e following c o r o l l a r y d i r e c t l y follows :
Corollary
3.4.
A necessary
r e s p e c t to K in ( 3 . 2 , 4 )
condition
f o r X0 to b e
a
f i x e d mode of
is t h a t the projection of the t r a n s f e r
(3.4.1)
with
m a t r i x n u m e r a t o r N(p)
o n K t i s z e r o f o r P=~0" It is i n t e r e s t i n g same as the condition
to n o t i c e t h a t
the
c o n d i t i o n in
Corollary
3 . 4 i s e x a c t l y the
(i) ha C o r o l l a r y 3.1 w h i c h w a s o b t a i n e d f r o m t h e c h a r a c t e r i -
zation of f i x e d m o d e s i n t e r m s of t r a n s m i s s i o n z e r o s . T h i s r e s u l t c a n also be e x p r e s s e d in t h e following f o r m : Corollary 3.5. order
A m u l t i p l e mode of o r d e r q c a n b e a f i x e d mode if it i s n o t a pole of
s u p e r i o r to ( q - l )
f o r a n y s u b s y s t e m f o r m e d f r o m a n y local s u b s y s t e m n e i t h e r
f o r t h e c h a r a c t e r i s t i c p o l y n o m i a l of t h e p r o j e c t i o n of t h e t r a n s f e r m a t r i x on K w.
Remark 3.2.
As a c o n s e q u e n c e of C o r o l l a r y
complementary
Note t h a t structure
3.5,
the
f i x e d m o d e s a r e p o l e s o f the
subsystems. Theorem 3.15,
C o r o l l a r i e s 3.4 a n d
3.5 a r e v a l i d f o r a n y a r b i t r a r y
of t h e f e e d b a c k m a t r i x K ( n o t n e c e s s a r i l y b l o c k - d i a g o n a l a s in ( 3 . 2 . 1 1 ) ) .
For e x a m p l e , in t h e p a r t i c u l a r
c a s e of c e n t r a l i z e d c o n t r o l ,
we f i n d a g a i n from Co-
r o l l a r y 3.5 t h a t a s i m p l e u n c o n t r o l l a b l e a n d / o r u n o b s e r v a b l e mode d o e s n o t b e l o n g to t h e c h a r a c t e r i s t i c p o l y n o m i a l (minimal r e a l i z a t i o n ) , w h i c h i s a w e l l - k n o w n r e s u l t . E x a m p l e 3 . 5 . C o n s i d e r t h e s y s t e m d e s c r i b e d b y t h e following t r a n s f e r m a t r i x :
91 for w h i c h ¢
(p)--p(p-l) (p+Z)
If we c o n s i d e r
(p-Z).
a decentralized
c o n t r o l in t h e f o r m :
K = b l o c k - d i a g . ( k 1 , k 2 , k 3) the projection
of
W(p)
on
a c c o r d i n g to C o r o l l a r y Note
that
the
K'
is indicated
by
the
non
shaded
Therefore,
blocks.
3 . 5 , ~=2 a n d k =-Z a r e n o t f i x e d m o d e s . conditions
determine a structure
for
derived
the
feedback
in
this
matrix
paragraph such
that
can the
be
easily
system
used
to
has
no fixed
and observation
stations
mo de s •
3.4.2. - Transfer
function matrix characterization
for
systems with distinct poles Consider
the
system
such that its transfer
W(p)
| t
(3.4,1)
A0 P-
w h e r e A0~0 a n d ~ i ~ 0
+
~0
in the following form :
i
wsL(p)
.........
rixm i,
(i,j=l .....
At
i=i
P-~i
In t h e c a s e o f 2 s t a t i o n s ,
S),
and
assume
that
all i t s p o l e s a r e
as •
n-I
(i=l . . . . .
(3.~.s)
ws's(p)
W(p) c a n b e f a c t o r i z e d
VC(p) --
in S control
wi(p]
. . . . . . . . .
w h e r e Wij(p) i s o f d i m e n s i o n distinct ; i.e.
partitioned
function matrix appears
(3.4.9)
n-l). the time domain representation
( 3 . 3 . 6 ) a n d W(p) c a n b e r e w r i t t e n
as follows :
of (3.4.9)
is given in
92
CI +
Using
(3.4.10),
Davison
and
1 ~1
0 [}51
1£_
C2
B 2]
(3,t4.10)
p-kn_l
Ozguner
(DAV-83)
p r o v i d e d in
the
frequency
domain t h e t r a n s p o s i t i o n of t h e r e s u l t e s t a b l i s h e d b y T h e o r e m 3.10 in a time-domain framework.
The c a s e
for w h i c h t h e s y s t e m h a s more t h a n 2 s t a t i o n s is considered
b y a p p l y i n g t h e r e c u r s i v e c h a r a c t e r i z a t i o n of f i x e d modes g i v e n in T h e o r e m 3.9. T h e o r e m 3.16. l 0 i s n o t a d e c e n t r a l i z e d f i x e d mode of ( 3 . 4 . 1 )
( 3 . 4 . 8 ) i f a n d only if
n o n e of t h e following c o n d i t i o n s o c c u r with r e s p e c t to t h e m a t r i c e s :
W(p)
A0 a n d
or their respective
P= XO
-
transposes
.
C a s e 1 : (S=2)
(i)
AO =
and
(p) -
=
0
p=X 0
Case 2 : (5=3) (i)
(ii)
Ao =
AO=
0
X
0
0
0
and
~
and
(p) -
0
(iii)
A0 =
= P - XO
-P = XO
x0] 0
0
X
0
and
(p) -
= P = XO
i
X
X
X
0
0
X
0
X
X
0
X
X
L xx1 X
0
X
X
°.
I X
X
X
X o X o
f X
I
X
X:
I
o
~
X X X X
I
X
o
X
I X
X
X
I
o
X
X
I
o
~
X
!
x
X
X
I
X X X X X
X
I
X
X
X
~
~
X
X X X X
X
X
o
o
X
X
X
X
~
o
X
o
I X
X
X
~
X
:;,< ,I
X
o
X
>¢
X
o
X
X
X
X
X
o
o
I
o |
X
o
o
o
Ii
i
o
11
X
o
X
o
o
,r,
I
J
IR '
I
X
u
<
o
o
cr~
o
X
o
o
o
I
0
M
o
"0 r-' r~
0
~
I0
~
0
0 ,I
II
X
0
I
0
X
o
0
i
o
i
0
0 0
0
I
X
J
0
X
X
0
ii
0
X
'
'
o
Ii
Li t~
0
o
I
~:)
o
ii
i
0
o
0
X
0
o
X
l
ii e~
i
x
o
0 I
o
I
X I
H
'l 1
o
o
I
o
II
I
o
x
o
I
ii
i
X
'
0
X
H
&
I
o
>(
X
~:
I o
c)
0
I
o
X
0
I H
I
-0
o
X
0
o
X
o
0
o
X o
0
0
o
o X
C)
0
I
X X
0
0
I
X o
0
0
''
"o
I
c~
I
c~
X o
0
0
o
o
o
0
0
o
o
0
0
o
0
0
L
0
I
0
I
0
I
(D
I
0
I
0
<
0
0
II
4:'
0
I
0
II
A
IW
u
¢)
¢)
"O
im
r~
O
o
a
(J
t-
o
¢,
94 trollable and observable by a single station.
All t h e e l e m e n t s of ~ 2 1 ( P )
h a v e a zero
a t X0 a n d t h o s e of W12(p) h a v e a pole a t k0, w h a t p r o d u c e s a p a r a m e t r i c cancellation w h e n one local f e e d b a c k is a p p l i e d . T h i s will b e e x p l a i n in d e t a i l s in Paragraph 3.4.4. It is c l e a r t h a t
this
c o n d i t i o n is s t r i c t l y
e q u i v a l e n t to t h e
conditions
in
Theorem
3.10. A similar interpration can be given for the case S)2. Example 3.6.
C o n s i d e r a g a i n t h e s y s t e m in Example 3.5 a n d a s s u m e t h a t we want to
c h e c k if X0 =-1 is a f i x e d mode w i t h r e s p e c t to K = b l o c k - d i a g ( k l , k 2 , k 3 ) W ( p ) w r i t t e n in t h e form ( 3 . 4 . 9 )
w(p)
ii
o 0
o
L-~
o
o
3 i>-2
0
1
0
BS:
0
p-2
O
0
0
0
0
0
A0
]
w(p)- p-~
1
p(p-2)
1
0
[
X
p+l p ( p - 2)
1
p-2
0
p+2
a n d we h a v e : l 0
can be
•
x p=- l
0]
0
X
X
0
X
0
which s a t i s f i e s c o n d i t i o n (ii) for t h e case 2 (S=3). T h e r e f o r e X0=-I i s a d e c e n t r a l i z e d fixed mode.
3.4.3.
- Polynomial
matrix
rank
test
characterization
C o n s i d e r a l i n e a r t i m e - i n v a r i a n t s y s t e m p a r t i t i o n n e d in S c o n t r o l a n d o b s e r v a t i o n s t a t i o n s s u c h t h a t i t s m a t r i x f r a c t i o n d e s c r i p t i o n in ( 3 . 4 , 2 ) t a k e s t h e form : ($1(P) ..... Ss(P))
U(p) = (TI(P) ..... s(p))
Y(p)
(3.4.11)
95 where Si(p) and T i ( P ) , (i=1 . . . . . S), have r i and mi columns, r e s p e c t i v e l y p c o r r e s ponding to the number of o u t p u t s and i n p u t s of the ith s t a t i o n . In this framework, A n d e r s o n (AND-81a) gives the following c h a r a c t e r i z a t i o n of decentralized fixed modes : Theorem 3.17. X0 is a d e c e n t r a l i z e d fixed mode of system (3.4.2) (3.4.11) with respect to K in (3.2.11) if and only if t h e r e e x i s t s some nonempty s u b s e t { i l , . . . i , k } of {1 . . . . . S} such t h a t : k [Sil (~0), ..., Sik (~0), Ttl (~0), ..., Tik (~0)] i -~1 r iJ (3.4.12) k It we set .E r.. = ~3 , then the d e g r e e of the fixed mode ~0 is given b y the ]:l 11 largest positive i n t e g e r d such t h a t all ~ x 8 minors of the matrix in the left hand side of (3.4.12) have a zero at )0 of o r d e r at least d. rank
Note that this r e s u l t was r e c e n t l y p r o v e d in a d i f f e r e n t way b y Zheng (ZHE84).
3.4.4.
- General
transfer
function
matrix
characterization
This general c h a r a c t e r i z a t i o n of fixed modes is the most complete one in the frequency domain. It was d e r i v e d b y A n d e r s o n in 1982 (AND-82) using the r e s u l t that he obtained t o g e t h e r with Clement in 1981 (AND-81a) and which was p r e s e n t e d in the p r e c e d i n g p a r a g r a p h .
3.4.4.a. - P a r t i c u l a r case : 2x2 t r a n s f e r function matrix with simple pole at ~0 Consider the system (3.4.1) where W(p) is given by :
Wll(P)
Wl2(P) 1
w(p) =
O.4.13)
W21(P)
Suppose t h a t W(p) = s - l ( p ) T ( p ) S(p) = [
W22(P)
with :
Sll(P)
Sl2(P)
s21 (p)
s22(P)
1
96
T(p) =
I
tl l(P)
tl2(P)
t21 (p)
t22(P)
t
(3.4.10)
and S(p) and T(p) are left coprime. If we apply Theorem 3.17 to this particular case, there is a fixed mode at )~0 ff and only if, by reordering the inputs and outputs if necessary, the following condition holds :
rank
I SllJ(XO) s21(2' 0)
i.e.,
tll(XO) 1
( 1
t2l()~ 0)
sl 1(~0) =s21 (k0) =tll (k0) =t2l (k0) =0.
Wij(p) in (3.4.13) can easily be expressed in terms of sij(p) and tij(p) for i,j:l,2 and the following result follows : Theorem 3.18 (AND-82). k 0 is a decentrelized fixed mode of system (3,4.13) if and only if W(p) or W'(p) has the following form : I entry with no pole at k0
entry with pole at ~'0
1 (3.4.1s)
entry with zero at k 0
entry with no pole at X0
J
This result can easily be interpreted. Indeed) consider system (3.4.13) as illustrated by Figure 3.4a and suppose that we set u 2 -- k 2 Y2' producing thus a system with input u I and output Yl as illustrated by Figure 3.4h.
97
uI
~[
wII(P) ]
+~
~l
y,
j'.
,,
j
kl F i g u r e 3.4a
÷ ~C~y÷I
L
F i g u r e 3.4b
The t r a n s f e r f u n c t i o n o f t h e n e w
Yl u'-~
= Wll
system is given by :
k 2 W21
+ WI2
l - W 2 2 k2
If condition ( 3 . 4 . 1 5 )
h o l d s for W ( p ) , t h e p o l e - z e r o c a n c e l l a t i o n a r k 0 in t h e p r o d u c t
Wl2. WE1, a s s o c i a t e d with t h e f a c t t h a t Wll and W22 h a v e no pole at )'0 (k0 is not simultaneously controllable a n d o b s e r v a b l e b y a s i n g l e s t a t i o n ) ,
makes t h a t ( 3 . 4 . 1 6 )
is u n c o n t r o l l a b l e .
system
unobservable.
If c o n d i t i o n
Of c o u r s e ,
(3.4.15)
holds
for W ' ( p ) ,
then
(3.4.16)
is
t h e a p p l i c a t i o n of f e e d b a c k at s t a t i o n 1 (u 1 = k 1 y l ) do
not c h a n g e t h i s s i t u a t i o n a n d , in b o t h c a s e s , ~0 is a f i x e d mode o f s y s t e m ( 3 . 4 . 1 3 ) . Note t h a t T h e o r e m 3.18 a g r e e s with t h e r e s u l t of Davison a n d O z g u n e r (DAV81) given in
T h e o r e m 3.16
for t h e c a s e
1 and
also with
the n e c e s s a r y
condition
e x p r e s s e d in Theorem 3.15. M o r e o v e r , t h i s p a r t i c u l a r c a s e is a p e r f e c t i l l u s t r a t i o n o f Theorem 2.5 ( C h a p t e r 2) (FES-80) t h a i s h o w s a f i r s t r e l a t i o n b e t w e e n t h e r e s u l t s of Corfmat a n d Morse ( C O R - 7 6 a , b ) a n d t h e c o n c e p t of f i x e d m o d e s . In t h e case f o r w h i c h ~0 is n o t a simple p o l e , t h e above r e s u l t can be e x t e n ded as follows :
98
Theorem
3.19
( A N D - 8 2 ) . X0 i s a d e c e n t r a l i z e d
o n l y if t h e o r d e r
of X0 a s a p o l e i n @ l l ( P ) ,
f i x e d mode of s y s t e m
W22(p)
(3.4.13)
if and
a n d W(p) is l e s s t h a n t h e order
it h a s as a p o l e in W12(P) o r W 2 1 ( P ) . In
this
case,
a
pole-zero
cancellation
also
occurs
in
the
transfer
function
(3.4.16).
3.4.4.b.
- General case : systems
multi-input Consider
multi-output
now a general system
W ( p ) as in ( 3 . 4 . 8 ) matrix fraction For (i 1 .
. . . .
a
with more than 2
stations
or,
equivalently,
description
matrix
M,
of W ( p ) ,
M Jl ""
ik) and the columns
(3.4.1)
described
by (3.4.11),
by a transfer
where
and the decentralized
Jk
denotes
the
function
s-l(p)T(p)
minor
matrix
is a l e f t coprime
c o n t r o l in ( 3 . 2 . 1 1 ) . of M f o r m e d
(Jl . . . . . j k ) of M. B y r e o r d e r i n g
of i n p u t s
by
the
rows
a n d out-puts,
t h e s y s t e m is p u t in t h e following f o r m :
W(p) =
I w~a (P)
wc~IS (P)
wsts
Wisct (p) W(p) : [ S c ( ( p ) Sis
(p) y i
i = a
(P) (3-t+-lS)
in t h e form •
g
(3.4.19)
A s s u m e t h a t rc~ ( r IS) is t h e n u m b e r Was
(3.4.17)
[Tc, (p) TIS (p) ]
a n d we a s s u m e c o n t r o l s t r u c t u r e s U. = K . Y . 1 1 1
1
o f r o w s a n d m cL ( m i s ) t h e n u m b e r
of c o l u m n s of
(p) (WISIS(p)),
The number
of z e r o s a t )~0 o f IY }l
Jk
#= 0
)~0 is n e i t h e r
]t ( 0
)~0 i s a pole o f o r d e r
l/=
t h e m i n o r is i d e n t i c a l l y
oo
is denoted
by with :
J
a pole nor a zero - # zero
We h a v e m = mc~ + mis a n d r = rc~ + r B " A m o n g t h e f i r s t rc~ r o w s , the number
Jk
of r o w s w h i c h do n o t b e l o n g to t h e c o n s i d e r e d
minor by :
let us define
99
I, ...
Or
dered minor by
first columns,
the number
consi-
Jk
denotes the number
of elements of the set
In t h i s f r a m e w o r k ,
Anderson
(S a (~0) T a ( ) , 0 ) )
and the fixed mode exists
(*).
(AND-82) showed the following result
The following two conditions
2 - there
to t h e
1[)1' ""' )k } n {1, ..., m~)JJ
: Jl
1 - rank
of columns which belong
:
@c
Theorem 3.20.
{I , .... r(, }II
i k } u { i 1 . . . . ,Jr_ k } = {1 . . . . . m }
and a m o n g t h e m a
*
i' i_k} n
Jk
I
w h e r e • {i 1 . . . . .
II { i' i .....
=
are equivalent
:
:
(3.4.20)
< r a
0 has degree
d (see Theorem 3.17)
d such that 0 < d < D and such that,
#
whenever
0r+0 c > r a
~/(d-D) ÷ (Or + Oc - r a )
(3.~.21)
Jl "'" Jk
for all m i n o r s o f W ( p ) ,
Remark
3.3.
The
certain minors
D is the degree
preceding
have
theorem
~0 a s a z e r o
o f XO i n t h e c h a r a c t e r i s t i c
states
polynomial
q~ ( p ) .
t h a t ~0 i s a f i x e d m o d e of d e g r e e
of certain
minimum order
or
as a pole
d if
of limited
m u l t i p l i c i t y , w h i l e ~0 i s a t t h e s a m e t i m e a p o l e o f W ( p ) . We r e c a l l t h a t are n o t in t h e the first m a 0c-r a
is
the number
scrutiny
and
o f r o w s a m o n g t h e f i r s t rc~
0c i n d i c a t e s
c o l u m n s w h i c h a r e in t h i s s a m e m i n o r .
associated
nonnegative,
@r i n d i c a t e s
minor under
the
which t h i s q u a n t i t y
with
minor
the is
position
constrained
is negative,
of the by
the
minor
the number
Therefore, in W ( p ) .
inequality
the quantity
@r +
When
0c-r a
(3.4.2).
the minor is not cons,reined.
rows which
of columns among
Or + In
the
case
is for
100
Example
3.7.
Consider
function matrix
2-station
the
system
described
by
the
following
transfer
: 1 p(p-l)
0
0
1 p-1
0
0
0
1 p-I
1 p-I
0
W(p) :
1 p-I
for which
dp ( p ) = p ( p - 1 ) 3 . -
The dotted
lines
denote
the partition
tralized control has the following structure
: ra
2 stations
and
0
u l ikll
0
0
k 24
UI3
0
0
0
k 34
=
We h a v e
in
the
associated
decen-
:
Vct
kl2 k3 0
= 3, r B = 1, m ct = 1, m B = 2 a n d D=3. T h e m i n o r s v e r i f i y i n g
Or+Oc ) 3 a r e t h e f o l l o w i n g
:
wI:] (:] f:] {: :1 {: :] wi: :]wE::] w[: :1 {: :] From theorem such that
/'t
3 . 2 0 , ~0=1 i s a f i x e d m o d e o f d e g r e e
:
[1] 1
=- 1 ~ ( d - 3 )
1t
[] l
=-1
d if a n d
~ (d-3)+l
only
if t h e r e
exists
d
101
#
#
E:] I 1
=-1 ~ (d-3)
#
=-I
~ (d-3)+l
2
= ~ ) (d-3)
4/
=-2
I:l
#
~ (d-3)
= ~
#
),. ((t-3),1
= ~ ~,, (d-3)
l
l
#
;-2 LI
These
~ (d-3)
#
2
twelve
1
inequalities
fixed m o d e of d e g r e e
Theorem
3.20
are
satisfied
in i t s g e n e r a l
3.21
d=l.
Therefore,X
0=1 i s a
decentralized
complex.
Therefore,
s i m p l e f o r m if we c o n s i d e r
it i s i n t e r e s -
the case for which
is easily obtained
from condi-
3.20 when d=D=l.
(AND-82).
(3.4.8)
for
The following result
Under
the
t h a t ~0 i s a s i m p l e z e r o o f • ( p ) . (3.4.1)
3
form is rather
X0 is a s i m p l e p o l e o f t h e s y s t e m .
Theorem
~ (d-3)
1.
ting to n o t e t h a t it t a k e s a p a r t i c u l a r tion 2 of t h e o r e m
=-2
if and
Then,
o n l y if t h e r e
s u c h t h a t W(p) o r W ' ( p ) a p p e a r s
same assumptions
as in Theorem
~fl i s a d e c e n t r a l i z e d
exists
a partition
3.20,
assume
fixed mode of system
of the system
a s in
(3.4.17)
in t h e f o l l o w i n g f o r m :
m s
r~
no entry
has a pole
X0 i s a s i m p l e z e r o o f t h e characteristic
a t X0
polynomial
of this block
(3.4.2z)
r~
every
entry
has a zero
no entry
a t X0
Example 3.8.
Consider
has a pole
a t X0
the same system
p u t in f o r m ( 3 . 4 . 1 7 )
taking
station
and 3 as the second,
W(p) is partitioned
a s in E x a m p l e 3 . 5 a n d 3 . 6 .
1 as the
first
aggregated
as follows :
station
If the system is and
stations
2
102 3
!
0
p+l p(p-2)
I . . . . . .
W(p)-
L.
I I
1
1
1
p+2 I ! )
l
p(p-2)
1
0
p+2
a n d it is c l e a r t h a t W ' ( p ) h a s t h e form i n T h e o r e m 3 . Z l w i t h ~0=-1.
Therefore,
we
f i n d a g a i n a s in E x a m p l e 3.6 t h a t k 0 = - I i s a f i x e d m o d e . Theorem
3.Zl
is
Davison and Ozguner
strictly
equivalent
(DAV-83)
to
(see § 3.4.2)
Theorem
t h e s y s t e m w h i c h l e a d to f o r m ( 3 . 4 . 2 2 ) d e d u c e d from t h e s t r u c t u r e s A0
W(p) -
which
was
derived
for the case of simple poles.
d i f f e r e n c e c o n s i s t s in t h e f a c t t h a t in T h e o r e m 3 . 1 6 , o f t h e s t a t i o n s in 2 a g g r e g a t e d
3.16
by
T h e only
all t h e p o s s i b l e p a r t i t i o n i n g s of
in T h e o r e m 3.21 a r e l i s t e d y r i t h o u t r e o r d e r i n g
stations.
T h e two a g g r e g a t e d
stations
c a n e a s i l y be
of t h e m a t r i c e s A 0 o r
as follows
:
P-~O * rows r a (rfl) at
X
(0)
or
P-}'O P=)~°
: rows of A0 (W(p) ---
rows
o f W(p)
-
P=~O (AO)
w h e r e t h e r e is a b l o c k s p e c i f i e d
where
there
is no
block
s p e c i f i e d at
0 (X).
* c o l u m n s ma
(m13)
: c o l u m n s o f A 0 (W(p) - - - - ~ 0
s p e c i f i e d at X (0) o r c o l u m n s o f W(p)
P=
w h e r e t h e r e is n o b l o c k
I ,>0
- A'-~'O01 ~ p:},o(AO) w h e r e t h e r e
is a b l o c k s p e c i -
fied at 0 ( X ) . Note also t h a t
t h e two d i a g o n a l b l o c k s
agree with the necessary
for w h i c h
no entry
has
a p o l e at ~0
c o n d i t i o n f o r k0 to b e a f i x e d mode in T h e o r e m 3.15 ( s e e §
3.4.1).
3.4.5.
- Interpretation I t is i n t e r e s t i n g
function
matrix
to n o t e t h a t i n t h e r e s u l t s
characterization
again the partitioning
of the
of fixed modes
system
obtained
(Theorems
in two a g g r e g a t e d
for the general
transfer
3.20
we find
stations
and
3.21),
which
was already
103 p r e s e n t in t h e s t a t e = s p a c e c h a r a c t e r i z a t i o n of A n d e r s o n a n d Clements (see § 3 . 3 . 1 , Theorem 3 . 7 ) . This s i t u a t i o n can
be
intuitively
controlled in a d e c e n t r a l i z e d w a y ,
interpreted
as
follows.
When a
s y s t e m is
a s t a t i o n i can t r a n s m i t some i n f o r m a t i o n to a
station j t h r o u g h the t r a n s f e r c h a n n e l C j ( p I - A ) - I B i = Wii(p)., A similar s c h e m e h o l d s for a set of s t a t i o n s to a n o t h e r . The lack of i n f o r m a t i o n at one s t a t i o n o r at one s e t of s t a t i o n s , which r e s u l t s from the d e c e n t r a l i z a t i o n c o n s t r a i n t (only local v a r i a b l e s a r e a v a i l a b l e ) , can t h e r e f o r e be c o m p e n s a t e d b y
the information t r a n s f e r t h r o u g h the t r a n s f e r
f u n c t i o n s of t h e
interconnectton t e r m s . Hence, f o r a S - s t a t i o n s y s t e m , if all t h e s u b s e t s of s t a t i o n s {il)...,ik}
c {1,...,S)
can t r a n s m i t some i n f o r m a t i o n to t h e i r c o m p l e m e n t a r y s u b s e t s
of s t a t i o n s { i k + l ) . . . , i S} a n d vice v e r s a ,
t h e i n f o r m a t i o n is s p r e a d e d among all t h e
stations of t h e s y s t e m a n d a d e c e n t r a l i z e d c o n t r o l will s u c c e e d e i t h e r f o r t h e s t a b i = lization t a s k or for t h e pole a s s i g n m e n t t a s k . As we a l r e a d y
saw,
the
information
transfer
can
be
prevented
by
special
parametric c o n f i g u r a t i o n s , which r e s u l t in t h e e x i s t e n c e of f i x e d m o d e s . It is also clear t h a t t h i s t r a n s f e r is i m p o s s i b l e if t h e t r a n s f e r f u n c t i o n b l o c k s c o r r e s p o n d i n g to the i n t e r c o n n e c t i o n s : C a (pI~l) -I B B = WaB (p) and C B (pl-A) -I B a
= WBa(p)
are identically z e r o . In o r d e r to i l l u s t r a t e t h i s r e m a r k ,
c o n s i d e r again t h e case of a s y s t e m with
two s i n g l e - i n p u t s i n g l e - o u p u t s t a t i o n s . We saw in P a r a g r a p h 3.4.4a t h a t if t h e f e e d back u 2 = k 2 Y2 is a p p l i e d a t s t a t i o n 2, t h e t r a n s f e r f u n c t i o n of t h e r e s u l t i n g s y s t e m is given b y ( 3 . 4 . 1 6 )
Yl Ul
:
k2 = WII + WI2
W21
I-W22 k2
Assume t h a t t h e pole of t h e s y s t e m k 0 is not s i m u l t a n e o u s l y c o n t r o l l a b l e and observable b y a s i n g l e s t a t i o n ( W l l ( p ) a n d W22(p) h a v e no pole at ~0) .
However, k0
is controllable a n d o b s e r v a b l e b y t h e global s y s t e m (W12(p) or W21(p) h a v e a pole at ~0' say W 1 2 ( p ) ) .
104 We saw in P a r a g r a p h 3 . 4 . 4 . a t h a t i f ~0 i s a z e r o of W21(P), t h e p o l e - z e r o cancellation in t h e p r o d u c t fixed mode.
W12. W21 l e a d s to t h e u n c o n t r o l l a b i l i t y of ( 3 . 4 . 1 6 )
Now, if W21(p) = 0, it i s o b v i o u s t h a t
system
(3.4.16)
: t 0 is 2
is also uncon-
t r o l l a b l e a n d t0 i s also a f i x e d m o d e .
In t h e l a s t c a s e
(W21(p) = 0), l 0 i s a f i x e d mode i n d e p e n d e n t l y of t h e para-
m e t e r v a l u e s : t h i s t y p e of f i x e d m o d e s is called a s t r u c t u r a l l y f i x e d m o d e . In t h e f i r s t c a s e (W21(p) # 0 ) , ~0 i s a f i x e d mode d e p e n d i n g of t h e parameter values : a non s t r u c t u r a l l y fixed mode.
If we c o n s i d e r now t h e s p e c i a l c a s e f o r w h i c h ~0 = 0, t h e c o n d i t i o n for k0 to b e a f i x e d mode is also m e t f o r g e n e r i c v a l u e s of t h e p a r a m e t e r s e v e n w h e n W21(p) # 0. T h e f i x e d m o d e s at t h e o r i g i n e m a y t h u s b e a p a r t i c u l a r c a s e of s t r u c t u r a l l y
fixed
m o d e s.
T h e e x t e n t i o n of t h e p r e c e d i n g d i s c u s s i o n to t h e c a s e of m u l t i - s t a t i o n systems is e a s i l y d e r i v e d . ~0 is a s t r u c t u r a l l y f i x e d mode if Wa8 (p) or WB~ (p) i s identically zero a n d t h e c o n d i t i o n s of T h e o r e m 3.20 the system) hold.
(or T h e o r e m 3.21 if ~0 i s a s i m p l e pole of
If A0 = 0, t h e c o n d i t i o n s in T h e o r e m 3.20 a n d 3.21 m a y also hold
f o r g e n e r i c v a l u e s of t h e p a r a m e t e r s a n d A0 is also a s t r u c t u r a l l y
f i x e d mode in this
case.
T h e a n a l o g y w i t h t h e c a s e of c e n t r a l i z e d c o n t r o l b e c o m e s now m o r e p r e c i s e . As we s a w in C h a p t e r II,
f i x e d m o d e s a p p e a r a s an e x t e n t i o n of t h e c o n c e p t s of uncon-
t r o l l a b l e a n d u n o b s e r v a b l e m o d e s a n d it i s c l e a r t h a t s t r u c t u r a l l y blish
the
relation
1.3, C h a p t e r I).
with
structurally
uncontrollable
f i x e d m o d e s esta-
unobservable
modes
(see §
B o t h a r e d e f i n e d f o r g e n e r i c v a l u e s of t h e p a r a m e t e r s of t h e system
and are therefore structural properties. ral controllability and s t r u c t u r a l for s t r u c t u r a l l y
and
fixed modes.
A s i m i l a r s t u d y to t h e o n e made f o r s t r u c t u -
o b s e r v a b i l i t y in c h a p t e r
The next
paragraph
I can t h u s be
presents
the results
c a r r i e d out w h i c h have
b e e n o b t a i n e d on t h i s p u r p o s e .
3.5.
- STRUCTURALLY
3 . 5 . I.
FIXED
MODES
- Preliminaries
It h a s b e e n p o i n t e d o u t in t h e l a s t p a r a g r a p h from two d i s t i n c t s o u r c e s :
t h a t a f i x e d mode may originate
105 - a perfect
matching
nonzero parameters
can
in system
eliminate
parameters
the
(in t h i s c a s e ,
fixed mode)
a perturbation
: it is then
called
of the
a non
struc-
turally fixed mode, - the special
structure
however the nonzero
within the system
parameters
values
(in t h i s
are perturbed)
case the fixed mode remains = it i s t h e n
called a structu-
rally f i x e d m o d e . It w a s a l s o p o i n t e d o u t t h a t different origines,
though
structurally
- the lack of interconnections - the
fixed modes themselves
both are of a structural between
nature.
may have
They may result
the different
two
from :
stations,
special location of a mode at the origin.
The following example illustrates
Example 3 . 9 .
Consider
the following 2-station
0
1
0
1
1
0
0
0
1
C1 =
~0
o
l'l
C2 :
~1
o
ol
A =
which is globally
the above situations
controllable
BI=
system
l] 0
0
and
observable.
:
:
B2=
El
If a decentralized
control
law o f t h e
form :
u = K y
ol k2
is a p p l i e d to t h i s matrix :
system,
the resulting
closed-loop
system
has the following dynamic
106
I 0l
AK=A+BKC=
k2
and
d e t ( p I - A K) = ( p - l )
is independent
where
c
0
0
1
(p2-p-l-klk
010]
if o n e o f t h e n o n z e r o
1
1
0
0
0
I+E
is an arbitrary
2)
where
it a p p e a r s
that the eigenvalue
A0=I i s a d e c e n t r a l i z e d
entries
small constant,
d e t ( p I - A K) = p ( p - 1 ) ( p - ] and
k1
of k I a n d k 2. T h e r e f o r e ~
However,
A =
1 I
in A i s s l i g h t l y p e r t u r b e d
we h a v e
a t ~0=1
fixed mode. a s follows :
:
e)-(p-l-c)-klk2(P-1)
t h e f i x e d m o d e d o e s n o t e x i s t a n y m o r e : t h e f i x e d m o d e at ~0=1 w a s t h e r e f o r e
non structurally
Consider
n o w t h a t t h e d y n a m i c m a t r i x of t h e s y s t e m i s g i v e n b y
A =
such that
fixed mode.
: det
L! ' °l 0
0
0
0
( p I - A K) = p ( p 2 - 1 - k l k 2 ) .
In this case, of any perturbation Consider
:
the system
h a s a f i x e d m o d e a t )~0=0 w h i c h will r e m a i n r e g a r d l e s s
of the non zero elements of the matrices
also the following system
:
[ 00] [1 0
c~=[l
-1
oo3
[°]
0
~-=Eo 2
A,B1,B2,C 1 and
1
,
l-I
C 2.
a
107 We have : det (pl-kK)* = p(p-l-kl)(P+l-k 2) and the system (B~I,B2,A~*,CI,C 2 ) ** has also a fixed mode at k 0=0 which will remain however the nonzero elements of the are perturbed.
matrices
Neverthless, in the two above cases, the origin of the
structurally fixed mode at 10=0 is not the same. This appears clearly in the associated t r a n s f e r f u n c t i o n m a t r i c e s . Case 1 :
I wj(p)
System {BI,B2,A~,CI,C2~
I p-l
:
1 _
P
l
I I
0
I I" I I
p+l
I
1
It is now c l e a r t h a t t h e f i x e d mode at A0=0 a r i s e s from t h e lack of t h e i n t e r connection t e r m b e t w e e n station~ 1 a n d 2 w h i c h is s h o w n b y C ; ( p I - A * ) - I B ~ --- 0 in Wl(p). In t h i s c a s e , k0=0 will b e called a s t r u c t u r a l l y f i x e d mode of t y p e ( i ) .
Case 2
:
W2(p)
System ( B 1 , B 2 , A , C 1 , C 2 )
=
[
0
(p+P1)(p-1)
1
0
In W2(P), n o n e of t h e i n t e r c o n n e c t i o n t e r m s b e t w e e n the s t a t i o n s a r e m i s s i n g . The fixed mode at k0=0 a r i s e s from i t s s p e c i a l location at t h e o r i g i n t h a t r e s u l t s in a pole-zero cancellation a t k0=0 b e t w e e n t h e i n t e r c o n n e c t i o n t e r m s . This f i x e d mode is called a s t r u c t u r a l l y fixe mode of t y p e (ii). In b o t h c a s e s , it is c l e a r t h a t no p e r t u r b a t i o n of t h e n o n z e r o e n t r i e s in t h e matrices can c h a n g e t h e s i t u a t i o n . mode in c a s e parameter,
1 and
N e v e r t h e l e s s , t h e d i f f e r e n t o r i g i n s of t h e f i x e d
2 can be s i g n i f i c a n t l y s h o w n b y a f f e c t i n g a value
which r e s u l t s
in
to a zero
s h i f t i n g t h e pole ~0=0 w i t h o u t a f f e c t i n g the i n t e r e o n -
nection s t r u c t u r e of t h e s y s t e m s •
Case I :
108
10o] 0
2
0
0
0
-1
Case 2 :
The pole at the origin is now replaced
[0101 1
0
0
0
0
2
b y a p o l e a t Xl=2. I n c a s e 1, w e h a v e n o w :
p-I
Wl(p) =
where
nothing
turally
°1
I__
IF_
(p-2)
p+l
is c h a n g e d
with respect
f i x e d m o d e a t 40=0 i s r e p l a c e d
ting that the origin of the structurally On the contrary,
to t h e z e r o i n t e r c o n n e c t i o n by a structurally
term.
The struc-
fixed mode at ~ I=2,
reflec-
fixed mode is a lack of interconnections.
i n c a s e 2~ we h a v e
:
p-2
W2(p) = P
0
(p-2)(p- i )
where
the pole-zero
no fixed mode.
cancellation
Therefore,
in
a t ~0---0 i s n o l o n g e r
case
2,
the origin
possible
of the
; i.e.
the system
fixed mode was its
has
special
location at the origin. The
next
paragraphe
modes can be characterized Refering not understand consider
will
show
in d i f f e r e n t
to t h e a b o v e
discussion,
that
these
two
types
of
we w o u l d l i k e to p o i n t o u t t h a t
t h a t all f i x e d m o d e s a t t h e o r i g i n a r e o f a s t r u c t u r a l
the following system
:
structuralIy
fixed
ways. one
nature.
should Indeed,
[1]
109
0 0 0
A=
0 0 1 a22 0 0 2
c~:[0
i
13
c~:[J
0
01
where az2 i s a n a r b i t r a r y The transfer
g j :-
[° 1
0
-l
0
2
real paramater.
f u n c t i o n m a t r i x is g i v e n b y : P+2(l-a22)
P
where it is c l e a r t h a t t h e s y s t e m h a s a f i x e d mode at k0=0 i f a n d o n l y if a22 = 1 | t h e r e f o r e , in t h i s c a s e ~0=0 i s n o t a s t r u c t u r a l l y Note a l s o t h a t t h e l a c k o f i n t e r c o n n e c t i o n is n e c e s s a r y
for
a
fixed
mode
to b e
I n d e e d , c o n s i d e r t h e following s y s t e m
A =
fixed mode. t e r m s in t h e t r a n s f e r
structural
(of type
(i))
but
function matrix not
sufficient.
:
[010][ l
0
0
0
0
2
gl=
C! =
c2~ E,
-,
for which d e t ( p I - A K) The t r a n s f e r
, l =
(p-2)(p-2kl-1)(p-2kz+l).
~1=2 i s
f u n c t i o n m a t r i x o f t h i s s y s t e m is g i v e n b y :
therefore
a fixed mode.
110 2 p-I
0
l p'-2
2 p+l
W(p) :
which exibits a zero block. mode of t y p e cellation.
(i).
One could t h u s
t h i n k t h a t ~1=2 i s a s t r u c t u r a l l y
fixed
H o w e v e r , it m u s t b e n o t i f y t h a t t h e z e r o b l o c k r e s u l t s from a can-
Indeed,
if one
replaces,
for
example,
the
first
entry
in
B2 by
2,
the
transfer function matrix becomes :
2 p-I
1 p-I
w(p) :
which has
1
3
p-2
p+l
no m o r e z e r o b l o c k . ~ 1=2 i s no l o n g e r
a f i x e d mode s i n c e t h e r e
is no
a n d s u f f i c i e n t c o n d i t i o n s f o r a pole to b e a s t r u c t u r a l l y
fixed
p o s s i b l e c a n c e l l a t i o n in t h e p r o d u c t
l
p-2
The necessary
:
1
X
p-1
mode will b e p r e s e n t e d in t h e s u b s e q u e n t p a r a g r a p h s . As w a s p o i n t e d o u t in P a r a g r a p h
3.4.5,
f i x e d m o d e s a r e t h e e x t e n t i o n of the
c o n c e p t s of u n c o n t r o l l a b l e a n d u n o b s e r v a b l e m o d e s e x i s t i n g in c e n t r a l i z e d c o n t r o l and structurally
fixed modes establish the
relation with
structurally
u n c o n t r o l l a b l e and
u n o b s e r v a b l e m o d e s . T h e p r o p e r t i e s of c o n t r o l l a b i l i t y , o b s e r v a b i l i t y a n d t h e i r s t r u c tural
counterparts,
structural
controllability
and
structural
observability9
were
d e f i n e d in C h a p t e r I. In t h e d e c e n t r a l i z e d c o n t r o l c a s e , t h e s e p r o p e r t i e s w e r e s t a t e d a n d s t u d i e d i n (KOB-78)
(KOB-82) a n d
controllability and observability under
(MOM-83) w h i c h i n t r o d u c e d t h e c o n c e p t s of decentralized information structure
a n d their
structural counterparts. T h e s e p r o p e r t i e s a r e p r e s e n t e d in t h e n e x t p a r a g r a p h fixed modes appear e v e n more o b v i o u s .
clearly.
The analogy with the
a n d t h e i r r e l a t i o n s with
centralized
control
c a s e is then
111 Some o f t h e d e f i n i t i o n s ter I a n d t h e r e a d e r
used
in the following were already
will b e r e f e r e d
to it w h e n e v e r
3.5.2. - Controllability and observability decentralized
information structure
Consider
S-station
the
t h e form ( 3 . 2 . 4 )
system
Definition (3.2.4)
(3.2.2)
and
a decentralized
3.4.
The
system
structure
(3.2.2)
if there
which
i n t e r v a l of time T , i . e . , 3.5.
The
transfers
lability
system
to b e
defined in
et
al
under
under
appears
(3.2.2)
different
with t h e d i f f e r e n t
to
be
in
(MOM-83).
controllable
decentralized initial
is
if there
state
output x(0)
under
decentralized
feedback
to t h e
(KOB-82) information
information
from which
3.5.
glance,
said
Though
to
be
of the
origine
structurally
exists a structurally
decentralized
(KOB-78)
decentralized
Definition
said a
any
decentralized
importance at first
Definition 3 . 6 .
feedback
form
in a f i n i t e
x(T)=0.
1.3) w h i c h is c o n t r o l l a b l e u n d e r Kobayashi
is
exists
decentralized control structure
controllable
control
(3.2.11).
(3.2.11),
Definition
in C h a p -
under
T h e f o l l o w i n g d e f i n i t i o n w a s g i v e n b y Momen a n d E v a n s
information
introduced
it will b e n e c e s s a r y .
the
under
system
(see §
structure. provided
also
structure.
structure
defined
controllable
equivalent
in
the
in D e f i n i t i o n
differences
a definition
for
Nevertheless, sense 3.4
do n o t
of
and
seem
we will s e e t h a t t h e i r i n t e r p r e t a t i o n
the
a system control-
Kobayashi even to
from
be
et
al
which
of a major
is strongly
connected
types of fixed modes.
The
information s t r u c t u r e
system
(3.2.2)
is
said
to
be
controllable
(in t h e s e n s e o f K o b a y a h s i e t al) if t h e r e
under exists
decentralized a decentralized
control of t h e f o r m :
ui(t) = Fi Ii(t)
(i=1 . . . . .
S)
(3.5.1)
where I . ( t ) is t h e s e t o f a v a i l a b l e d a t a a t s t a t i o n i a t t i m e t : 1
Ii(t) = {yi(p), which t r a n s f e r s i . e . , x (T)=O.
ui(q), p ~ (0,t),
any initial state
x(O)
q ~ (0,t)) to t h e o r i g i n e
in a f i n i t e i n t e r v a l
o f time T ;
112 T h e d i f f e r e n c e b e t w e e n D e f i n i t i o n s 3.6 a n d 3 . 4 can b e f o u n d in t h e different types
of d e c e n t r a l i z e d
(3.2.4)
(3.2.11)
control
laws
which are
used.
Undeed,
the
h a s n o t t h e d e g r e e of freedom of t h e one in ( 3 . 5 . 1 ) .
under decentralized information structure more similar to s t r u c t u r a l
control
law in
Controllability
in t h e s e n s e of K o b a y a s h i et al i s , in fact,
controllability under
decentralized
information
structure
d e f i n e d in D e f i n i t i o n 3 . 5 . We will s e e t h a t t h e r e q u i r e d c o n d i t i o n s f o r a s y s t e m to h a v e t h i s p r o p e r t y are also of a s t r u c t u r a l
nature.
However,
a slight
difference
still r e m a i n s ,
b a s e d on t h e e x i s t e n c e of two d i f f e r e n t t y p e s of s t r u c t u r a l l y p o i n t e d o u t in P a r a g r a p h
3.5.2.a.
which is
fixed modes,
as was
3 . 4 . 5 a n d Example 3 . 9 .
- K o b a y a s h i e t al. a p p r o a c h (KOB-78) (KOB-82)
T h e a p p r o a c h of K o b a y a s h i e t al. is b a s e d on t h e o b s e r v a t i o n t h a t ,
in decen-
t r a l i z e d c o n t r o l s y s t e m s , a c o n t r o l s t a t i o n can t r a n s m i t n e c e s s a r y i n f o r m a t i o n to other control stations
through
the
state
space
by
using
signaling
strategies.
That
is,
s t a t i o n j c a n t r a n s m i t i n f o r m a t i o n to s t a t i o n i if ( a n d o n l y if) C i ( P I - A ) - I B ] = #0. In t h i s c a s e , s t a t i o n j can e n l a r g e i t s c o n t r o l l a b l e s u b s p a c e b y s e n d i n g information
to s t a t i o n
i and
station
i can e n l a r g e
its observable
i n f o r m a t i o n from s t a t i o n j . K o b a y a h s i et al. r e p r e s e n t m a t r i c e s C~i a n d Bi,* ( i = l , . . . , S ) ,
subspaee
by
receiving
t h i s s i t u a t i o n b y d e f i n i n g the
which are interpreted
as t h e o b s e r v a t i o n a n d the
d r i v i n g m a t r i c e s of s t a t i o n i u n d e r t h e c o o p e r a t i o n of t h e o t h e r s t a t i o n s :
B~ : [Bi, Bjl . . . . . Bjk ]
if Cj(pI-A)-IBi f 0
~ j e {Jl' "" Jk"}
C.1 C C.~ =
if
Ci(PI-A)-lB j I 0
Vj ~ {ql ..... qv }
C' qv
T h e n t h e y d e v e l o p , t h e i r s t u d y b y a s s o c i a t i n g with t h e s y s t e m t h e same directed
graph
as
Corfmat
and
Morse
(COR-76a,b),
which
was
defined
in
Paragraph
2 . 2 . 3 b of C h a p e r I I . Like Corfmat a n d Morse, t h e y decompose t h e s y s t e m in s t r o n g l y connected subsystems. For a system (3.2.2)
with N s t r o n g l y c o n n e c t e d s u b s y s t e m s ,
t h e s t a t i o n s p u t t h e s y s t e m in t h e following form :
t h e r e o r d e r i n g of
113
~(t) =
A
x(t) + B1 ~1 (t) + "'" M BN ~N (t)
~i (t) = "Gi x ( t )
with
(i=l . . . . . N)
~i = [Bjl ' " "
B'i'i ]
6.. Rnxmi
~
=
Jl L
E R '
Ji
where i l , _ . . , i k areN the stations b e l o n g i n g to the s t r o n g component i. Note t h a t the matrices B. and
C, a r e composed of the
1
1
driving
,~,
and
o b s e r v a t i o n matrices of the
,~
station within the ith s t r o n g component. Bi and C i a r e also the d r i v i n g and o b s e r v a tion matrices of e v e r y station with in the s t r o n g component t u n d e r the cooperation of the remaining stations within this same s t r o n g component. The r e o r d e r e d t r a n s f e r function matrix of the system a p p e a r s t h u s in a b l o c k triangular form : N
w(p) :
I
WII
!
.~
I I
W21
N
W22
I i i _1
I l
2 WNI . . . . . . . .
r~ ....
IiWNN I
_
where ~..*] is the t r a n s f e r function matrix from the s t r o n g l y c o n n e c t e d s u b s y s t e m i to the strongly c o n n e c t e d s u b s y s t e m j. The s y s t e m p u t in the above form is called t h e q u o t i e n t s y s t e m . Kobayashi et el give then the following theorem : Theorem 5,2Z
(KOB-82).
information s t r u c t u r e
The
system
(3.2.2)
is controllable
(in the s e n s e of Kobayashi et a l . ,
0nly if the q u o t i e n t system has no d e c e n t r a l i z e d
under
decentralized
see Definition 3.6)
if and
fixed modes vrith r e s p e c t
to the
decentralized control law : U = ~ Y
= block-diag,
(K1 . . . . . KN )
Ki ~ Rmixri
(3.5.2)
(i=l . . . . .
The f i x e d modes of the q u o t i e n t system c o r r e s p o n d modes of t y p e
(i) of t h e
system
(3.2.2).
Indeed,
none
N)
to the s t r u c t u r a l l y partition
of the
fixed
quotient
114
s y s t e m can be f o u n d s u c h t h a t t h e i n t e r c o n n e e t i o n t e r m b e t w e e n t h e f i r s t aggregated station and
the
s e c o n d is n o t i d e n t i c a l l y z e r o .
As we saw in P a r a g r a p h
3.4.5, if
Theorem 3.20 is s a t i s f i e d in t h i s c a s e , t h e f i x e d modes a r e s t r u c t u r a l a n d a r i s e from t h e lack of i n t e r c o n n e c t i o n s . The n o n s t r u c t u r a l l y f i x e d modes a n d t h e structurally f i x e d modes of t y p e (it) of t h e s y s t e m ( 3 . 2 . 2 ) in ( 3 . 5 . 2 )
(if a n y ) a r e s e t a s i d e b y t h e fact that
t h e c o n t r o l law a s s o c i a t e d to each s t r o n g l y c o n n e c t e d s t a t i o n (which may
contain s e v e r a l s t a t i o n s of t h e s y s t e m ( 3 . 2 . 2 ) ) is c e n t r a l i z e d . This l e a d s to t h e following c o r o l l a r y : Corollary
3.6.
The
structure
(in t h e
system
(3.2.2)
is c o n t r o l l a b l e
s e n s e of K o b a y a s h i et a l . )
under
d e c e n t r a l i z e d information
if a n d only if it has no structurally
f i x e d modes of t y p e ( i ) . An
interesting
c o n s e q u e n c e is
that
a strongly
controllable u n d e r d e c e n t r a l i z e d i n f o r m a t i o n s t r u c t u r e
connected
s y s t e m is
always
(in t h e s e n s e of Kobayashi et
al) and c a n n o t h a v e s t r u c t u r a l l y f i x e d modes of t y p e ( i ) . If we e s t a b l i s h t h e c o n n e c t i o n with the r e s u l t s of Corfmat a n d
Morse (COR-
76a,b) p r e s e n t e d in P a r a g r a p h 2 . 2 . 3 b of C h a p t e r IIp t h e f i x e d modes can b e charact e r i z e d in t e r m s of t h e r e m n a n t polynomials of t h e c o m p l e m e n t a r y s u b s y s t e m s (see Definition 2 . 6 ,
C h a p e r II) and the r e s u l t s of Corfmat a n d Morse can b e r e s t a t e d in
t e r m s of f i x e d modes. Theorem 2.2 l e a d s to t h e following c o r o l l a r y : Corollary
3.7.
The
system
(3.2.2)
with
S stations,
controllable,
o b s e r v a b l e and
s t r o n g l y c o n n e c t e d can be s t a b i l i z e d b y a c o n t r o l law of t h e form =
u i ( t ) = Ki Yi(t) + v i ( t )
f
zj(t)
Sj z j ( t ) + Rj y j ( t )
vj(t)
Qj zj(t) + Nj y j ( t )
(i=l . . . . . S) j e (1 . . . . . S}
if a n d only if t h e s e t of f i x e d modes (which c a n n o t b e s t r u c t u r a l l y f i x e d modes of t y p e (i)) is s t a b l e . The a r b i t r a r y pole p l a c e m e n t is p o s s i b l e if a n d only if t h e s e t of f i x e d modes is e m p t y .
(Note t h a t t h e control law u s e s a dynamic c o n t r o l l e r only at
one s t a t i o n s i n c e s t r o n g l y c o n n e c t e d s y s t e m s w i t h o u t f i x e d modes can b e made controllable a n d o b s e r v a b l e b y a s i n g l e s t a t i o n u s i n g s t a t i c d e c e n t r a l i z e d f e e d b a c k ) , For t h i s s y s t e m , t h e s e t of d e c e n t r a l i z e d f i x e d modes
( i n c l u d i n g n o n struc-
t u r a l l y f i x e d modes a n d s t r u c t u r a l l y f i x e d modes of t y p e (it)) is c h a r a c t e r i z e d b y the f i x e d polynomial :
115 F(p) = l.c.m.
P ( G a , A,BI3 )
k=l,...,S-1 ~a = { i l . . . . . ik}C
~
= {1 . . . . . S}
If we c o n s i d e r now t h e g e n e r a l case of n o n s t r o n g l y c o n n e c t e d s y s t e m s , T h e o rem 2.3 can be r e s t a t e d as follows : Corollary 3.8. The c o n t r o l l a b l e a n d o b s e r v a b l e s y s t e m ( 3 . 2 . 2 ) can be s t a b i l i z e d u s i n g a dynamic d e c e n t r a l i z e d c o n t r o l of t h e form ( 2 . 2 . 6 ) modes ( s t r u c t u r a l l y a n d non s t r u c t u r a l l y )
if a n d only if t h e s e t of f i x e d
is s t a b l e . T h e a r b i t r a r y pole p l a c e m e n t is
possible if and only if t h e s e t of fixed modes is e m p t y . For t h i s s y s t e m ,
t h e s e t of s t r u c t u r a l l y
f i x e d modes of t y p e
(i) is g i v e n b y
the set of poles of t h e s y s t e m which a r e n o t pole of a n y s t r o n g l y c o n n e c t e d s u b s y s tem (fixed modes of t h e q u o t i e n t s y s t e m ) . T h e r e m a i n i n g f i x e d modes ( i n c l u d i n g non structurally f i x e d modes and s t r u c t u r a l l y fixed modes of t y p e (ii)) a r e g i v e n b y t h e union of t h e s e t s of f i x e d modes of e v e r y s t r o n g l y c o n n e c t e d s u b s y s t e m . For each strongly c o n n e c t e d s u b s y s t e m , t h e y can be c h a r a c t e r i z e d as follows :
Fi(P)
= l.c.m ~iac
P(~ia 'A , ~i~)-
h (~i,A,~i,R~nix~i )
1Ti ~i = {Jl . . . .
Ji }
The e q u i v a l e n c e b e t w e e n the r e s u l t s of Wang a n d 2.2.3.a,
Davison
(WAN-73)
C h a p t e r II) a n d t h o s e of Gorfmat a n d Morse is now clear.
(see §
Note t h a t
the
results of Corfmat a n d Morse a r e more complete s i n c e t h e y i n c l u d e t h e d i f f e r e n t i a t i o n between s t r u c t u r a l l y a n d non s t r u c t u r a l l y f i x e d m o d e s .
3.5.2.b. - Momen a n d Evans approach (MOM-83) The a p p r o a c h of Momen and E v a n s is p u r e l y s t r u c t u r a l .
The p r i n c i p l e remains
the same as in K o b a y a s h i e t al. a p p r o a c h s i n c e t h e i r r e s u l t s are also b a s e d on t h e determination of t h e e n l a r g e d s t r u c t u r a l l y
c o n t r o l l a b l e a n d o b s e r v a b l e s u b s p a c e s of
every station u n d e r t h e collaboration of t h e o t h e r o n e s . Let Li , (i=l . . . . . S) be t h e s t r u c t u r a l l y c o n t r o l l a b l e a n d o b s e r v a b l e s u b s p a c e of station i a n d L.* t h e e n l a r g e d s t r u c t u r a l l y c o n t r o l l a b l e a n d o b s e r v a b l e s u b s p a c e o f 1 station i u n d e r t h e c o o p e r a t i o n of t h e o t h e r s t a t i o n s . T h e n , we h a v e t h e following result :
116 Theorem 3,23
(MOM-83).
The system
decentralized information structure S u i-1
The condition
(3.2.2)
is s t r u c t u r a l l y
controllable under
L~ = R n
(3.5.3)
the
( s e e D e f i n i t i o n 3 . 5 ) if a n d o n l y if :
(3.5.3)
m e a n s t h a t t h e u n i o n of t h e e n l a r g e d s t r u c t u r a l l y
con-
t r o l l a b l e a n d o b s e r v a b l e s n b s p a c e s o v e r all t h e s t a t i o n s is e q u a l to t h e s t a t e s p a c e of the
system.
observable
Note
that
under
if
condition
decentralized
(3.5.3)
holds,
information
the
s y s t e m is a l s o s t r u c t u r a l l y
structure.
The
connection
with
fixed
m o d e s is t h e n made in t h e following t h e o r e m : T h e o r e m 5.24 vable) under
(MOM-83). T h e s y s t e m ( 3 . 2 . 2 )
is s t r u c t u r a l l y
decentralized information structure
controllable
(and obser-
i f a n d o n l y if it h a s no s t r u c t u r a l l y
fixed modes. Therefore,
Momen
decentralized structure
and
Evans
(MOM-83)
(see Definition 3.4)
define
a
controllable
system
m o d e s of a n y t y p e a n d e x t e n d t h i s r e s u l t in a s t r u c t u r a l
w a y in D e f i n i t i o n 3.5 a n d
T h e o r e m 3,24 (As w a s p o i n t e d o u t in t h e e x a m p l e s g i v e n in P a r a g r a p h s y s t e m with s t r u c t u r a l l y
under
as a s y s t e m without decentralized fixed 3.5.1,
for a
f i x e d m o d e s of t y p e (i) or ( i i ) , n o n e s t r u c t u r a l l y e q u i v a l e n t
s y s t e m without fixed modes can be f o u n d ) .
The
difference between
tion s t r u c t u r e
and
structural
controllability
s e n s e of K o b a y a s h i e t a l .
controllability under
under
decentralized
c a n be f o u n d i n t h e f a c t t h a t ,
rally fixed modes include both structurally Indeed,
the
d e t e r m i n a t i o n of t h e
structurally
s u b s p a c e s is b a s e d on t h e c o n d i t i o n s for s t r u c t u r a l ( s e e T h e o r e m s 1.6 a n d
1.7,
Chapter
I).
in T h e o r e m 3 . 2 4 ,
f i x e d m o d e s of t y p e
enlarged
decentralized informa-
information structure
in
(i) a n d of t y p e
controllable
and
the
structu(ii).
observable
controllability and observability
These conditions involve both reachability
conditions and generic rank conditions. The teachability conditions t u r n into c o n n e c tivity
conditions
strongly
in
the
connected and,
The generic rank
case
of
therefore,
decentralized
in d e c e n t r a l i z e d c o n t r o l ,
f i x e d m o d e s of t y p e Remember that subspaces
were
i.e.,
the
the
s y s t e m m u s t be
f i x e d m o d e s of t y p e
conditions take into account the particular
o r i g i n w h i c h m a y a l s o lead to s t r u c t u r a l way,
control :
it h a s no s t r u c t u r a l l y
u n c o n t r o l l a b i l i t y or u n o b s e r v a b i l i t y .
s y s t e m is a l s o r e q u i r e d
(i).
c a s e of a pole a t t h e By this
n o t to h a v e s t r u c t u r a l l y
(ii). in
Kobayashi et
determined using
al,
the
connectivity
enlarged
controllable
conditions only :
and
this
is
observable why
their
117 controllability under decentralized information structure to h a v e s t r u c t u r a l l y
only requires the system not
f i x e d m o d e s of t y p e ( i ) .
It is c l e a r now t h a t d e c e n t r a l i z e d f i x e d m o d e s c a n be d e f i n e d a s t h e m o d e s t h a t are
uncontrollable
under
the
decentralized control in the
decentralized form
(2.2.6).
information However,
structure
using
an i n t e r e s t i n g
a
dynamic
remark
c a n be
made. F r o m T h e o r e m 3.24 a n d C o r o l l a r y 3.6 a n d t h e D e f i n i t i o n s 3.5 a n d 3 . 6 , we c a n d e d u c e t h e following r e s u l t : Corollary 3.9.
Non s t r u c t u r a l l y
f i x e d m o d e s a n d s t r u c t u r a l l y f i x e d m o d e s of t y p e (ii)
are controllable u n d e r the d e c e n t r a l i z e d information s t r u c t u r e
using a dynamic time-
v a r y i n ~ d e c e n t r a l i z e d c o n t r o l l e r in t h e form ( 3 . 5 . 1 ) . Structurally information
f i x e d m o d e s of t y p e
structure
even
if
the
(i)
are not controllable
time-invarience
constraint
under on
the
decentralized decentralized
c o n t r o l is r e l a x e d . This point
will be d i s c u s s e d
a g a i n in C h a p t e r
t a t i o n of t h i s r e s u l t will b e p o i n t e d o u t . 3.9 e x p r e s s e s
IV a n d t h e p h y s i c a l i n t e r p r e -
It is i n t e r e s t i n g
to m e n t i o n t h a t
Corollary
a major d i f f e r e n c e w i t h r e s p e c t to t h e c a s e of c e n t r a l i z e d c o n t r o l s i n c e
uncontrollable and unobservable modes remain uncontrollable and unobservable
even
if a d y n a m i c t i m e - v a r y i n g c o n t r o l l e r i s u s e d .
A l t h o u g h t h e a b o v e s t u d y w a s c a r r i e d o u t in a d e c e n t r a l i z e d i n f o r m a t i o n s t r u c t u r e f r a m e w o r k , it is c l e a r t h a t t h e r e s u l t s
c a n be e x t e n d e d
to t h e g e n e r a l c a s e of
arbitrary constrained information structure.
3.5.2.c.
- P o t e n t i a l pole a s s i g n m e n t u s i n g d e c e n t r a l i z e d
static output feedback The issue
of c o n t r o l l a b i l i t y
information structure concepts
of
fixed
modes.
( a b s e n c e of s t r u c t u r a l l y potential paragraph using
a
pole
and
structural
controllability
under
decentralized
h a s b e e n d i s c u s s e d in t h e p r e c e d i n g s e c t i o n a n d r e l a t e d to t h e It
has
been
pointed
out
that
f i x e d m o d e s ) is t h e n e c e s s a r y
assignment
using
a
decentralized
structural
controllability
a n d s u f f i c i e n t c o n d i t i o n for
dynamic
controller.
The
present
g i v e s t h e n e c e s s a r y a n d s u f f i c i e n t c o n d i t i o n f o r p o t e n t i a l pole a s s i g n m e n t decentralized
static
controller.
Of c o u r s e ,
a s s u r e t h a t t h e s y s t e m h a s no s t r u c t u r a l l y
this
condition
is
sufficient
f i x e d m o d e s b u t it is n o t n e c e s s a r y .
to
The
a p p r o a c h of E v a n s a n d K r u s e (EVA-84) i s o r i g i n a l in t h e s e n s e t h a t it d o e s n o t r e f e r e x p l i c i t l y to t h e
c o n c e p t s of c o n t r o l l a b i l i t y ,
t h e y a r e implied in t h e final r e s u l t .
observability or fixed modes,
although
118
The r e s u l t is c a r r i e d out b y a g r a p h - t h e o r e t i c m e t h o d u s i n g t h e work of Mason (MAS-56) w h i c h e s t a b l i s h e s t h e r e l a t i o n b e t w e e n t h e s t r u c t u r e of t h e d i g r a p h a s s o c i a t e d to a s q u a r e m a t r i x and i t s c h a r a c t e r i s t i c polynomial. Consider a nxn s u c h t h a t V=
matrix
Vl,...,v n
M=(mij)i,j= 1 . . . . n"
One
defines
the
digraph
D=(V,E)
is a s e t of n v e r t i c e s a n d E is a s e t of e d g e s from V to
V . ( v i , v j) E E if a n d only if mji#0 in M. T h e w e i g h t mji is a s s o c i a t e d with t h e e d g e ( v i , v j ) . The c h a r a c t e r i s t i c polynomial of M is g i v e n b y : ¢ (p) = d e t ( p I - M ) = p n + a n _ l P
n-l+
...
+
alP+a 0
then, the coefficients a 0 , . . . , a n _ 1 are given by :
an_ 1 =
Z ()~)
an_ z =
z [~
a1
= E In
n-1
(x)]
(x)]
a0 = r [~ (x)] in which
~[~
(l)]
d e n o t e s t h e sum o v e r t h e c y c l e s of l e n g t h j (or p r o d u c t
of disjoint c y c l e s w h o s e sum of l e n g t h s is j) of t h e p r o d u c t s of t h e w e i g h t s a s s o ciated to t h e e d g e s i n v o l v e d in e a c h c y c l e . The c o m p l e t e a s s i g n m e n t of all r o o t s o f ¢ (p) to some s e t of a r b i t r a r y v a l u e s can only b e a c h i e v e d if n o n e of t h e c o e f f i c i e n t s a o , . . . , a n _ 1 is zero. Consider the system (3.2.1)
and t h e c o n t r o l law : U=KY
w h e r e K is t h e o u t p u t f e e d b a c k matrix with an a r b i t r a r y s p e c i f i e d s t r u c t u r e .
Then,
from t h e a b o v e r e s u l t , p o t e n t i a l pole a s s i g n m e n t can be a c h i e v e d if : 1-All t h e c o e f f i c i e n t s in t h e c h a r a c t e r i s t i c polynomial of (A+BKC) can be a s s i g n e d i n d e p e n d e n t l y b y t h e e x i s t i n g cycle g a i n s of t h e a s s o c i a t e d g r a p h . 2 - S u f f i c i e n t cycle g a i n s can be a s s i g n e d i n d e p e n d e n t l y b y t h e f e e d b a c k g a i n s in K. U s i n g t h e a b o v e d i s c u s s i o n , E v a n s a n d K r u s e r ( E V A - 8 4 ) p r o v i d e d t h e following result :
119
Let ( k 1 . . . . , k q }
b e t h e s e t of f e e d b a c k g a i n s in K a n d {L1, . . . . L c} b e t h e s e t
of e x i s t i n g c y c l e s in t h e g r a p h a s s o c i a t e d with ( A + B K C ) . Define .
an_ 1
.-.
a0
L1 MLa= L c
s u c h t h a t m L a ( i , j ) = l if a n d only if Li is of l e n g t h j o r a p p e a r in a p r o d u c t
of d i s -
joint c y c l e s w h o s e sum of l e n g t h s is j, a n d m L a ( i , j ) = 0 o t h e r w i s e . Define also '
L 1 ....
Lc
MKL= i kq where
rnKL(i,j)=l
if a n d
only
if
k i appears
in
the
gain
of
the
cycle
Lj,
and
mKL(i,j)~0 o t h e r w i s e . Then,
the necessary
a n d s u f f i c i e n t c o n d i t i o n for p o t e n t i a l p01e a s s i g n m e n t is
that :
gr[MKL
* MLa] = n
w h e r e * d e n o t e s t h e b o o l e a n p r o d u c t of two b i n a r y m a t r i c e s . This result provides an interesting test, test
determination,
feedback.
f o r p o t e n t i a l pole
in t h e form of a simple g e n e r i c r a n k
assignment
using
F o r t h e p r a c t i c a l i m p l e m e n t a t i o n of t h e t e s t ,
decentralized
static output
Evans and Kruser
(EVA-84)
p r o v i d e d a n APL r o u t i n e w h i c h g i v e s t h e list of e x i s t i n g c y c l e s in a d i g r a p h .
3 . 5 . 3 . - C h a r a c t e r i z a t i o n of s t r u c t u r a l l y
f i x e d modes
Similarly to t h e case of c e n t r a l i z e d c o n t r o l , t h e c h a r a c t e r i z a t i o n of s t r u c t u r a l l y fixed modes ( a n d t h e r e f o r e of s t r u c t u r a l structure)
controllability under constrained information
can be carried out either within a pure algebraic framework or within a
graph-theoretic framework.
120
3,5,3,a.
Algebraic approach
-
Using (LIN-74)
the
results
(SHI-76)
characterization T h e o r e m 3.25
obtained
(see
§ 1.3,
of structurally (SEZ-81a).
for
Chapter
structural
controllability
I),
and
Sezer
Siljak
and
observability
derived
the
following
fixed modes :
The system
(3.2.2)
with S stations has
structurally
fixed
m o d e s if a n d o n l y i f o n e o f t h e f o l l o w i n g c o n d i t i o n s h o l d s : i
-
exists
There
matrix P such that A1 1
A31
L
P'g =
. . . .
I 0
Ct
o B
il - T h e r e e x i s t s a
permutation
2 Bet
(3.5.~)
~a o n =
{1 . . . . .
S}
fixed modes of type
can never
such that
n
(i) a r e c h a r a c t e r i z e d of the system
b e p u t in t h e form ( 3 . 5 . 4 ) ) .
m a t r i x A22. T h i s s i t u a t i o n i s i l l u s t r a t e d f i x e d m o d e s o f t y p e ( i ) . It a p p e a r s from t h e a g g r e g a t e d structure
by condition
(of course,
(i) w h i c h
a strongly
They are the eigenvalues
by Figure 3.5.
x = ( x l , x 2 , x 3) w h e r e x 2 a r e t h e s t a t e s
of the block-triangular
:
0
e x i b i t s a n o b v i o u s lack o f c o n n e c t i v i t y
fer is possible
a
g
C
3 subvectors
and
]
[A 0]
gr
ted system
( ~ a u ~B ---7)
I
g
Structurally
S}
133 C~
A32 i A33
[c 1
CP=
{1 . . . . .
II 0 0 t. . . . . I i .422 ~ 0 . . . . .
CP=
~a c ~ =
:
..... A21
P'AP :
a
connecof t h e
T h e s t a t e v e c t o r i s s p l i t e d in
associated with the structurally
c l e a r l y in t h e f i g u r e t h a t n o n e i n f o r m a t i o n t r a n s station
a to t h e
o f t h e m a t r i x A.
aggregated
station
B because
121
/
\
\
/
F i g u r e 3.5 S t r u c t u r a l l y f i x e d modes of t y p e (ii) a r e c h a r a c t e r i z e d b y c o n d i t i o n (ii) which is t h e s t r u c t u r a l c o u n t e r p a r t of c o n d i t i o n ( 3 . 3 . 2 )
( C h a r a c t e r i z a t i o n of f i x e d modes of
A n d e r s o n and Clement. see § 3.3.1~ C h a p t e r II) for a pole at t h e o r i g i n e . Note t h a t
a structurally
condition ( 3 . 5 . 5 )
f i x e d mode o f t y p e
(i)
at the o r i g i n s a t i s f i e s also
b u t it a r i s e s from t h e lack of c o n n e c t i v i t y of t h e s y s t e m a n d r e -
mains u n c o n t r o l l a b l e u n d e r dynamic t i m e - v a r y i n g d e c e n t r a l i z e d c o n t r o l . C l e a r l y , t h e i n v e r s e is n o t
true ; i.e.
if t0=0 s a t i s f i e s
(3.5.5),
condition
(3.5.4)
is
not
ne-
c e s s a r i l y satisfied. The similarity with s t r u c t u r a l l y u n c o n t r o l l a b l e a n d u n o b s e r v a b l e m o d e s a p p e a r s clearly s i n c e , as we saw in C h a p t e r I, t h e y may a r i s e from t h e lack of r e a c h a b i l i t y or from t h e i r s p e c i a l location at t h e o r i g i n .
The c o n n e c t i v i t y condition ( 3 . 5 . 4 )
cor-
r e s p o n d s to t h e r e a c h a b i l i t y c o n d i t i o n s ( C o n d i t i o n s 1 a n d 2 of T h e o r e m s 1.6 a n d 1.7 in C h a p t e r I) rank
and
conditions
the
generic rank
( C o n d i t i o n s 3 and
condition
(3.5.5)
4 of T h e o r e m s
c o r r e s p o n d s to t h e
1.6 a n d
generic
1.7 in C h a p t e r
I).
Of
c o u r s e , in t h e case o f d e c e n t r a l i z e d c o n t r o l , we have only t h e c o n c e p t of f i x e d mode ( i n s t e a d of t h e two dual c o n c e p t s of u n c o n t r o l l a b l e a n d u n o b s e r v a b l e mode in c e n tralized control) peration
since the
of s e v e r a l
stations
c o n t r o l l a b i l i t y of a mode is a c h i e v e d t h r o u g h by
using
the
feedback
from some o u t p u t
the
coo-
stations
in
which t h e o b s e r v a b i l i t y c o n c e p t is a l r e a d y i n v o l v e d . Note t h a t Theorem 3.25 can b e g e n e r a l i z e d to a r b i t r a r i l y c o n s t r a i n e d c o n t r o l : in t h i s c a s e , 3.3, § 3.3.1).
t h e s e t s nc~ a n d ~
are
replaced by
the
sets I and J
(see Definition
122
3.5.3.b.
-
Graph-Theoretic
approach
Similarly to t h e c a s e of c e n t r a l i z e d c o n t r o l , t h e c o n d i t i o n s f o r s t r u c t u r a l c o n trollability
under
decentralized information s t r u c t u r e
theoretic framework.
Several characterizations exist,
can
he
derived
d e p e n d i n g on t h e
in a g r a p h graph
that
one a s s o c i a t e s to t h e s y s t e m . The one w h i c h is p r e s e n t e d f i r s t is t h e e x a c t g r a p h i c a l c o u n t e r p a r t of t h e a l g r e b r a i e c h a r a c t e r i z a t i o n g i v e n in P a r a g r a p h 3 . 5 . 3 a .
1 - U s i n g t h e g r a p h of t h e c l o s e d - l o o p s y s t e m Given t h e s y s t e m ( 3 . 2 . l ) , U = {u 1 . . . . . ur~
vertices and Y = { y l , . . . , y r t h a t ( u i , xj)
one a s s o c i a t e s a d i g r a p h
is the set of input v e r t i c e s , }
r = ( u U X u Y, E), w h e r e
X = {x 1 . . . . . x }
is t h e s e t of s t a t e
t h e s e t of o u t p u t v e r t i c e s . E i s t h e s e t of e d g e s s u c h
E if a n d only if bji~0 in B , ( x i, xj) ~ E i f a n d only if aji ¢0 in A and
(xi,Yj) ~ E if a n d only if cji~t0 in C. Note t h a t t h i s d i g r a p h is t h e same as t h e one d e f i n e d in P a r a g r a p h
1.3.1.b
( C h a p t e r I) for the s t u d y of s t r u c t u r a l c o n t r o l l a b i l i t y
a n d o b s e r v a b i l i t y in a g r a p h i c a l f r a m e w o r k . N e v e r t h e l e s s , in o u r p r e s e n t s t u d y ,
we
add a s e t of e d g e s EK from Y to U which r e p r e s e n t s t h e p a r t i c u l a r s t r u c t u r e of t h e control.
(Yl'Uj) g E K i f a n d only if kji¢0 in t h e
a s s o c i a t e d to t h e s y s t e m a n d t h e c o n t r o l s t r u c t u r e
f e e d b a c k m a t r i x K.
The
digraph
is t h e r e f o r e I~K= (U u X u Y , E u
EK) • In t h i s g r a p h i c a l f r a m e w o r k , t h e following g r a p h i c a l c h a r a c t e r i z a t i o n of s t r u c t u r a l l y f i x e d modes was p r o v i d e d i n d e p e n d e n t l y b y L i n n e m a n n (LIE-83) a n d b y Pichai e t al. (PIC-84)
:
Theorem 3.26.
The s y s t e m ( 3 . 2 . 1 )
the arbitrarily
s t r u c t u r a l l y c o n s t r a i n e d control
h a s no s t r u c t u r a l l y (3.3.4)
f i x e d modes w i t h r e s p e c t to if a n d only if b o t h of t h e
following two c o n d i t i o n s hold : i - e a c h s t a t e v e r t e x x k c X is i n v o l v e d in a s t r o n g c o m p o n e n t of FK which i n c l u d e s an e d g e from EK. ii - t h e r e e x i s t s a s e t of d i s j o i n t c y c l e s t . k = ( V k , E k ) , ( k = l , . . , , c ) that
in FK
•
c
Xc (i.e.,
u Vk k=l
t h e whole s t a t e v e r t i c e s s e t is s p a n n e d b y a d i s j o i n t u n i o n of c y c l e s ) .
such
123
Condition condition (ii)
(i)
corresponds
to t h e
to t h o s e s of t y p e
(ii).
structurally
Obviously,
fixed
condition
e q u i v a l e n t to c o n d i t i o n (i) i n T h e o r e m 3.25 a n d F i g u r e c o r r e s p o n d i n g to x 2 a r e
not
modes of
c o n t a i n e d in a s t r o n g
type
(i)
(i) in T h e o r e m
3.5 s h o w s t h a t
component including
and
3.26 is
the
states
feedback
e d g e s w h e n f e e d b a c k is allowed from Ya to Ua a n d from Y~3 and U 6. The e q u i v a l e n c e of c o n d i t i o n (ii) in Theorem 3.26 and c o n d i t i o n (ii) in Theorem 3.25 i s n o t so o b vious. The p r o o f can he f o u n d in ( P I C - 8 4 ) . Example 3 . 1 0 . C o n s i d e r t h e two following c a s e s a l r e a d y t r e a t e d in Example 3.9 : Case 1 :
l . . . . . m
=
0
l
o 2
i
I.._ . . . . .
0
,=EI
o
J- . . . . .
0
!
o
I
0
Bl:
|1. . . . .
~
I
52-
-I
o ]
T h i s s y s t e m a l r e a d y a p p e a r s in t h e form ( 3 . 5 . 4 )
with B a =
B1, BB = B2, C a =
C 1 and C~3 = C 2. So, c o n d i t i o n (i) of T h e o r e m 3.25 is s a t i s f i e d . T h e r e f o r e , ), 0--2 is a s t r u c t u r a l l y f i x e d mode of t y p e
( i ) . It is e a s y to v e r i f y t h a t condition (ii) of T h e o -
rem 3.25 d o e s n o t h o l d I i . e . ,
the s y s t e m has no s t r u c t u r a l l y
(ii).
f i x e d modes of t y p e
The same c o n c l u s i o n s can b e s t a t e d b y c o n s i d e r i n g t h e d i g r a p h a s s o c i a t e d to
this s y s t e m :
ul /
klJ
~
Yi
~2 Y2
w h e r e it a p p e a r s c l e a r l y t h a t t h e v e r t e x x 2 is n o t c o n t a i n e d in a s t r o n g c o m p o n e n t i n c l u d i n g a f e e d b a c k e d g e . H o w e v e r , t h e s t a t e v e r t i c e s s e t is s p a n n e d b y a d i s j o i n t union o f c y c l e s as it is s h o w n below :
124
(~)
Ul ~
Yl
@
¢)
Therefore, condition (i) of Theorem 3.26 is satisfied but not condition (ii). Case 2 : I
0 1 0
1 0 0
0 0 0
1
Cl= E 0
0
l
]
A=
]'I:ll
No permutation matrix can be found to put the system in the form (3.5.4) i i . e . , the system has no structurally fixed modes of type (i). Nevertheless, condition (ii) of Theorem 3.25 holds since :
gr
A
BI ] =2<3
C2
0
I
The digraph of this system is the following :
uI
Yl
Y2
125
We
find that condition
(ii) of Theorem
contains no disjoint union of cycles such
3.26 does not hold since the graph
that all the state vertices are involved.
Therefore, this system has a structurally fixed mode of type (ii) at the origin. 2-Using t h e g r a p h of the open-loop This
characterization
was
system
also p r o v i d e d
by
P i c h a i et al
(the
it was p r e s e n t e d
same
characterization)
before.
from t h e c o m p u t a t i o n a l p o i n t of v i e w , it is m u c h
It will a p p e a r c l e a r l y t h a t ,
but
(PIG-83)
a u t h o r s as t h o s e of t h e p r e c e d i n g
one y e a r
l e s s i n t e r e s t i n g t h a n t h e p r e c e d i n g o n e . I n d e e d , it c o n s i s t s of a t e s t t h a t h a s to b e a p p l i e d to all t h e 2S-2 c o m p l e m e n t a r y s u b s y s t e m s of t h e s y s t e m while t h e c h a r a c t e r i z a t i o n g i v e n b e f o r e is s t a t e d in t e r m s of t h e whole s y s t e m . s e n t s t h e i n t e r e s t of c h a r a c t e r i z i n g b o t h s t r u c t u r a l l y
Nevertheless,
fixed modes of t y p e
it p r e -
(i) a n d of
t y p e (ii) in a s i n g l e t e s t . T h e d i g r a p h a s s o c i a t e d to t h e s y s t e m ( 3 . 2 . 1 ) is t h e s a m e as in t h e p r e c e d i n g p a r a g r a p h
For a given d i g r a p h ,
:
r=(uu
described by the triple
(C,A,B)
x u Y, E ) .
t h e foIlowing s p e c i a l s u b g r a p h s
are first defined :
Definition 3 . 7 ( P I C - 8 3 a )
Input
Stem : A p a t h
from a n i n p u t
vertex
(the root)
to a s t a t e v e r t e x
(the
to a n o u t p u t v e r t e x
(the
tip), or a single i n p u t v e r t e x . O u t p u t Stem : A p a t h from a s t a t e v e r t e x
(the root)
t i p ) , or a s i n g l e o u t p u t v e r t e x . Input-Output
Stem : A p a t h from a n i n p u t v e r t e x to a n o u t p u t v e r t e x .
S t a t e Stem : A p a t h b e t w e e n two s t a t e v e r t i c e s , o r a s i n g l e s t a t e v e r t e x . Cycle : Already defined (see § 1.3.1b,
Chapter I).
I n p u t c a c t u s : An i n p u t s t e m w i t h at l e a s t o n e s t a t e v e r t e x . tip of t h e i n p u t
s t e m a r e also t h e r o o t a n d
The root and the
t h e tip of t h e i n p u t c a c t u s .
An i n p u t
c a c t u s c o n n e c t e d to a c y c l e from a n y p o i n t o t h e r t h a n t h e t i p is a l s o an i n p u t c a c tus. O u t p u t C a c t u s : Similar d e f i n i t i o n to a n i n p u t c a c t u s . C h a i n : A g r o u p of d i s j o i n t c y c l e s c o n n e c t e d to e a c h o t h e r in s e q u e n c e ,
or a
single cycle. L i n k ~ An i n p u t s t e m c o n n e c t e d to t h e f i r s t c y c l e of a c h a i n other than the tip),
(from a n y p o i n t
t h e l a s t c y c l e of w h i c h is c o n n e c t e d to an o u t p u t
any point other than the root).
These special subgraphs
a r e i l l u s t r a t e d i n F i g u r e 3.6 :
stem
(from
126
(I) input stem
*--~---e---D,--*---~--O (2) output stem
(3) input=output stem
(4) state stem
© (5) cycle
(7) output cactus
(6) input cactus
(8) chain
(9) Link F i g u r e 3.6
A g e n e r a l i z e d c a c t u s is t h e n d e f i n e d as follows Definition
3.8
(PIC-83a).
Each
of t h e
following d i g r a p h s
is
called
a
generalized
cactus : - Disjoint u n i o n of one or more i n p u t - o u t p u t
s t e m s p l u s t h e same n u m b e r of
s t a t e s t e m s p l u s some (or n o n e ) c y c l e s , i n p u t s t e m s , o u t p u t s t e m s . -Disjoint
u n i o n o f a link with some
(or n o n e )
cycles, input
stems,
output
stems. - Disjoint u n i o n of i n p u t cacti and o u t p u t c a c t i . C o n s i d e r t h a t s y s t e m ( 3 . 2 . 1 ) is c o n t r o l l e d b y an a r b i t r a r i l y c o n s t r a i n e d c o n t r o l in
the
form
(3.3.4).
The
complementary
subsystems
( C j , A , B I)
r e s p e c t to ( 3 . 3 . 4 ) were d e f i n e d in Definition 3.3 ( P a r a g r a p h 3 . 3 . 1 ) .
of
(3.2.1)
with
127
Pichai e t al. (PIC-83) s t a t e d t h e following c h a r a c t e r i z a t i o n of s t r u c t u r a l l y f i x e d modes : Theorem 3.27.
The s y s t e m ( 3 . 2 . 1 )
the c o n t r o l law ( 3 . 3 . 4 )
h a s no s t r u c t u r a l l y
f i x e d modes with r e s p e c t to
if a n d only if e a c h d i g r a p h a s s o c i a t e d with a c o m p l e m e n t a r y
s y s t e m is s p a n n e d b y a g e n e r a l i z e d c a c t u s . Pichai e t aI.
(PIC-83a)
p r o v i d e d an algorithm to c h e c k w h e t h e r a d i g r a p h is
s p a n n e d b y a g e n e r a l i z e d c a c t u s , w h i c h i n v o l v e s only b i n a r y c o m p u t a t i o n s . T h e t e s t for t h e e x i s t e n c e of s t r u c t u r a l l y f i x e d modes r e q u i r e s to a p p l y t h i s algorithm to each "complementary s u b g r a p h " ,
i.e.
2S-2 times. This is d u e to t h e fact t h a t t h e s t r u c -
t u r e of t h e c o n t r o l is n o t i n v o l v e d in t h e g r a p h a s s o c i a t e d with t h e trarily
to t h e
case of t h e p r e c e d i n g
characterization),
system (con-
Consequently,
this charac-
t e r i z a t i o n r e q u i r e s an e n o r m o u s c o m p u t a t i o n a l t a s k .
3-Using t h e g e n e r i c r a n k of t h e p r o d u c t of s e v e r a l r e a l m a t r i c e s Recently,
Papadimitriou and
Tsitsiklis
(PAP-84) p r o v i d e d an i n t e r e s t i n g g r a -
phical r e s u l t to e v a l u a t e t h e g e n e r i c r a n k of t h e p r o d u c t of s e v e r a l r e a l m a t r i c e s . Its application to t h e d e t e r m i n a t i o n of s t r u c t u r a l l y f i x e d modes of t y p e
(ii) l e a d s to a
nice c o m p u t a t i o n a l a l g o r i t h m . Consider (i=l, . . . . k ) ,
the
sequence
of s t r u c t u r e d
matrices
(see
§ 1.3,
Chapter
I),
Mi,
a s s o c i a t e d to t h e s e q u e n c e of r e a l m a t r i c e s Mi & RPiXqi. We d e f i n e t h e
g r a p h G=(V,E) as follows : V = { v i : ( i = l . . . . . k ) , ( j = l . . . . . pi ) ; V~+l:
(j=l . . . . . qk+l)}
is a s e t of v e r t i c e s .
One v e r t e x is a s s o c i a t e d to e v e r y row of e v e r y matrix Mi, ( i = l , . . . , k ) .
The l a s t q k + l
v e r t i c e s a r e a s s o c i a t e d to t h e columns of t h e last m a t r i x Mk of t h e s e q u e n c e . T h e r e is an e d g e from t h e v e r t e x vlP to t h e v e r t e x viq+l if t h e ( p , q ) t h e n t r y of t h e matrix M. is n o n z e r o . 1
An i n f o r m a t i o n p a t h is d e f i n e d as a p a t h from a v e r t e x with s u b s c r i p t 1 to one with s u b s c r i p t k + l .
Two i n f o r m a t i o n p a t h s a r e s a i d to b e i n d e p e n d e n t if t h e y a r e
vertex-disjoint. T h e n , we h a v e t h e following r e s u l t : Theorem 3 . 2 7 b ( P A P - 8 4 ) . information p a t h s in G.
k gr[i~l
MiJ is e q u a l to t h e maximum n u m b e r of i n d e p e n d e n t
128
In o r d e r to a p p l y t h i s r e s u l t to t h e c h a r a c t e r i z a t i o n of s t r u c t u r a l l y f i x e d m o d e s of t y p e
(ii),
note that condition
(ii) in T h e o r e m 3.25 is e q u i v a l e n t to g r
n , w h e r e A, B, C a r e t h e s t r u c t u r e d
m a t r i c e s of s y s t e m ( 3 . 2 . 1 )
red matrix specifying the feedback information pattern.
(A+BKC) <
and K the structu-
Note m o r e o v e r t h a t (A+BKC)
can be r e w r i t t e n a s t h e p r o d u c t of t h r e e m a t r i c e s t
(A+BKC) with
:
= M I . M 2 . M 3
M 1 =
[I
B]
0
K
M2 =
I denotes the identity structured
173.5.6)
m a t r i x a n d 0 t h e n u l l m a t r i x of a p p r o p r i a t e d i m e n -
sion s.
T h e following c h a r a c t e r i z a t i o n of s t r u c t u r a l l y f i x e d m o d e s of t y p e (ii) r e s u l t s : T h e o r e m 3.28 with r e s p e c t
(PAP-84).
System (3.2.1)
to t h e f e e d b a c k p a t t e r n
information paths
in t h e
graph
h a s no s t r u c t u r a l l y specified by
associated
to
the
f i x e d m o d e s of t y p e
sequence
of s t r u c t u r e d
MI,M2,M 3 d e f i n e d in ( 3 . 5 . 6 ) is e q u a l to n . Example 3.11.
C o n s i d e r a g a i n t h e s a m e s y s t e m a s in t h e p r e c e d i n g e x a m p l e s :
0
1
0
1
0
0
0
0
0
=to
o
1]
0
0]
A =
C1
c211 and
K[kl0
BI=
(ii)
K i f a n d o n l y if t h e n u m b e r of
B2=
[°1 0
1
matrices
129
The s t r u c t u r e d matrix corresponding to
I
O X X
X 0 0
A+BKC is :
X 1 0 0
and can be written as the product M1.M2.M3 where :
[
o
X
L
0
0
0
0
0
0
0 0
X
0 ]
xoll
MI=0X
0 0 0 X
0
0
0
0
0 0
O0
LO0 0 0
0 0
X 0
M2~O0
J
0
x
0
0 0 X
x o
M3
L°xo
The graph associated with the sequence of matrices M1,M2,M3 is the following : l
[
v2
v3
2v
2
v
v# 3
V
l
~
5
__-- P~ v 3 ~ 5
--
v4
where there are only pairs of independent information paths