Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability
Existingmethods 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 practica...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | E-Article |
| Language: | English |
| Published: |
Hindawi Publishing Corporation
2015
|
| Subjects: | |
| Online Access: | http://ir.unimas.my/id/eprint/10309/1/NO%2012%20Algorithm%20for%20Identifying%20Minimum%20Driver%20Nodes%20Based%20on%20Structural%20Controllability%20%28abstract%29.pdf http://ir.unimas.my/id/eprint/10309/ http://www.scopus.com/inward/record.url?eid=2-s2.0-84946093592&partnerID=40&md5=6216364afe54ef6b0cbda078203c4c45 http://dx.doi.org/10.1155/2015/192307 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Malaysia Sarawak |
| Language: | English |
| Summary: | Existingmethods 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. |
|---|