Algorithm for identifying minimum driver nodes based on structural controllability (Q1664935)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6925720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm for identifying minimum driver nodes based on structural controllability |
scientific article; zbMATH DE number 6925720 |
Statements
Algorithm for identifying minimum driver nodes based on structural controllability (English)
0 references
27 August 2018
0 references
Summary: Existing methods on structural controllability of networked systems are based on critical assumptions such as nodal dynamics with infinite time constants and availability of input signals to all nodes. In this paper, we relax these assumptions and examine the structural controllability for practical model of networked systems. We explore the relationship between structural controllability and graph reachability. Consequently, a simple graph-based algorithm is presented to obtain the minimum driver nodes. Finally, simulation results are presented to illustrate the performance of the proposed algorithm in dealing with large-scale networked systems.
0 references
0 references
0 references
0.845921516418457
0 references
0.8312134146690369
0 references
0.8301185965538025
0 references
0.8109899163246155
0 references
