14

Nonstandard H control problem

A generalized chain-scattering representation approach

Abstract

The nonstandard Hsi1_e control problem is the case where the direct feedthroughs from the input to the error and from the exogenous signal to the output are not necessarily of full rank. This problem is reformulated based on the generalized chain-scattering representation (GCSR). The GCSR approach leads naturally to a generalization of the homographic transformation. The state-space realization for this generalized homographic transformation and a number of fundamental cascade structures of the Hsi1_e control systems are further studied in a unified framework of GCSR. Certain sufficient conditions for the solvability of the nonstandard Hsi1_e control problem are therefore established via a ((J, J′))-lossless factorization of GCSR. These results present extensions to Kimura’s results on the chain-scattering representation (CSR) approach to the Hsi1_e control in the standard case.

Keywords

Hsi1_e control systems; The generalized chain-scattering representation (GCSR); State-space realization; Nonstandard Hsi1_e control problem; ((J, J′))-lossless factorization; Chain-scattering representation (CSR)

The nonstandard Hsi1_e control problem is the case where the direct feedthroughs from the input to the error and from the exogenous signal to the output are not necessarily of full rank. This problem is reformulated based on the generalized chain-scattering representation (GCSR). The GCSR approach leads naturally to a generalization of the homographic transformation. The state-space realization for this generalized homographic transformation and a number of fundamental cascade structures of the Hsi1_e control systems are further studied in a unified framework of GCSR. Certain sufficient conditions for the solvability of the nonstandard Hsi1_e control problem are therefore established via a (J,Jsi11_e)-lossless factorization of GCSR. These results present extensions to Kimura’s results on the chain-scattering representation (CSR) approach to the Hsi1_e control in the standard case.

14.1 Introduction

Consider the plant

zy=Pwu=P11P12P21P22wu,

si13_e  (14.1)

where zR(s)msi14_e, yR(s)qsi15_e, wR(s)rsi16_e, and uR(s)psi17_e are the controlled error, the observation output, the exogenous input, and the control input, respectively. The Hsi1_e control problem is to find a controller given by

u=Ky,

si19_e  (14.2)

which internally stabilizes the closed-loop system and satisfies Φ<1si20_e, where Φ is the closed-loop transfer function from w to z, which is generally called a linear fractional transformation in the control literature and is denoted [22] by LF(P;K), i.e.,

Φ:=LF(P;K)=P11+P12K(IP22K)1P21.

si21_e  (14.3)

Concerning the above problem, one of the assumptions is the following

(A)rankP21=q,rankP12=p.

si22_e

When the plant satisfies the above assumption, the Hsi1_e control problem is called [37] the regular or standard case, while the case where the above assumption does not hold is referred [120] to a singular Hsi1_e control problem. We do not make the above assumption, the considered problem is thus nonstandard, which includes both the regular case and the singular case. From a system point of view, since no measurement is error free and no control action is costless [117] it is physically reasonable and general (see, e.g., [90]) to assume that the dimension of z is at least that of u, while the dimension of w must be at least that of y, without loss of generality only the right noninvertibility of P21 is thus considered in the following development. It should also be noted that, in Assumption (A) rank P21 = q means that, rank P21() = q, ∀ωR and rank P21()=qsi25_e.

Several approaches (e.g., [25, 36, 37, 121], and references therein) have already been proposed to solve the regular Hsi1_e control problem both in the state-space framework and in the input-output operator-theoretic techniques. The singular Hsi1_e control problem has attracted considerable research interests in the last few years [120, 122]. For a monograph on this subject, one can refer to [122124] considered controller design for the singular Hsi1_e control problem based on the linear matrix inequality (LMI) approach. One basic observation to the aforementioned contributions on this theme is, however, that the problem is generally attacked in the state-space framework. Although state-space techniques are powerful for computing solutions, and are growing even more so with the advent of efficient numerical techniques, they do not always give physical insight into the nature of problems and bear fundamental limitations. Such insight can be obtained much more effectively using input-output techniques that allow solutions to be revealed and understood in their most transparent forms, and without the often obscuring one details that occur in specific problems.

Recently Kimura [22, 90] has developed the CSR, and it was successfully used there to provide a unified framework of Hsi1_e control theory. In this new framework, the Hsi1_e control problem is essentially reduced to a J-lossless factorization of the CSR of the plant. The J-lossless conjugation then provides a powerful tool for computing the required factorization. Kimura’s CSR approach seems to be the most compact theory and the simplest method to the regular Hsi1_e control problem. The known CSR approach is, however, not applicable to the singular Hsi1_e control problem. This situation may improve with the advent of [125]. In [125] Kimura’s results on CSR has been extended to the general case in which the condition (A) is essentially relaxed. From an input-output consistency point of view, the GCSR emerges and is successfully used there to characterize the cascade structure property and the symmetry of general plants in a general setting.

The main motivation of our current work presented herein is to extend Kimura’s results [22, 90] on CSR approach to the Hsi1_e control from the standard case to the nonstandard case by using the GCSR approach [125]. To this end, the nonstandard Hsi1_e control problem is first reformulated based on the GCSR. The GCSR approach then leads naturally to a generalization of the homographic transformation. The state-space realization for this generalized homographic transformation and a number of fundamental cascade structures of the Hsi1_e control systems are further studied in a unified framework of GCSR. Certain sufficient conditions for the solvability of the nonstandard Hsi1_e control problem are thus established via a (J;J)si37_e-lossless factorization of GCSR.

Definition 14.1.1

([5])

For every rational matrix AR(S)n×msi38_e a unique matrix AR(S)m×nsi39_e, which is called the Moore-Penrose inverse, exists satisfying

AAA=A,AAA=A,(AA)T=AA,(AA)T=AA,

si40_e

where A denotes the conjugate transpose of A. In the special case that A is a square nonsingular matrix, the Moore-Penrose inverse of A is simply its inverse, i.e., A = A−1. In case a matrix A−1 satisfies only the first condition, it is called a {1}-inverse. {1}-inverses are not unique but play an important role in the following development.

Notions

RLm×rsi41_e: the set of all m × r rational proper matrices without pole on the -axis

RHm×rsi42_e: the set of all m × r rational stable proper matrices

BHp×qsi43_e: {F(s)R(s)p×q:stable,F<1}si44_e

ABCD:=C(sIA)1+D.

si45_e

14.2 Reformulation of the nonstandard Hsi1_e control problem via generalized chain-scattering representation

The main reason for using the CSR lies in its ability of representing the feedback connection as a cascade one [22, 90], in this context any feedback of an input-output system is subsequently equivalent to a termination of the corresponding CSR. The regular Hsi1_e control problem, when described [22, 90] through CSR, is thus greatly simplified for the commonly used linear fraction transformation has been replaced by a much simpler form of homographic transformation. Motivated by a similar reason, the main aim of this section is to give a reformulation of the nonstandard Hsi1_e control problem via GCSR on the basis of a generalization to homographic transformation.

It is seen that, concerning the existence of CSR, if the input-output pair (u, y) satisfies the condition of consistency given in [125], i.e.,

(IP21P21)[P22,I]uy=0

si49_e

then the CSRs are still available for the nonstandard case. It should be noted that such a condition of consistency essentially relaxes [125] the condition (A). These representations, termed as the GCSRs therein, are not unique. The set of them has, however, been parameterized in [125]. To facilitate exposition, only the special GCSR form, which is formed in terms of the Moore-Penrose inverse of P21, has been chosen for use in the following development. Let us recall this result from [125].

Theorem 14.2.1

([125])

If the plant P is consistent about w with respect to the input-output pair (u;y), then the original plant (1) can be written into the GCSR form

zw=GCHAIN(P)uyh,

si50_e  (14.4)

where we denote the GCSR matrix

GCHAIN(P):=P12P11P21P22P11P21P11(IP21P21)P21P22P21IP21P21R(s)(m+r)×(p+q+r)

si51_e  (14.5)

h is an arbitrary rational vector and P21si52_e is the Moore-Penrose inverse of P21.

If P21 is invertible, then the CSR [22, 90] exists for the plant P, Eq. (14.4) becomes

zw=CHAIN(P)uy,

si53_e

where the CSR matrix is

CHAIN(P)=P12P11P211P22P11P211P211P22P211.

si54_e

Further denote in Eq. (14.5)

G*:=GCHAIN(P):=G11G12G13G21G22G23,

si55_e  (14.6)

where the sizes of the block matrices G11, G12, G13, G21, G22, G23 are m × p, m × q, m × r, r × p, r × q, r × r, respectively.

Now consider the terminated cascade connection (14.2) and (14.4) (refer to Fig. 14.1), by denoting Σ = [G21K + G22G23], one can easily obtain a {1}-inverse of Σ, which is important in the sequel.

f14-01-9780081019467
Fig. 14.1 Hsi1_e control scheme is reduced to a terminated cascade connection of the generalized chain-scattering representation.

Proposition 14.2.1

One {1}-inverse of Σ is

Σ=(IP22K)1P21IP21P21.

si56_e

When considering the terminated cascade connection (14.2) and (14.4) (refer to Fig. 14.1), two primary issues that play a key role in our approach need to be considered. One is that the representation (14.4) together with the relation (14.2) can determine [yT, hT]T. It will be seen clearly that this is always the case provided that the closed-loop system is well-posed.

The other issue is termed as output uniqueness, i.e., the condition under which the closed-loop system is able to give rise to a unique output z. These issues are central to the existence of the relevant generalized transfer function [116]. Interestingly, the determined generalized transfer function not only produces a unique output z, being a functional operator, but it is also exactly equal to the linear fractional transformation, once the condition of output uniqueness is satisfied. The following theorems establish the above interesting observations.

Theorem 14.2.2

For the terminated cascade connection (14.2) and (14.4) of the GCSRs, the generalized transfer functions from w to z exist if and only if the condition of output uniqueness

P12K(IP22K)1(IP21P21)=0

si58_e  (14.7)

is satisfied. The above condition is equivalent to

[G11K+G12G13](IΣΣ)=0.

si59_e  (14.8)

Proof

Considering the terminated cascade connection (14.2) and (14.4) of the GCSRs, which is described by [zT, wT]T = G*[uT, yT, hT]T, u = Ky, where G* is given by Eq. (14.5), (14.6), one has

w=Σ[yT,hT]T,

si60_e  (14.9)

z=[G11K+G12G13][yT,hT]T.

si61_e  (14.10)

Well-posedness of the closed-loop system means the matrix [P21*(IP22K) I] is invertible, from the relation

Σ=[G21K+G22G23]=[P21(IP22K)IP21P21]=[P21(IP22K)I]I(IP22K)1P210I

si62_e

noting that the matrix [P21(IP22K)I]si63_e is of full row rank, one thus concludes that Σ is of full row rank. Therefore, one can always solve Eq. (14.9) for [yT, hT]T and obtain

[yT,hT]T=Σw+(IΣΣ)q,

si64_e  (14.11)

where q is any rational vector. Substituting Eq. (14.11) into Eq. (14.10), Eq. (14.10) reads

z=[G11K+G12G13]Σw+[G11K+G12G13](IΣΣ)q.

si65_e  (14.12)

Hence for Eq. (14.12) to determine the generalized transfer function from w to z, it is sufficient and necessary that the following condition of output uniqueness is satisfied

[G11K+G12G13](IΣΣ)=0

si66_e  (14.13)

due to the fact that q is arbitrary. One can further verify that the output uniqueness condition (14.13) is equivalent to Eq. (14.7). From Proposition 14.2.1 it follows that

IΣΣ=I(IP22K)1P21IP21P21[P21(IP22K)IP21P21]=I(IP22K)1P21P21(IP22K)(IP22K)1P21(IP21P21)(IP21P21)P21(IP22K)I(IP21P21)=(IP22K)1(IP21P21)(IP22K)00P21P21,

si67_e

where the relations (i) and (ii) in Definition 14.1.1 are used. Now

[G11K+G12G13](IΣΣ)=[P12K+P11P21(IP22K)P11(IP21P21)]×(IP22K)1(IP21P21)(IP22K)00P21P21=[P12K(IP22K)1(IP21P21)(IP22K)0],

si68_e

where we have used

P21(IP21P21)=0

si69_e

and

(IP21P21)P21=0.

si70_e

From this we can see that the output uniqueness condition (14.13) is equivalent to Eq. (14.7) for the specially chosen {1}-inverse of Σ given by Proposition 14.2.1. This finishes the proof.

Unlike Kimura’s approach [22, 90] of augmentation in the regular case, in the GCSR matrix the block matrix G23 is of r × r, the matrix [G21K + G22G23] is subsequently of r × (q + r), which is nonsquare and is not invertible. This is one of the reasons that we have to utilize the matrix generalized inverses and where the difficulties arise from the present approach. It is noted that, if the condition of output uniqueness is satisfied, Eq. (14.12) determines a generalized transfer function from w to z, which is given by

GHM(G*;[K0])=[G11K+G12G13]Σ,

si71_e

where Σ is given by Proposition 14.2.1. As a matter of fact this generalized transfer function is an extension to the homographic transformation that is used [22, 90] in dealing with the regular Hsi1_e control problem. We therefore term it as the generalized homographic transformation and denote it by GHM(G*;[K 0]) following the notation adopted in [22, 90].

It is of further interest to look at the relationship between the above proposed generalized homographic transformation and the linear fractional transformation. It is interesting that, being a functional operator, the generalized homographic transformation is equal to the linear fractional transformation. This observation is stated as the following theorem.

Theorem 14.2.3

For the terminated cascade connection (14.2) and (14.4), if the output uniqueness s condition is satisfied, then

GHM(G*;[K0])=LF(P;K).

si73_e  (14.14)

Proof

Considering Eqs. (14.5), (14.6) and Proposition 14.2.1, we have

GHM(G*;[K0])=[G11K+G12G13]Σ=[P12K+P11P21(IP22K)P11(IP21P21)]×(IP22K)1P21IP21P21={[P12K+P11P21(IP22K)}(IP22K)P21++P11(IP21P21)(IP21P21)=P11+P12K(IP22K)1P21=LF{P;K}.

si74_e

The above theorems are interesting, not least for the way in which they reduce the original closed-loop system (14.1) and (14.2) into a wave scatter GCHAIN(P) terminated by a load K. This situation is illustrated in Fig. 14.1. More important than this, however, is that the implied mechanism enables us to pose the nonstandard Hsi1_e control problem in the framework of GCSRs in the following manner.

Nonstandard Hsi1_e problem reformulation: Find a controller (load) K such that the terminated cascade connection (14.2) and (14.4) (refer to Fig. 14.1) is well-posed, internally stable, the output uniqueness condition is satisfied and

GHM(G*;[K0])<1.

si77_e  (14.15)

One further observation arising from Theorem 14.2.3 is that the Hsi1_e norm of the closed-loop system can be given equivalently in terms of the generalized homographic transformation. It will also be seen clearly in the next section that the internal stability of the terminated cascade connection (14.2) and (14.4) can be characterized in terms of the A-matrix in the corresponding state-space realization to the generalized homographic transformation. These two observations are exactly the rationale behind the above reformulation of the nonstandard Hsi1_e control problem.

14.3 Solvability of nonstandard Hsi1_e control problem

This section mainly studies the state-space realization for the generalized homographic transformation and some fundamental cascade structures of the Hsi1_e control systems in the framework of GCSR. Certain sufficient conditions for the solvability of the nonstandard Hsi1_e control problem are then established via (J,J)si83_e-lossless factorization of GCSR.

If the state-space realizations for the GCSR and the controller K are given by

G*=AB1B2B3C1D11D12D13C2D21D22D23

si84_e  (14.16)

and

K=AKBKCKDK

si85_e  (14.17)

respectively. The above relations (14.16) and (14.17) are then written as

ẋ=Ax+B1u+B2y+B3hz=C1x+D11u+D12y+D13hz=C2x+D21u+D22y+D23h

si86_e  (14.18)

and

ξ̇=AKξ+BKyu=CKξ+DKy.

si87_e  (14.19)

Elimination of u from the above relations yields

ẋξ̇=AB1CK0AKxξ+B^BK^yhzw=C1D11CKC2D21CKxξ+D1D2yh

si88_e  (14.20)

where we denote

B^D1D2=B1B2D11D12D21D22DKIB3D13D23BK^=[Bk0].

si89_e  (14.21)

In a similar manner described in [90] and considering the output uniqueness condition, from the above relations one obtains the state-space realization of the generalized homographic transformation GHM(G*;[K 0]) given by

GHM(G*;[K0])=A(G*;[K0])B(G*;[K0])C(G*;[K0])D(G*;[K0]),

si90_e  (14.22)

where

A(G*;[K0])=AB1CK0AKB^BK^×D2[C2D21CK]B(G*;[K0])=B^BK^D2C(G*;[K0])=[C1D(G*;[K0])C2,(D11D(G*;[K0])Ck]D(G*;[K0])=D1D2

si91_e  (14.23)

where D2si92_e is a {1}-inverse of D2 given by

D2=(D21DK+D22)1(ID23D23)D23.

si93_e

Now we are ready to introduce the following definition.

Definition 14.3.1

A terminated system (14.2) and (14.4) is said to be internally stable with respect to the generalized homographic transformation GHM(G*;[K 0]) if the corresponding A-matrix A(G*;[K 0]) given in Eq. (14.23) is stable.

For a closed-loop system (14.1) and (14.2), if the CSR [22, 90] exists and is given by

zw=CHAIN(P)uy:=Θ11Θ12Θ21Θ22uy

si94_e

then being the closed-loop transfer function from w to z the usually used linear fractional transformation can be represented [22, 90] as the homographic transformation, i.e.,

LF(P;K)=HM(CHAIN(P);K):=(Θ11K+Θ12)(Θ21K+Θ22)1.

si95_e

It is not difficult to see that, in the case that the CSR exists for the plant P, any generalized homographic transformation comes out to be the homographic transformation, i.e.,

GHM(CHAIN(P);[K0])=HM(CHAIN(P);K).

si96_e

To derive the solvability of the nonstandard Hsi1_e control problem, the following results are crucial.

Theorem 14.3.1

For the terminated cascade connection (Fig. 14.2) of a GCSR G* = GCHAIN(P1) and a CSRU = CHAIN(P2), if the condition of output uniqueness is satisfied, then we have

f14-02-9780081019467
Fig. 14.2 Terminated cascade connection of a generalized chain-scattering representation and a chain-scattering representation.

GHM(G*;[HM(U;K)0])=GHMG*U00I;[K0].

si98_e  (14.24)

Proof

Let

U=U11U12U21U22

si99_e

and G* be given by Eq. (14.6), subsequently

HM(U;K)=(U11K+U12)(U21K+U22)1.

si100_e  (14.25)

From Theorem 14.2.2, the output uniqueness condition for the left-hand side of relation (14.24) is

[G11HM(U;K)+G12G13]×(I[G21HM(U;K)+G22G23]×[G21HM(U;K)+G22G23])=0.

si101_e  (14.26)
(14.27)
(14.28)

By substituting Eq. (14.25) into Eq. (14.26) and noting

G*U00I=G11U11+G12U21G11U12+G12U22G13G21U11+G22U21G21U12+G22U22G23:=GU11GU12G13GU21GU22G23

si102_e  (14.29)

one can see that Eq. (14.26) is equivalent to

[GU11K+GU12G13]×(I[GU21K+GU22G23][GU21K+GU22G23])=0,

si103_e

which is exactly the output uniqueness condition for the right-hand side of relation (14.24). One therefore has actually proved that the existence of GHM(G*;[HM(U;K) 0]) implies the existency of

GHMG*U00I;[K0]

si104_e

and vice versa. The assertion that they are equal follows directly from the fact

GHM(G*;[HM(U;K)0])=[G11HM(U;K)+G12G13][G21HM(U;K)+G22G23]=[G11(U11K+U12)+G12(U21K+U22)G13(U21K+U22)]×[G21(U11K+U12)+G22(U21K+U22)G23(U21K+U22)]=[GU11K+GU12G13][GU21K+GU22G23]=GHMG*U00I;[K0].

si105_e

This completes the proof.

Theorem 14.3.2

For the terminated cascade connection of a GCSR G*, if the condition of output uniqueness is satisfied, then we have

GHMG*I0RT;[K0]=GHM(G*;[K0]),

si106_e  (14.30)

where R and T are any rational matrix with appropriate dimensions and T is nonsingular.

Proof

Let G* be given by Eq. (14.6), and according to the partition of G*

I0RT:=I000I0R1R2T

si107_e  (14.31)

by using Theorem 14.2.2 and in a similar manner to the proof of Theorem 14.3.3, we can see that the output uniqueness condition for the left-hand side of relation (14.30) is equivalent to that for the right-hand side. By noting that

G*I0RT=G11+G13R1G12+G13R2G13TG21+G23R1G22+G23R2G23T

si108_e

we find that

GHMG*I0RT;[K0]=[(G11+G13R1)K+(G12+G13R2)G13T]×[(G21+G23R1)K+(G22+G23R2)G23T]=[G11K+G12G13]I0R1K+R2T×ΣI0R1K+R2T=[G11K+G12G13]×I0R1K+R2TI0R1K+R2T1Σ=[G11K+G12G13]Σ=GHM(G*;[K0]).

si109_e

We thus finish the proof.

(J, J′)-lossless factorization [22, 90] is a general notion that includes the well-known inner-outer factorization and the spectral factorization. If a matrix G(s)RL(m+r)×(p+q)si110_e is represented as a product G(s) = Θ(s)Π(s), where Θ(s)RL(m+r)×(p+q)si111_e is (Jmr, Jpq)-lossless and Π(s) is unimodular in RH(m+q)×(p+q)si112_e, then G(s) is said to have a (Jmr, Jpq)-lossless factorization. It is established [22, 90] that the problem of regular Hsi1_e control can be reduced to finding a special class of (J, J′)-lossless factorization of the CSR. On the bases of Definition 14.3.1 and Theorems 14.3.1 and 14.3.3, concerning the solvability of the nonstandard Hsi1_e control problem, we are now ready to propose the following important result.

Theorem 14.3.3

Assume that the GCSR G* = GCHAIN(P) has no zeros or poles on the -axis. If the GCSR G* has a (Jmr, J(p+q)r)-lossless factorization

G*(s)=Θ(s)Π(s),

si115_e  (14.32)

where Π(s) has the form

Π(s)=Π11(s)0Π21(s)Π22(s),

si116_e  (14.33)

where Π11(s), Π21(s), and Π22(s) are of (p + q) × (p + q), r × (p + q), and r × r, respectively, and if the output uniqueness condition

[G11HM(Π111;S)+G12G13]×(I[G21HM(Π111;S)+G22G23]×[G21HM(Π111;S)+G22G23])=0

si117_e  (14.34)
(14.35)
(14.36)

is satisfied, where S is an arbitrary matrix in BH(p+q)×(p+q)si118_e, the {1}-inverses can be arbitrary, then the nonstandard d Hsi1_e control problem is solvable for the original plant (14.1), the desirable Hsi1_e controllers are given by

K=HM(Π111;S),SBH(p+q)×(p+q)

si121_e  (14.37)

and the closed-loop transfer function is Φ = HM(Θ;S).

Proof

According to the reformulation of the problem, to prove this statement it is sufficient to see that any desirable controller given by Eq. (14.37) satisfies the output uniqueness condition (14.34) and

Φ=GHM(G*;[K0])BH

si122_e  (14.38)

if G* has a (Jmr, J(p+q)r)-lossless factorization given by Eq. (14.32) with Π(s) being the specific form described in Eq. (14.33).

As far as the output uniqueness condition (14.34) is concerned, Theorem 14.2.2 tells us that it is a must for the generalized homographic transformations to exist.

From Lemma 4.4 in [90] if the matrix Θ(s) is (J, J′)-lossless, then there exists a lossless matrix P1 such that Θ(s) is a CSR of P1, i.e., Θ(s) = CHAIN(P1). Subsequently, if KBHsi123_e, taking into account Theorem 4.15 in [90], then we find that

GHM(Θ;[K0])=GHM(CHAIN(P1);[K0])=HM(CHAIN(P1);K)BH.

si124_e  (14.39)

Based on the above observations, by using Theorems 14.3.1 and 14.3.3, it follows that

GHM(G*,[K0])=GHMΘΠ11(s)0Π21(s)Π22(s);[HM(Π111;S)0]=GHMΘΠ11(s)0Π21(s)Π22(s)Π11100I;[S0]=GHMΘI0Π21(s)Π111Π22(s);[S0]=GHM(Θ;[S0])=GHM(CHAIN(P1);[S0])=HM(CHAIN(P1);S)BHSBH(p+q)×(p+q).

si125_e

As far as the issue of internal stability is concerned in the above equaling process and considering Definition 14.3.1, one can see that the Hsi1_e controller only cancels out all the stable poles and zeros from the (J, J′)-lossless factorization. The internal stability is therefore left invariant.

Due to the fact that one needs to use Theorem 4.15 of [90] in proposing the above theorem, we have assumed that GCSR G* = GCHAIN(P) has no zeros or poles on the -axis. However, this condition is not as restrictive as the standard assumption (A) that we are trying to relax in this approach. To see this, take the following simple example.

Example 14.3.1

Consider the plant

P=P11P12P21P22=1/(s+1)00010010001/(s+2),

si127_e

where

P21=100000

si128_e

is not of full row rank. The standard assumption (A) is not satisfied by the above plant. It is seen that

P21=100000.

si129_e

Further calculations yield the GCSR matrix

GCHAIN(P)=P12P11P21P22P11P21P11(IP21P21)P21P22P21IP21P21=1/(s+1)1/(s+1)0000110000000010000001,

si130_e

which has no zeros or poles on the imaginary axis.

The invariant zeros or poles of GCSR G* = GCHAIN(P) can be understood in the usual way [5] for a GCSR matrix is still a rational matrix though it is essentially a generalized transfer function [116] of the plant. In the case that the GCSR matrix holds any invariant zero or pole on the imaginary axis one can choose a controller to create a pole or zero in the same point. Then the invariant zero or pole is canceled via pole-zero cancelation. Because of our requirement of internal stability this is only possible for zero or pole in the open left half plane. For zero or pole in the open right half plane it is clearly not possible. In the case of an invariant zero or pole on the imaginary axis we can achieve this cancelation proximately by creating a pole or a zero in the left half plane that is very close to the imaginary axis. A treatment in this manner is given in [126].

It should also be noted that the above triangular structure of the unimodular factor Π(s) in Eq. (14.33) is similar to that of Theorem 7.7 in [90] for the four block cases. In [22], a procedure based on J-lossless conjugation and then formulated in terms of the solutions of two relevant algebraic Riccati equations has already developed, which brings any rational functional matrix G(s) into its (J, J′)-lossless factorization, i.e., G(s) =Θ1(s1(s), where Θ1(s) is (J, J′)-lossless and Π1(s) is unimodular, though Π1(s) is not necessarily in a triangular form. This procedure can also be applied to find the factorization required in the above theorem in the following manner. One first obtains the above (J, J′)-lossless factorization

G*(s)=Θ1(s)Π1(s)

si131_e

by using Kimura’s approach, and then computing the LU decomposition of Π1(s) by the rowechelon factoring method to obtain the required triangular form. In more detail, considering Π1(s) is a unimodular matrix, one finds a special LU decomposition such that Π1(s) = L(s)U(s), where the row-echelon factoring matrix L(s) can be expected to be orthogonal, and U(s) is in the required triangular form. Note that, in this case the matrix Θ(s) =Θ1(s)L(s) is still (J, J′)-lossless for it satisfies [22]

ΘT(s)JmrΘ(s)=J(p+q)r,sΘ*(s)JmrΘ(s)J(p+q)r,Re[s]0.

si132_e

For the techniques of traditional LU decomposition and a modified LU decomposition of a rational function matrix, we can refer to [127]. For numerical symbolic computation, Maple has provided a routine LUdecomp for this purpose. A remaining interesting topic worthy of further research, however, is to show how this kind of special triangular structure can be directly linked to certain algebraic Riccati equations.

The above theorem is interesting in that it generalizes the result proposed by Kimura [22, 90] from the regular case to the nonstandard case. It establishes a close tie between the nonstandard Hsi1_e control problem and (J, J′)-lossless factorization by displaying the fact that, just as in the regular problem, if the unimodular part of a GCSR is completely canceled out by the controller and a certain output uniqueness condition is satisfied, then this nonstandard problem is solvable.

14.4 Conclusions

We have presented a GCSR approach to the nonstandard Hsi1_e control problem. Certain sufficient conditions for the solvability of this problem are established via a (J, J′)-lossless factorization of GCSR. These results thus present extensions to Kimura’s results on the CSR approach to Hsi1_e control. The suggested approach is believed to be workable in the practical control setting due to the fact that some computational formulas and procedures of the Moore-Penrose inverse of a matrix are available through the work of Klema and Laub [128], which can be applied to obtain the GCSR, and the J-lossless conjugation approach [22, 90] has provided a powerful tool for computing the required (J, J′)-lossless factorization of the GCSR. Future research would focus on the issue of how these solution conditions in terms of the GCSR of the plant can be directly linked to the relevant algebraic Riccati equations in a state-space scheme.

References

[5] Rosenbrock H.H. State Space and Multivariable Theory. London: Nelson; 1970.

[22] Kimura H. Chain-scattering representation, J-lossless factorization and Hsi1_e control. J. Math. Syst. Estimation Control. 1995;5:203–255.

[25] Ball J.A., Helton J.W., Verma M. A factorization principle for stabilization of linear control systems. Int. J. Robust Nonlinear Control. 1991;1(4):229–294.

[36] Francis B.A. In: A Course in H-infinity Control. Berlin: Springer-Verlag; . Lecture Notes in Control and Information Sciences. 1987;vol. 88.

[37] Doyle J.C., Klover K., Khargonekar P.P., Francis B.A. State-space solutions to standard H2 and Hsi1_e control problems. IEEE Trans. Autom. Control. 1989;34:831–847.

[90] Kimura H. Chain-scattering Approach to H-infinity Control. Boston: Birkhäuser; 1997.

[116] Hou M., Pugh A.C., Hayton G.E. Generalized transfer functions and input-output equivalence. Int. J. Control. 1997;68(5):1163–1178.

[117] Green M., Limebeer D.J.N. Linear Robust Control. Englewood Cliffs, NJ: Prentice-Hall; 1995.

[120] Stoorvogel A.A. The singular Hsi4_e control with dynamic measurement feedback. SIAM J. Control Optim. 1991;39:355–360.

[121] Green M., Glover K., Linebeer D., Doyle D. A J-spectral factorization approach to Hsi1_e control. SIAM J. Control Optim. 1990;28:1350–1371.

[122] Stoorvogel A.A., Sabell A., Chen B.M. A reduced order observer based controller design for Hsi4_e optimization. IEEE Trans. Autom. Control. 1994;39:355–360.

[123] Stoorvogel A.A. The Hsi4_e Control Problem: A State Space Approach. Upper Saddle River, NJ: Prentice Hall; 1992.

[124] Xin X., Guo L., Feng C. Reduced-order controllers for continuous and discrete-time singular Hsi4_e control problems based on LMI. Automatica. 1996;32:1581–1585.

[125] Tan L., Pugh A.C. A note on the solution of regular PMDs. Int. J. Control. 1999;72(14):1235–1248.

[126] Hara S., Sugie T., Kondo R. Descriptor form solution for H-infinity control problem with -axis zeros. Automatica. 1992;28:55–70.

[127] Akritas A.G. Elements of Computer Algebra with Applications. New York: Wiley; 1989.

[128] Klema V.C., Laub A.J. The singular value decomposition: its computation and some applications. IEEE Trans. Autom. Control. 1980;25:164–176.


“To view the full reference list for the book, click here

..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.16.81.94