Strong Structural Controllability of Structured Networks with MIMO node systems
The article addresses the problem of strong structural controllability of structured networks with multi-input multi-output (MIMO) node systems. The authors first present necessary and sufficient conditions for strong structural controllability, which involve both algebraic and graph-theoretic aspects. These conditions are computationally expensive, especially for large-scale networks with high-dimensional state spaces. To overcome this computational complexity, we propose a necessary algebraic condition from a node system's perspective and a graph-theoretic condition from a network topology's perspective. The latter condition is derived from the structured interconnection laws and employs a new color change rule, namely weakly color change rule introduced in this paper. Overall, this article contributes to the study of strong structural controllability in structured networks with MIMO node systems, providing both theoretical and practical insights for their analysis and design.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Computation of the Distance-based Bound on Strong Structural Controllability in Networks
In this paper, we study the problem of computing a tight lower bound on the dimension of the strong structurally controllable subspace (SSCS) in networks with Laplacian dynamics. The bound is based on a sequence of vecto…
Resilient Strong Structural Controllability in Networks using Leaky Forcing in Graphs
This paper studies the problem of selecting input nodes (leaders) to make networks strong structurally controllable despite misbehaving nodes and edges. We utilize a graph-based characterization of network strong structu…
Partial Strong Structural Controllability
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…
A Note on Structural Controllability and Observability Indices
In this note, we investigate the structural controllability and observability indices of structured systems. We provide counter-examples showing that an existing graph-theoretic characterization for the structural contro…
Minimize Control Inputs for Strong Structural Controllability Using Reinforcement Learning with Graph Neural Network
Strong structural controllability (SSC) guarantees networked system with linear-invariant dynamics controllable for all numerical realizations of parameters. Current research has established algebraic and graph-theoretic…
Graph Neural Network