期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 66, 期 10, 页码 4836-4843出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2020.3041420
关键词
Controllability; Symmetric matrices; Graph theory; Linear systems; Dynamical systems; Tools; Computational complexity; Networked control systems; structured linear systems; target controllability
资金
- US National Science Foundation [CAREER-ECCS-1651433]
This article explores the target controllability problem of networked dynamical systems, deriving necessary and sufficient conditions for the structural target controllability of LTI systems with symmetric state matrices and providing graph-theoretic conditions for undirected networks. The results can also be extended to structural output controllability, but verifying these conditions in undirected networks is proven to be NP-hard.
In this article, we study the target controllability problem of networked dynamical systems,in which we are tasked to steer a subset of network nodes toward a desired objective. More specifically, we derive necessary and sufficient conditions for the structural target controllability of linear time-invariant (LTI) systems with symmetric state matrices, such as those representing undirected dynamical networks with unknown link weights. To achieve our goal, we first characterize the generic rank of symmetrically structured matrices, as well as the modes of any numerical realization. Subsequently, we provide graph-theoretic necessary and sufficient conditions for the structural target controllability of undirected networks with multiple control nodes. In addition, we show that these results can be extended and lead to a necessary and sufficient condition of the structural output controllability. However, different from structural target controllability, we prove that verifying the proposed conditions on structural output controllability in undirected networks is NP-hard.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据