DocumentCode :
581530
Title :
On controllability of linear systems from a graph-theoretic perspective
Author :
Xiao, Qi
Author_Institution :
Key Lab. of Syst. & Control, Beijing, China
fYear :
2012
fDate :
25-27 July 2012
Firstpage :
152
Lastpage :
154
Abstract :
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.
Keywords :
controllability; eigenvalues and eigenfunctions; graph theory; linear systems; eigenvalues and eigenvectors; graph connectivity; graph-theoretic perspective; linear system controllability; regular interconnection graph; sufficient and necessary conditions; Controllability; Eigenvalues and eigenfunctions; Indexes; Linear systems; Symmetric matrices; Topology; algebraic graph theory; connectivity; controllability; linear system; regular graph;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control Conference (CCC), 2012 31st Chinese
Conference_Location :
Hefei
ISSN :
1934-1768
Print_ISBN :
978-1-4673-2581-3
Type :
conf
Filename :
6389918
Link To Document :
بازگشت