zbMATH — the first resource for mathematics

Graph-theoretic characterization of fixed modes in centralized and decentralized control. (English) Zbl 0537.93009
Consider a system $$\dot x=Ax+Bu$$, $$y=Cx$$ with centralized output feedback $$u=Fy$$, where $$x\in R^ n$$, $$u\in R^ m$$, $$y\in R^ r$$ and A, B, C, F are matrices. A decentralized control problem is further specified: $$u_ i=F_ iy_ i$$, $$B=diag(B_ 1,...,B_ k)$$, $$F=diag(F_ 1,...,F_ k)$$, $$u=(u^ T_ 1,...,u^ T_ k)^ T$$, $$u_ i\in R^{n_ i}$$, $$y_ i\in R^{r_ i}$$, $$\sum_{i}n_ i=n$$, $$\sum_{i}r_ i=r$$, k is a number of channels. The correspondence of the coefficients of the characteristic polynomial $$\det(sI_ n-A-BFC)=s^ n+\sum^{n- 1}_{j=0}p_{n-j}s^ j$$ to the cycle families of the weighted digraph is proved (Theorem 1): The coefficients $$p_ i$$ are determined by the cycle families of width i, it means that the cycle family touches i state vertices. Each cycle family of width i corresponds to one summand of $$p_ i$$. The summand is numerically determined by the weight of the cycle family multiplied by a sign factor. Using this result, the necessary and sufficient condition for the existence of fixed modes of multiplicity $$h\geq 1$$ at $$s=\lambda$$ ($$\lambda$$ a complex number) is proved (Theorem 2). The paper is self contained and clearly written. It is supplied with numerous illustrative examples. The results contribute to structural control theory by exploitation of the concepts of cycles and cycle families to determine the existence of fixed modes and structurally fixed modes of M. E. Sezer and D. D. Šiljak [Syst. Control. Lett. 1, 60-64 (1981; Zbl 0476.93042)], see also K. Reinschke [Proc. Third Conf. on Syst. Theory, Trondheim (October 1983), Tapir Publ., Trondheim (Norway), 1984].
Reviewer: L.Bakule

MSC:
 93A15 Large-scale systems 05C20 Directed graphs (digraphs), tournaments 05C38 Paths and cycles 93C05 Linear systems in control theory 93C35 Multivariable systems, multidimensional control systems 93C99 Model systems in control theory 94C15 Applications of graph theory to circuits and networks
Full Text:
References:
 [1] ANDERSON B. D. O., Automatica 17 pp 703– (1981) · Zbl 0469.93014 · doi:10.1016/0005-1098(81)90017-0 [2] COATES C L., I.E.E.E. Tram. Circuit Theory 6 pp 170– (1959) [3] HOSKINS R. F., Proc. Symp. Network Theory, Cranfield pp 139– (1961) [4] IKEDA M., I.E.E.E. Trans, autom. Control 24 pp 670– (1979) · doi:10.1109/TAC.1979.1102088 [5] KROFT D., Proc. Inst, elect, electron. Engrs 55 pp 88– (1967) · doi:10.1109/PROC.1967.5389 [6] LIN , P. M. , and ALDERSON , G. E. , 1969 ,Proc. 1th Allerton Conf. Circuit and System-Theory, Urbana , p. 196 . [7] LINNEMANN A., Fixed Modes in Parametrized Systems (Universitat Bremen (BRD) (1982) · Zbl 0512.93011 [8] MOMEN S., Structural Controllability and Stabilization of Decentralized Systems (1982) [9] RAO V. V. B., Proc. Inst, elect, electron. Engrs 57 pp 700– (1969) · doi:10.1109/PROC.1969.7032 [10] REINSCHKE K., Verfahren zur rechnergestiltzten Analyse linearer Netzwerke (1976) [11] SEZER. M. E., Syst. Control Lett 1 pp 60– (1981) · Zbl 0476.93042 · doi:10.1016/S0167-6911(81)80014-X [12] SILJAK , D. D. , PINCHAI , V. , and SEZER , M. E. , 1982 , Report DE-AC 037 ET 29138 – 25 , University of Santa Clara , California . [13] WANG S. H., I.E.E.E. Trans. autom. Control 23 pp 938– (1978) · doi:10.1109/TAC.1978.1101870 [14] WANG S. H., I.E.E.E. Trans. autom. Control 18 pp 473– (1973) · Zbl 0273.93047 · doi:10.1109/TAC.1973.1100362
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.