Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability
Joint Authors
Namazi, Hamidreza
Haghighi, Reza
Source
Mathematical Problems in Engineering
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-10-11
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Haghighi, Reza& Namazi, Hamidreza. 2015. Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability. Mathematical Problems in Engineering،Vol. 2015, no. 2015, pp.1-9.
https://search.emarefa.net/detail/BIM-1073178
Modern Language Association (MLA)
Haghighi, Reza& Namazi, Hamidreza. Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability. Mathematical Problems in Engineering No. 2015 (2015), pp.1-9.
https://search.emarefa.net/detail/BIM-1073178
American Medical Association (AMA)
Haghighi, Reza& Namazi, Hamidreza. Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability. Mathematical Problems in Engineering. 2015. Vol. 2015, no. 2015, pp.1-9.
https://search.emarefa.net/detail/BIM-1073178
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1073178