Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability

Reza, Haghighi and HamidReza, Namazi (2015) Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability. Mathematical Problems in Engineering, 2015. ISSN 1563-5147

[img]
Preview
PDF
NO 12 Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability (abstract).pdf

Download (59kB) | Preview

Abstract

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.

Item Type: Article
Uncontrolled Keywords: Algorithm, networked systems, communications technology, research, Universiti Malaysia Sarawak, unimas, university, universiti, Borneo, Malaysia, Sarawak, Kuching, Samarahan, ipta, education
Subjects: T Technology > T Technology (General)
Divisions: Academic Faculties, Institutes and Centres > Faculty of Engineering
Depositing User: Karen Kornalius
Date Deposited: 25 Jan 2016 03:46
Last Modified: 24 Oct 2016 01:37
URI: http://ir.unimas.my/id/eprint/10309

Actions (For repository members only: login required)

View Item View Item