DocumentCode
504397
Title
Graph theoretic methods in the study of structural issues in control
Author
Belur, Madhu N. ; Chakraborty, Debraj
Author_Institution
Dept. of Electr. Eng., Indian Inst. of Technol. Bombay, Mumbai, India
fYear
2009
fDate
18-21 Aug. 2009
Firstpage
3940
Lastpage
3944
Abstract
This paper addresses questions regarding controllability and observability for `generic parameter´ dynamical systems. We use graph theoretic methods and hence these questions are answered in a `structural sense´. We formulate necessary and sufficient conditions for controllability in terms of suitable maximum matchings in the bipartite graph constructed from the constraints and variables. The conditions for observability turn out to be similar. We relate these tests to Gilbert´s controllability and observability tests.
Keywords
controllability; graph theory; observability; pattern matching; Gilbert´s controllability tests; Gilbert´s observability tests; bipartite graph; generic parameter dynamical systems; graph theoretic methods; maximum matching; structural issues; Bipartite graph; Control systems; Controllability; Differential equations; Observability; Polynomials; State feedback; State-space methods; Sufficient conditions; Testing; Gilbert´s tests; controllability; maximum matching; observability; perfect matching;
fLanguage
English
Publisher
ieee
Conference_Titel
ICCAS-SICE, 2009
Conference_Location
Fukuoka
Print_ISBN
978-4-907764-34-0
Electronic_ISBN
978-4-907764-33-3
Type
conf
Filename
5333283
Link To Document