On strong structural controllability of networked systems: A constrained matching approach

Author

Chapman, Airlie ; Mesbahi, Mehran

Author_Institution

Dept. of Aeronaut. & Astronaut., Univ. of Washington, Seattle, WA, USA

fYear

2013

fDate

17-19 June 2013

Firstpage

6126

Lastpage

6131

Abstract

This paper examines strong structural controllability of linear-time-invariant networked systems. We provide necessary and sufficient conditions for strong structural controllability involving constrained matchings over the bipartite graph representation of the network. An O(n²) algorithm to validate if a set of inputs leads to a strongly structurally controllable network and to find such an input set is proposed. The problem of finding such a set with minimal cardinality is shown to be NP-complete. Minimal cardinality results for strong and weak structural controllability are compared.

Keywords

computational complexity; controllability; graph theory; networked control systems; observability; pattern matching; NP-complete problem; O(n²) algorithm; bipartite graph representation; linear-time-invariant networked systems; minimal cardinality; necessary and sufficient conditions; structural controllability; structurally controllable network; Approximation algorithms; Bandwidth; Bipartite graph; Controllability; Couplings; Observability; Testing; Network controllability; Network observability; Strong structural controllability; constrained matchings;

fLanguage

English

Publisher

ieee

Conference_Titel

American Control Conference (ACC), 2013

Conference_Location

Washington, DC

ISSN

0743-1619

Print_ISBN

978-1-4799-0177-7

Type

conf

DOI

10.1109/ACC.2013.6580798

Filename

6580798