Professional Documents
Culture Documents
of Linear Systems
Summary-The objectives of this paper are to give a self-con- T h e exposition of the subject and the derivation of
tained presentation of the subject of controllability and observa- criteria and proofs are different from those i n [1]-[4],
bility (concepts due to Kalman) developed in a simple yet general
and simpler in the sense that abstract linear algebra is
and rigorous way; to introduce these conceptsin terms of the output
as well as in terms of the state; and to point out and illustrate some avoided; only elementary matrix manipulations, theno-
of the subtleties whichexist in the time-varying case. tions of a linear space, linear subspace, and linear inde-
pendence are essential. The differencesi n the definitions
INTRODI-CTION (commented on in footnotes) are differences i n approach
H E CONCEPTS of controllabilit!. andob- rather than content; they are motivated by the inten-
state- and output-controllability concepts whicharise where a(/, T j is the transition matrix. This equation
in the time-varping case are discussed. can be written in the more compact form
The concept of observability could be quickly dis-
missed, as is done in [1]- [3], by defining i t as the dual x(t) = xo((t) + JtotHr(f,T)U(T)dT (4
(in an abstract algebraic sense) of state-controllability.
All the results obtained for controllability then carry where xo(fj =a(!.f,,)x(fO)representsthehomogeneous
over to observability by a dualizing procedure. Here solution (the effect of the initial state x(/,,)).The output
an independent approach is taken and a counterpart to y is, from (2) and (~3j. given by
output-controllability is introduced.
If the plant contains pure time delays, or when the In his work on optimal control [ 8 ] one of the authors
order of the plant is much greater than the number of found it useful to introduce total controllability: A
output variables, it is desirable touse (5) as the starting plant is said to be totally (state- 07 output-) controllable if
point rather than (1) and ( 2 ) . The elements h L j ( t .7 ) of it is completely co~ztrollable on every interaal [to, ti]. IVhile
thematrix H Y ( t , T ) canbeinterpretedastheplants complete controllability is generally a necessary condi-
impulseresponsesfor t > ~ , obtainedexperimentally tion for the existence of a solution to a control problem
perhaps, and are assumed to be piecewise continuous in where t f is undefined,thestrongerproperty of total
t and T . Eq. (5) is more general than (4) in the sense controllability is neededwhenthecontrolprocess is
that it includes (4) as a special case by putting C(t) = I confined to fixed finite intervals. Total controllability
and D ( t ) = O ; thus results obtained fory carry over tox. wasfoundtobeanecessaryandsufficientcondition
The characterization of the plant in terms of the state for theuniqueness of the solution tocertainoptimal
is, however, more complete. I n fact, H,(t, T ) character- controlproblems [SI. Forthesamereason(toensure
izes onlythecontrollableandobservablepart of the the uniqueness of solution in certain cases) it was also
plant [SI. found meaningful in the case of multi-input plants to
Dqfinition 1: plant is saidtobrcompletelystate- distinguish between strong and weak controllabil-
controllable on [ t o . t i ] <f f o r g i v e n to a n d ti eachinitial ity. -4 plant is said to bestronglycontrollable (in the
state x ( t o ) in X c a n be transferred to any .final state x ( t r ) , ortotal,11state or outplttsense) if i t i s
ztsing some control u orer the closed inferaal [ t o , tr].? controllablebyeachcontrolvariableseparatelywhileall
The phrase some control u indicates that no con- others are zero; otherwise it is weakly controllable.
straints (e.g., in amplitude or energy) are placed on u.
For the purposes of this paper, the control variables are C K I T E R IFOR
. ~ COXTROLL;\BILITT:
assumed to be piecewise continuous functions of time. PI-RELY Dyx;a>rrc PLXSTS
The word completely emphasizes that the choice of First, purely d\-namic plants [those with D(t) EO in
the initial and final states in X is arbitrary. The de- (2) and ( S i ] w i l l be considered. Let
pendenceon a particularinterval [ t o , t j ] canbeelim-
inated by introducing the following definition :
Dqiinition 2 : -4 plant i s saidto be completelystate-
controllable if f o r a n y to eachinitialstate x ( t 0 ) can be
Eq. (5) then becomes
transferred to any jin.al state x(tr) in a .finite t i m e t f2 t o .
E x a m p l e 1: The simplest example of a plant which is
<>:
not completely controllable is shown in Fig. 1 where the
state x can be controlled onl\- along (or parallel to) the
line x1=x2, rather than in the \\-hole two-dimensional and the problem of moving t o y ( t f ) fromsolneinitial
conditions a t t = t o is converted to that of moving t o
yd(ti) from zero initial conditions. Clearly, the plant is
completely output-controllable on [to,ti] if and only if
U v
every point yd((ti)in the output space I can be reached
:i X>
from the origin, or in other words, if the region R ( t o , ti)
of all the points yd(t,) in ( 5 ) which can be reached from
theorigincoincideswiththewholespace I. Since
Fig. l--I plant which is not completely state-controllable, , is convex,3 in order to show that R ( t O ,t f )= Y,
R ( f Otr)
discussed in Example 1.
one has only to show that X ( t o . t.,) is not bounded in
an>- direction in 1, namel>-, that the scalar product of
state space. However this may not matter if one is in- yd(ti) with every fixed-length nonzero vector 2 (point-
terested only in the control of y. This motivates the ing in every direction in k-) can be made as large as de-
definition of output-controllabilit\-.! (Of course,the siredb\.somechoice of u [lo]. T o shou-this,scalar
modifiers state and output! can be dropped u-hen multipl\- ( 5 ) by 3, to obtain
the t>-peof controllabilitJ- is clear from the contest.)
Dejinition 3: -4plant i s said to be conlplrtcly o~tpllt-
controllable on [to, ti] .iffor given to and t f a n y f i n a l 02~tp11f
y ( t r ) can. be attained starting with arbitrary izitial colzdi-
tions i n the plant at t = t o .
3 set is convex if all the points of the line-segment joining every
pair of points in the set arealso in the set.R(to,tf.! is con-ex becauseif
the points y , ( f f )and y.(tf) i n R(f0,t f i are reached by the respective
In [1]-[4] rontplefe contmllabilit\. at to rather than on [t,t f ] controlsand uuI g (defined on [t,, tfl!, then any pointys(ff! on the line-
is defined. I t follows, holyever, that if a plant is notcompletely segmentjoininsthesepoints, n.hich is gi\.en by y 3 ( t j ) = a y l ( t f )
controllable a t some time to*, then it is not completely controllable + ! l - a ~ y ( t , ! . O ~ a l l , i s reached bl- ut=auli(l--a!u,.?hus,yJ(tf)
at a n y to>to*. is 111 R(t,. t,).
1964 Sarachik:
Controllability
Kreindler
and
Obsemability
and 131
If U(T)= kH,(t/, 7)h. where k is positive and H, is the By writing (S) in the form
transpose of H,, then (sj becomes
?b.yt,-) = K
Jot![H&, +.I. [H,(f/,+.Id% (9)
k
regions of the ( t , T ) plane. Observing t h a t f f , the end of
the interval [to, t j ] , appears as a parameter in conditions
i /- (10) and(12),one sees t h a t if a plant is completely
output-controllable on some [to, t l ] i t may not be com-
pletely output-controllable on a lofzger interval [ t o . tz],
t2>tl. Further, a plant is totally output-controllable if,
for every >.#O, H,(t? ~)j. does not vanish in the strip
I t - 7 ; < E for some E > O , because one cannot find then
an interval [to, t f ] of T where H,(tj, 7)?.=0 (see Example
I 2 below).
If H,(t, 7)3,#0 (for each 3.#0) on any region of the
Fig. 2-Illustration of the subspace I - J t p , t i ) controllable on [to, t,].
If 3.* x-iolates condition ( l O j , then only the points in the control- ( t , T ) plane, the plant is said to be (following LsSalle
lable subspace l . c ( t ~t,l, can be reached on [tt, tr]. [ l o ] ) oxtpzlf-proper, and if thesame is trueforeach
3,.hj(t,7 ) , j = 1, 2. . . . , r , the plant is :aid to be output-
The condition ( 1 0 ) expresses the linear independence of T h u s o u t p u t - p r o p e r a n dL i ~ u t p ~ t - n ~ r m a 1 7
therows of H,(tf. T j on [ t o , t i ] , and a necessaryand are stronger properties than total output-controllability
sufficient criterion for this is that the Gramian matrix and strong total output-controllability, respectively.
(see for instance [9]j E x a m p l e -7:Consider the plant shown in Fig. 3. One
finds t h a t
P(to, tf) A JtotfHU(fj7 T ) ~ i ( t f T, ) d T (11)
- +
output-normal
xeaklytctallv 4
xezklr cmpietely i f and only if (loa) holds, or equivalently. if a n d only if the
output-proper output-contrcilable -autprt-cor.trollable
G r a m i a n m a t r i x W(to,ti) is n o m f n g d a r . 5
Fig. 4--4 hierarchy of degrees of output-controllability for Substituting H,(t, 7)= C ( t ) H , ( t , 7 ) into (lo), one
time-varying plants.
sees that completestate-controllabilit? o n [ t o , t f ] i m p l i e s
conrplete ozltp~lt-controllabilityon [to. ti] if a n d o n l y if
in the proof to Theorem I11 below, if the conditions (10) C ( t f ) l # 0 for each a # 0 in 1; (14)
or (12) hold for some t f > t o , the?; hold for every t j > t o .
Thus <f a -fixedfinite-dimensional h e a r plant i s conz- that is, if and only if the 111 rows of C(t,) are linearly in-
pletely outpz~t-controlla.bleon some .interval, it is also com- dependent, which may or may not hold for some or all
pletely output-controllable, totally outpllt-controllable, and tj. In summarl;, complete or even total state-controllability
ozttpz4t-proper (or output-normal, if it i s strongly outpllt- is neither necessary (see Example1 ) nor szlficientfor com-
controllable). This conclusion is not correct it the fixed pleteoutpzlt-controllability on. a n y in.tertIa1. This conclu-
plantisnotfinite-dimensional.Forexample.a fixed sion is not altered for fixed plants. nor by the additional
finite-memory plant (H,(t) E O t > T ) . has a state space stipulation of complete or total observability because
which is not finite-dimensional. I t is evidently not out- the criteria for complete or total observability do not
put-normal but may be totally output-controllable. imply (14).
Theorem I is clearly valid for state-controllability as
well, simply by replacingH,(t, 7 ) with H z ( [ 7, ) . There is,
5 In [2! it is proved (in a different n-ay) that a plant is completely
however,animportant differencebetweenstate-and controllable if and only if W ( t 0 , t i ) is positive dehnite for all t o and
output-controllabilit?-. Supposeaplant is completel?- some t,>t~. However, sincea Gramianmatrix is allvays positive
semidefinite, nonsingulnrity of W(f,,f!) is equix-alent to its positive
state-controllable on [to, ti] but is not state-proper be- definiteness.
196$ Kreindler a n d Sarachik: Controllability and Obsenfability 133
PLANTS
KITH D I R E C T T R A K S M I S S I O N Premultiplying (19) by B andpostmultiplying by
T h e existence of directtransmissionfrominputto eAlCL, (19) becomes
output, i e . , D ( t ) $0 in (2), does not, of course, affect B[AfReAIC clAn-leAC +
.. +
cneArC]3.= 0. (20) +
state-controllability ; however, it always aids output-
controllability. For such plants Theorem is I to be modi- Since (dkjdtk)eA= AlkeA,and @(f) = eA*, (20) is seen
fied as follows: to be
T h e o r e m1 1 :T h ep l a n t (5) is completelyoutput-con-
trollable on [to, tf ] i,f and only if, f o r each 3,#0 dn dn-1
-HH,(f)3. 61 -H,(t)3.
dtn dtn-l
+ +
. * * c,Hv(t)3, = 0. (21) +
H,(t,, T ) X f 0 on t o I :7 5 ti a n d l o r D(tf)>.# O (15)
For the condition H,(t)h$O to hold on any interval, it
or eqz~ivalently, i f and only i f , t h e G r a m i a a m a t r i x is necessary and sufficient that at least oneof the initial
P(to, ti) + D(tj)o(li) (16) conditions for the differential (21) he nonzero, that is
where P(t0, ti) as defined in ( l l ) , is nonsingular. For com-
plete
(total) olttput-colzt~ollability, condition (15), or
eqz~ivalently(16), must hold f o r ez!ery t o and some (every) k = 0, 1, 2, . , It = 1. (22)
finite ti> to.
Proof: As in Theorem I , anecessaryandsuficient Sincethis is independent of the choice of ti, (15) is
condition for complete output-controllability on [to, t j ] equivalent to the requirement that for each 3.#0 in E,
is t h a t h . y ( t j ) in a t least one of the vectors
BAkCh ( k = 0, 1, . . , ?Z - l), DL
1Br
>..y(tj) =
s, X . H , ( f f ,T ) U ( T ) ~ T+ 3,. D ( t f ) u ( t f )
be nonzero. This condition can be put in the composite
matrix form
be unbounded, and it is easy to show (as in proof of
Theorem I) that for this (15) is necessary and sufficient. BC
Condition (15) can be written in the equivalent form
[H,(t,,
Jot T)).] . [Hyl(tj, 7 ) L ] d #
~ 0 and/or 3. # 0 for each 3. # 0 in I
B An- 1 C
[D(ti>LI. D(ti1L.3 # 0
which in turn is equivalent to which holds if and only if the m columns of this matrix
3..P(to, i,)L # 0 and/or 3..D(tf)D(ti)L # 0. (17) arelinearlyindependent,thatis, if andonly if (18)
is of rank m . Q.E.D.
XowI as is known, the Gramian matrices P(t0, t i ) and For complete state-controllability, the matrix in (18),
D(ti)D(t,) in (If) are positive semidefinite: hence, (17) with C = I (unit matrix) and D=O, must be of rank n.
is equivalent to Forfurtherdiscussion of the special case where A is
2.. [P(to, ti) + D(tf)D(tf)]>.f.0. assumed to have real and distinct characteristic values,
see[11].
Since this must hold for eachL#O the matrix (16) must
-4 ~ I E A S U R EOF COKTROLLABIL~TP
be
positive
definite, or equivalently5 nonsingular.
Q.E.D. Thematrix P(t0, t f ) definedin ( l l ) , anditsdeter-
Fortime-invariantplants,awell-knowncriterion minant, have the following interpretation. If the control
(e.g., [1]-[3] or [lo]) for complete state-controllability variables are constrained by
in terms of the fixed matrices A and B of (1) and (2) can
he generalized to include the matrices C and D.
Theorem 111: T h e plant (1) and ( 2 ) w i t h constant matri-
ces is completely outpzlt-controllable if and o n l y if the c o w - thenthe region R(to. ti) in Y of all thepoints yd((ti)
+
posite m x ( n l )7 m a t r i x which can be reached starting from the origin at t=fo
i
[CB CAB j C A ~ B
j ... j ~ ~ n i D]
- 1 ~ (18) can he shown [8] to he a hyperellipsoid described by
controllable on [ t o , ti]. Thus det P(t0, t f ) can serve a s a In summary, the following criterion has been proved:
measure of tke controllability of the plant o n [ t o , ti]. Some Theorem IT,: -4 plant is
completelyobsercable on
other measures were proposed in [ 3 ] . [ t o , ti] if a n d only i f (25) holds, or equiaalenfly, if and
only if t h e G r a m i a n m a t r i x (30) is nonsingular. For com-
DEFINITION ASD CRITERIA FOR OBSERX-*ABILITY plrfe (total) obserra.bility, the above must hold for every t o
Thesolution of the unforced plantequations, i.e., and some (every) .finite t,>to.
u(t)=O in (1) and (2), in terms of the state x and out- The set of all 2,s whichviolate (27) fornls a linear
p u t y , is given b y subspace in X ? denoted b?; X u o ( t otvj ) . The existence of
X U 0 ( t 0 ti)
, implies therefore that y ( t ) SO on [ t o , t f ] for
xto)x(fo)
( t ) = @(t, ( 2 5 ) all x ( t o ) in X u o ( f O
ti),, that is, the plant is not completely
y ( f )= C ( t ) x ( t ) = C ( f ) @ ( f ,o ) x ( t o ) . ( 2 6) observable on [to. tj].
Every x ( t o ) canbeuniquelydecomposedintotwo
The initial state x ( t o ) might have been caused by con- vector-components
trol inputs or disturbances prior to to.
DeJinition 4: A n unforced plant is said to be completely
observable o n [to, t,] i f f o r g i v e n t o a n d t, eaery state x(t0) such that x,,(to) is in X,,(to, tr) and x,b(tO) is orthogonal
in X c a n bedeterminedfromtheknowledge of y ( t ) on t o X,(to. t,) (see Fig. 5 ) . The vector-component xob(tO)
[to, ti]. I f theabove i s true for every to and some $finite of x ( t o ) can be determined from y ( t ) on [ t o , t r ] by replac-
tf>to, then the plant i s said simply to becompletelyob- ing M-1 in (29) with the generalized inverse M i (see Ap-
servable. If the above is true for every to and every tf>to, pendix). X plant which is not completely observable can
the plant is said to be totally observable. be termed unobservablein the sense that the truex(t0)
From (26) it is evident that a necessarycondition can never be determined bJ- knon-ing the output y(t),
for complete observability on [ t o , f,] is that the columns f > _ t o ; onlythecomponent xob(tO)canbedetermined.
of C ( t ) @ ( t . t o ) be linearly independent on [ t u , f,]; other- Even if x(to) = xob(tO),i.e.. x , , ( f o ) =0, there is no way of
wise, thereexists a state x(t0) suchthat y ( f )G O on knou-ing this from the output alone and x ( f o )cannot be
[ t o , t,]. This condition of linear independence, expressed considered observable.
mathematically by
C ( t ) @ ( t , t o ) A$ 0 on to 5 t 5 f f for each h # 0 in X r(27)
(26) b y @ ( f ,t o ) C(t)
is also a sufficient one. Premultiplying i
and integrating on [to, t i ] gives
Hence
x(fd = M-(to, tr)n(fo,t i ) ( 2 9) Fig. 5-Illustration of the subspace unobservable on [to, tfl and the
decomposition of ~ ( 1 0 ) . If h* violates condition ( 2 i ) , then only
the vector component &*(to) of x(t,) affects y ( t ) o n [to,t,].
where
, b JOtaf(f,
M ( f o ti) t o ) C ( f ) C ( f ) @ ( f f, o ) d t (30) In light of the foregoing, it is noted that Definition 4
is equivalent to the following definition:
and De-jinition 4a: d n unforced plant is completely obserua-
ble on [to, t,] i j f o r given t o and t, there i s no initial state
t,) = @(/, to)C(t)y(t)dt. i l z X a t t i m e t = t o s u c h t h a t y ( t )=O on [ t o , t f ] . T h eplant
n(f0,
* Jot (3 1) is completely observable i f f o r a n yt o there i s n o initial state
s u c h t h a t y ( t ) E O for all t>to. The plant i s totally ob-
The matrix M ( t o , t f ) , defined in ( 3 0 ) ?isrecognized as seroable if there is no initial state at any time szich that
the Gramian matrix of the columns of C ( t ) @ ( t , t o ) and y ( t ) = O o n a (nonzero) time-inferzal.
is nonsingular if and only if these columns are linearly For plants with fixed matrices in (1) and (2), t o can
independentontheinterval [to,t,]. Thereforewhen be chosen zero and condition ( 5 ) becomes
M ( t o , t i ) is nonsingular, ever?- x(t0) can be determined
from y ( t ) using (29). c@(f)h0 on 0 5 t 4 tf for each 2. # 0 in X
I966 Kreindler and Sarach.ik: Controllability a n d Obsemability 135
andsimilarlytothe proof in Theorem I11 itcanbe plant is output-predictable on [fo, t i ] if and only if
shown that this is equivalent to the condition that the C ( t ) @ ( t ,to)). = 0
composite n X n m matrix
[C \ AC j ... for all t > to, for all A # 0 in Xuo(to,ti). (35)
Ab-1)C I (33)
In particular, since for a fixed plant Xuo(to,ti) is inde-
is of rank n. Since (33) is independent of ti. i t follows pendent of t o and ti, it follows that afixed p l a n t i salways
t h a t i f a plafzt with $xed matrices in (1) an.d ( 2 ) i s C O W output-predictable o n every interval.i
pletely observablc on some interval .it i s totally observable; In summary, given y ( t ) on [ t o , if] and provided (35)
a necessary and szlficient condition f o r this is that (33) holds, y ( t ) for all t>_io is given by
holds.
y(t) = C(t)@(f,to)M+(to,
tr)n(to, ti), t 2 io (36)
RELATIOWBETKEENOBSERVXBILITI.
AND CONTROLLABILITY
where Mi(to.ti) is the generalized inverse of I M ( t 0 , ti) in
(30) (see Xppendix), and n(t0, t,) is derived from y ( t ) on
The relation between observability and state-control- [to, ti] b y (31).
lability is formalized by the statement: a p l a n t i s c o m -
pletely (totally) obserzlable if and only if the adjoint plant CONCLUSION
i s co.mpletely (totally) state-con.trol1able. T h e t r u t h of this The concepts of controllability and observability dis-
statement is seen by simply writing out the criteria(27) cussed in this paper are of both theoretical and practical
or (30) for observability in terms of the corresponding significance.
matrices A*(t) = - A ( t ) , B*(t)= C(t), C*(t)=B(t), T h e linear independence conditions for controllability
and @ * ( t , 7)=@(T, t ) of the plant adjoint to (1) and and observability are of fundamental importance in a
(2), and observing that those criteria become the cor- multivariable analysis and keep arising in the modern
responding state-controllability criteria (loa) or (1l a ) , control literature, particularly as necessary conditions
respectively, given previously.6 for the existence of a solution. This justifies the creation
There is no meaningful dual of the concept of output- of new terms for ease of reference. A thorough under-
controllability; however, there is a meaningful counter- standing of the mathematical ramificationsof these con-
part. The concepts of controllability and observability ceptsenablesonetoformulate a theoreticalcontrol
in terms of the state are essential for the consideration problenl meaningfully and to make the needed assump-
of the regulator problem where one is concerned with tions attheoutset of theanalysis.Moreover,the
forcing the state from some initial value to the origin. physicalinterpretation of theselinearindependence
However, many control problems can be formulated in requirements certainly enhances the insight into control
terms of the ouput y rather than the state x , in which problems and thus by itself contributes to the develop-
case it is essential to have output-controllability, rather ment of theory. -4 theoretical investigation of a multi-
than state-controllability, and to be able to determine variablecontrolproblemwhichignorescontrollability
the homogeneous solution y ( t ) = C ( t ) @ ( fto)x(to), for all and observability is likely to result in errors (see [j]and
t > f o , rather than x(t0) itself. [ 1 1] for examples).
For conciseness, an unforced plant will be called here This is not to say that the conceptsof controllability
oz~tpz4f-predictableon [to,t i ] if y ( t ) = C ( t ) @ ( t ,t O ) x ( t Od)u e andobservabilityare of academicinterestonly. Al-
to any x(t0) canbedeterminedfor all t>ti fromthe though i t mightbearguedsuccessfullythatmost, if
knowledge of y ( f )on [to, ti]. Clearly, complete observa- not all, physical systems are controllable and observa-
bility on [ t o . t,] is sufficient for output-predictability on ble,thelinearizedmathematicalmodelmay,inadver-
[to, t i ] ; however, it is not necessary. If the unobservable tently, not be so andthedesignermayhavetrouble
part x,,(to) of x ( t o ) , which does not affect y ( t ) on [ t o , t,], with his analysis and simulation. To simulate a multi-
continues to be unobservable for all t>t,. then y ( t ) for variableplant,givenbyitsimpulseresponsematrix
t>tf canbedeterminedfromtheobservablepart H,(t, 7 ) or its transfer function matrix with the minimal
x,b(tO) of x(to) alone. From (26) and (33) number of integrators,thesimulationsetupmustbe
f O ) X o b ( f O ) + C(r>@(t,tO)xuo(tO).
y(f) = c(f)@(t, (34) completely state-controllable and completely observable
[5], [ l l ] . Checking for controllability and observability
I t is observed that y ( t ) is given by xob(tO)alone if and helps one to choose the right inputs to manipulate and
only if the second term in the right side of (34) is iden- outputs to measure so as to control the plant properly.
tically zero for all t > t i and all possible x,,(to). Thus a If an unobservable plant is enclosed in a feedback loop,
then instability in the unobservable subspace will not
I n [I]-[3] observability and controllability are defined in such be detected in the output; or if the plant is not com-
a way that the relation between them is via the dual plant which
differs only slightly from the adjoint plantin that the reversed time-
axis t*=2to-t is used. For thedualplant A*(t*)=A(t), B*(f*) These conclusions follow also from Kalmans canonical decom-
=C(f), C*(l*)=B(t), and W ( t * , T * ) = @ ( T , t ) . position [4], [j].
13F TRA
I ES ES E
ACTIONS ON AUTO
CMO A XT 7I CT R O L
pletely controllable, then unless the unstable solutions y ( f )= C ( f ) * ( f ,fo)x(to) = c(f)@(f, h)Xob(fO), fo 5 t 5 (39)
are confined to the controllable subspace. they cannot u-hich leads to (38). AIoreover, x o b ( f O ) is unique because
be affected by the control. In either case the feedback the assumption of the existence of x , b l ( t O ) and X & ) ( & ) ,
loop will notstabilizethesystem(whichv-illfailby both satisfying (39), leads to
blowing up or burning out). If the plant is not stnte-
controllable, then initial states induced by disturbances 0 = c(f)*(f, tO)[xob(fO) - Xob2(fO)] (40)
not in the controllable subspace cannot be controlled which is a contradiction because X o b ( f 0 ) - x X , b 2 ( f o ) is not
and may thus have long-term transients. I n short, u n - in X , , , ( f o , tr). In fact. it is orthogonal to Xuo(fO,t,). T h u s
less the plant is state-controllable and observable it is X , b ( t O ) is unique and it is the shortest solution of (35)
not really entirel?; inside the feedback loop. Of course, because any other solution x ( f , ) = x o b ( t O ) +x,,(to) is nec-
as pointed out in the paper, it may not aln-ays matter. essarily longer (see Fig. 5), thus it is given by (3i).
particularly if the designer is well aware of the implica-
tions. REFEKESCES
APPEXDIS [ l ] R. E. Kalman. On thegeneraltheory of controlsystems,
Proc. 1 s t IntPrnafl.Congress on Aulomntic Control, Butternrorths
T h e generalized inverse M t due to Penrose [ 1 1 ] , [13], Scientific Publications,London,England, vol. 1, pp. 481492;
1961.
which exists uniquely for any matrix M , has the prop- 121 R. E. Iialman, Contributions to the theoryof optimal control,
erty (among others) that if a solution to the equation Bo!. Sac. _lfaat. Jfex., pp. 102-119; 1960.
131 R. E. Iialman, Y. C. Ho and,,K. S. Sarendra, Controllability
M x = n esists,then xu= M t n givesthesolution 11-ith
leastlength (x I
and if thesolution is unique,
xZ2)l!?,
of linear dynamicalsystems,
YOI. 1, pp. 189-213; 1962.
[1]R. E. Kalnlan,Canonicalstructure
Contrib.Differential E q u a h n s ,
of lineardynamical sys-
then M t = M-I. tems,l Proc. L\7ntl ilcad. Sci. 1:. S., vol. 48, pp. 596-600; April,
1962.
The folloxing is a heuristic justification of the state- [51 R. E. Kalman. Mathematical description of linear dynamical
ment that systems, J . SI-411 Control, vol. 1, pp. 152-192; 1963.
[6] P. E.Sarachikand G. 31. IGanc, On OptimalControl of
Systems with IIulti-Sorm Constraints, Proc. 2nd IFXC Con-
Xob(fo) = Mt(ta, f l ) n ( f o ,f j ) (37) gress, Butterworths, London, England, t o be published.
I;] J . E. Bertram and P. E. Sarachik, On optimal computer con-
is the general solution to the equation [see (2F), (30), trol, Proc. Is1 l n t e r m t l . Congress on Autonmfic Control, Butter-
worth Scientific Publications,London,England, vol. 1, pp.
(31) and (X)] 419-422; 1961.
[8] E. Kreindler,Contributionstothetheory of time-optimal
M(fo, f,)x(to) = n(fo, f ! ) . (38) control. 1.Franklin Inst., vol. 275. p. 314; April, 1963.
191 F. R. Gantmacher, The Theory of Matrices. Chelsea Publish-
If the plant is completely observable on [ f o , t i ] , then ing Co., Xew k-ork, X. Y . , vol. 1, ch. 9 ; 1959.
[lo] J. P. LaSalle, The time-optimal control problem, in Co~ztribu-
M-(to, t j ) exists and X , b ( f O ) = x ( f o ) . If the plant is not tions to LTonlinear Oscillations, PrincetonUniversityPress,
completelyobservableon [ f o , t i ] , then a solutionstill Princeton, X. J., x-01. 5, p. 1 ; 1960.
[I 11 E. G. Gilbert, Controllability and observability in multivari-
existsbecause n ( f 0 , ij) isgeneratedbysomeesistent ablecontrolsystems, J . SIrlJi Control, vol. 1,pp. 128-151;
x ( t 0 ) . Butthesolution is nolongeruniquebecause if 1963.
1121 R. Penrose, -4 generalized inverse for matrices, Proc. Cam-
x l ( t 0 ) is a solution of (38), then x l ( i o ) + x w ( f o ) n-ith any bridge Phil. Soc., x-01. 51, pp. 406-413; 1955.
x,,(to) in X u o ( t o 3 t,) is also a solution. Sow x , b ( f O ) satisfies [13] R. Penrose. On best approximatesolutions of linearmatrix
equations, Proc. Cambridge Phil. SOC.,vol. 52,pp.17-19;
(38) since by definition of X o b ( f 0 ) 1956.