TY - JOUR
T1 - Partial strong structural controllability
AU - Zhang, Yuan
AU - Xia, Yuanqing
N1 - Publisher Copyright:
© 2022 Elsevier Ltd
PY - 2022/7
Y1 - 2022/7
N2 - This paper introduces a new controllability notion, termed partial strong structural controllability (PSSC), on a structured system whose entries of system matrices are either fixed zero or indeterminate, which naturally extends the conventional strong structural controllability (SSC) and bridges the gap between structural controllability and SSC. Dividing the indeterminate entries into two categories, generic entries and unspecified entries, a system is PSSC, if for almost all values of the generic entries in the parameter space except for a set of measure zero, and any nonzero (complex) values of the unspecified entries, the corresponding system is controllable. We highlight that this notion generalizes the generic property embedded in the conventional structural controllability for single-input systems. We then give algebraic and (bipartite) graph-theoretic necessary and sufficient conditions for single-input systems to be PSSC, the latter of which can be verified in polynomial time. Conditions for multi-input systems are subsequently given for a special case. It is shown the established results can induce a new maximum matching based criterion for SSC over the system bipartite graph representations.
AB - This paper introduces a new controllability notion, termed partial strong structural controllability (PSSC), on a structured system whose entries of system matrices are either fixed zero or indeterminate, which naturally extends the conventional strong structural controllability (SSC) and bridges the gap between structural controllability and SSC. Dividing the indeterminate entries into two categories, generic entries and unspecified entries, a system is PSSC, if for almost all values of the generic entries in the parameter space except for a set of measure zero, and any nonzero (complex) values of the unspecified entries, the corresponding system is controllable. We highlight that this notion generalizes the generic property embedded in the conventional structural controllability for single-input systems. We then give algebraic and (bipartite) graph-theoretic necessary and sufficient conditions for single-input systems to be PSSC, the latter of which can be verified in polynomial time. Conditions for multi-input systems are subsequently given for a special case. It is shown the established results can induce a new maximum matching based criterion for SSC over the system bipartite graph representations.
KW - Genericity
KW - Independence
KW - Maximum matching
KW - Strong structural controllability
KW - Structural controllability
UR - http://www.scopus.com/inward/record.url?scp=85129094256&partnerID=8YFLogxK
U2 - 10.1016/j.automatica.2022.110316
DO - 10.1016/j.automatica.2022.110316
M3 - Article
AN - SCOPUS:85129094256
SN - 0005-1098
VL - 141
JO - Automatica
JF - Automatica
M1 - 110316
ER -