A Duality‐Based Controllability Condition for a Class of Heterogeneous Networked Systems

ABSTRACT In this work, controllability of a class of heterogeneous Networked Control Systems (NCSs) with Multi‐Input Multi‐Output (MIMO), Linear Time Invariant (LTI) nodes is investigated. In general, nodal controllability is not the only factor affecting the controllability of an NCS. We employ the notion of duality to study network controllability and identify a class of NCSs where nodal controllability is the sole deciding factor of network controllability. This identification relies on the equality between the dual of the networked system and the network of duals. We establish that this equality holds for NCSs where all the nodes are actuated and sensed, and the nodal input () and inner‐coupling () matrices coincide at all the nodes (i.e., ). These conditions are inherent in many real‐life systems like networks of spring‐mass systems. An algorithm is designed to check the controllability of networked systems. Numerical implementations of the same in MATLAB indicate the increased time efficiency and consistency as compared with classical controllability algorithms.

Authors

Institutions

Publication Details

Journal
Asian Journal of Control
Published
2026-10-14
DOI
https://doi.org/10.1002/asjc.70264
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Duality‐Based Controllability Condition for a Class of Heterogeneous Networked Systems

Raju K. George, Aleena Thomas, Abhijith Ajayakumar
Asian Journal of Control
Distributed Control Multi-Agent Systems
article

A Duality‐Based Controllability Condition for a Class of Heterogeneous Networked Systems

Raju K. George, Aleena Thomas, Abhijith Ajayakumar
article en

Abstract

ABSTRACT In this work, controllability of a class of heterogeneous Networked Control Systems (NCSs) with Multi‐Input Multi‐Output (MIMO), Linear Time Invariant (LTI) nodes is investigated. In general, nodal controllability is not the only factor affecting the controllability of an NCS. We employ the notion of duality to study network controllability and identify a class of NCSs where nodal controllability is the sole deciding factor of network controllability. This identification relies on the equality between the dual of the networked system and the network of duals. We establish that this equality holds for NCSs where all the nodes are actuated and sensed, and the nodal input () and inner‐coupling () matrices coincide at all the nodes (i.e., ). These conditions are inherent in many real‐life systems like networks of spring‐mass systems. An algorithm is designed to check the controllability of networked systems. Numerical implementations of the same in MATLAB indicate the increased time efficiency and consistency as compared with classical controllability algorithms.

Asian Journal of Control
Sri Sathya Sai Institute of Higher Learning (IN), Indian Institute of Space Science and Technology (IN)
University Grants Commission, Indian Institute of Space Science and Technology
Openalex Percentile: Top 12%
Distributed Control Multi-Agent Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.