Discrete-Time Controllability of Cartesian Product Networks

被引:1
作者
Liu, Bo [1 ]
Hu, Mengjie [1 ]
Huang, Junjie [2 ]
Zhang, Qiang [2 ]
Chen, Yin [3 ]
Su, Housheng [4 ]
机构
[1] Minzu Univ China, Sch Informat Engn, Minist Educ Key Lab Intelligent Anal & Secur Gover, Beijing 100081, Peoples R China
[2] Inner Mongolia Univ, Sch Math Sci, Hohhot 010021, Peoples R China
[3] Univ Strathclyde, Dept Elect & Elect Engn, Glasgow City G1 1XW, Scotland
[4] Huazhong Univ Sci & Technol, Sch Artificial Intelligence & Automat, Image Proc & Intelligent Control Key Lab Educ Mini, Autonomous Intelligent Unmanned Syst Engn Res Ctr, Wuhan, Peoples R China
来源
IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS | 2024年 / 10卷
基金
中国国家自然科学基金;
关键词
Controllability; Complex networks; Observability; Network systems; Laplace equations; Information processing; Topology; System performance; Stability analysis; Power system dynamics; Cartesian product networks; composite networks; OBSERVABILITY; SYSTEMS;
D O I
10.1109/TSIPN.2024.3487411
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This work studies the discrete-time controllability of a composite network formed by factor networks via Cartesian products. Based on the Popov-Belevitch-Hautus test and properties of Cartesian products, we derive the algebra-theoretic necessary and sufficient conditions for the controllability of the Cartesian product network (CPN), which is devoted to carry out a comprehensive study of the intricate interplay between the node-system dynamics, network topology and the controllability of the CPN, especially the intrinsic connection between the CPN and its factors. This helps us enrich and perfect the theoretical framework of controllability of complex networks, and gives new insight into designing a valid control scheme for larger-scale composite networks.
引用
收藏
页码:868 / 880
页数:13
相关论文
共 39 条
  • [1] Graph operations and synchronization of complex networks
    Atay, FM
    Biyikoglu, T
    [J]. PHYSICAL REVIEW E, 2005, 72 (01)
  • [2] Composability and controllability of structural linear time-invariant systems: Distributed verification
    Carvalho, J. Frederico
    Pequito, Sergio
    Pedro Aguiar, A.
    Kar, Soummya
    Johansson, Karl H.
    [J]. AUTOMATICA, 2017, 78 : 123 - 134
  • [3] Controllability and Observability of Network-of-Networks via Cartesian Products
    Chapman, Airlie
    Nabi-Abdolyousefi, Marzieh
    Mesbahi, Mehran
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2014, 59 (10) : 2668 - 2679
  • [4] Nodal Dynamics, Not Degree Distributions, Determine the Structural Controllability of Complex Networks
    Cowan, Noah J.
    Chastain, Erick J.
    Vilhena, Daril A.
    Freudenberg, James S.
    Bergstrom, Carl T.
    [J]. PLOS ONE, 2012, 7 (06):
  • [5] Minimal Sufficient Conditions for Structural Observability/Controllability of Composite Networks via Kronecker Product
    Doostmohammadian, Mohammadreza
    Khan, Usman A.
    [J]. IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2020, 6 : 78 - 87
  • [6] Recovering the Structural Observability of Composite Networks via Cartesian Product
    Doostmohammadian, Mohammadreza
    [J]. IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2020, 6 : 133 - 139
  • [7] Logic-based distributed routing for NoCs
    Parallel Architectures Group, Technical University of Valencia, Spain
    [J]. IEEE Comput. Archit. Lett., 2008, 1 (13-16): : 13 - 16
  • [8] Community structure in social and biological networks
    Girvan, M
    Newman, MEJ
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 (12) : 7821 - 7826
  • [9] CHARACTERIZATION OF STRUCTURAL CONTROLLABILITY
    GLOVER, K
    SILVERMAN, LM
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1976, 21 (04) : 534 - 537
  • [10] Structural Controllability of Directed Signed Networks
    Guan, Yongqiang
    Li, Aming
    Wang, Long
    [J]. IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2021, 8 (03): : 1189 - 1200