On Controllability of Linear Systems from a Graph-theoretic Perspective
In this paper, we consider the controllability problem of linear systems from a graph-theoretic perspective. Our aim is to characterize the interconnection graph of a controllable linear system and discuss the relationship between controllability and connectivity. We have derived sufficient and necessary conditions for controllability and connectivity using eigenvalues and eigenvectors of the graph. In particular, we prove that for a regular interconnection graph, controllability implies connectivity.
linear system controllability connectivity algebraic graph theory regular graph
Qi Xiao
The Key Laboratory of Systems and Control, Chinese Academy of Sciences, Beijing 100190, P. R. China
国际会议
The 31st Chinese Control Conference(第三十一届中国控制会议)
合肥
英文
152-154
2012-07-01（万方平台首次上网日期，不代表论文的发表时间）