{"id":1123,"date":"2018-08-29T21:46:18","date_gmt":"2018-08-30T05:46:18","guid":{"rendered":"http:\/\/depts.washington.edu\/uwrainlab\/?page_id=1123"},"modified":"2018-08-29T21:46:18","modified_gmt":"2018-08-30T05:46:18","slug":"on-strong-structural-controllability-of-networked-systems-a-constrained-matching-approach","status":"publish","type":"page","link":"http:\/\/depts.washington.edu\/uwrainlab\/on-strong-structural-controllability-of-networked-systems-a-constrained-matching-approach\/","title":{"rendered":"On Strong Structural Controllability of Networked Systems: A Constrained Matching Approach"},"content":{"rendered":"

A. Chapman, M. Mesbahi<\/span><\/span><\/strong><\/p>\n

IEEE American Control Conference<\/strong><\/p>\n

\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
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(n2<\/sup>) 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.<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
<\/div>\n

Links:<\/strong><\/p>\n

\"\"<\/a> \u00a0 \"\"<\/a> \u00a0 \"\"<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

A. Chapman, M. Mesbahi IEEE American Control Conference 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(n2) algorithm to validate if a set of inputs leads to a strongly structurally controllable […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1123"}],"collection":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/comments?post=1123"}],"version-history":[{"count":1,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1123\/revisions"}],"predecessor-version":[{"id":1126,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1123\/revisions\/1126"}],"wp:attachment":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/media?parent=1123"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}