Scinovex
articleTop 10% cited

Structural controllability

IEEE Transactions on Automatic Control · 1974 · Vol. 19(3) · pp. 201–208
Ching-Tai Lin

Abstract

The new concepts of "structure" and "structural controllability" for a linear time-invariant control system (described by a pair ( <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A,b</tex> )) are defined and studied. The physical justification of these concepts and examples are also given. The graph of a pair ( <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A,b</tex> ) is also defined. This gives another way of describing the structure of this pair. The property of structural controllability is reduced to a property of the graph of the pair ( <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A,b</tex> ). To do this, the basic concept of a "cactus" and the related concept of a "precactus" are introduced. The main result of this paper states that the pair ( <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A,b</tex> ) is structurally controllable if an only if the graph of ( <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A,b</tex> ) is "spanned by a cactus." The result is also expressed in a more conventional way, in terms of some properties of the pair ( <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A,b</tex> ).

Advanced Differential Equations and Dynamical SystemsMathematical Control Systems and AnalysisStability and Control of Uncertain SystemsControllabilityGraphComputer scienceMathematicsTheoretical computer scienceApplied mathematics
Citations
1,409
FWCI
5.92
field-weighted impact
References
9
Percentile
97%
vs. same field & year
Citations per year
References
Foundations of optimal control theory
IEEE Transactions on Automatic Control · 1968 · 1,725 citations
Matrix Iterative Analysis
Mathematics of Computation · 1963 · 4,153 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.