1
Return

Discernibility of Switched Linear Dynamical Networks

delete2026-03-25
delete0
PRE
AI
Z
Ziye Fan
X
Xiaoqun Wu
B
Bing Mao
J
Jinhu Lü
DOI:10.1109/tac.2026.3677731delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The necessary and sufficient conditions for distinguishing between two switched linear dynamical networks through trajectories are investigated. Three discernibility concepts are originally proposed, addressing two critical components of switched systems: switching instants and system topologies. First, the necessary and sufficient discernibility condition is established for systems with identical switching instants but potentially distinct topologies, revealing that the discernibility of switched networks cannot be reduced to that of pairwise topological variations when multiple topological changes exist. Second, instant discernibility is examined for systems sharing identical topology sequences but differing in switching instants. Furthermore, comprehensive switching discernibility condition is derived, demonstrating that networks with entirely different switching sequences can generate identical evolution trajectories under specific configurations. Finally, applications of the results in diversifying the communication channels among multiagents is demonstrated through procedures to generate switched systems that exhibit the same trajectories as time-invariant systems.
Keywords:
Linear dynamical networks
switched systems
switching discernibility

Journal

IEEE Transactions on Automatic Control cover
IEEE Transactions on Automatic Control
IF:
7
Papers:
1.3W
Citations:
6.7W

Organization

B
Beihang University
Scholars:
5.0W
Papers: 4.0W
Citations: 37
S
shenzhen university
Scholars:
4.4W
Papers: 3.4W
Citations: 72
Cited Papers

Cited Papers

Citing Papers

Citing Papers