Algorithm for identifying minimum driver nodes based on structural controllability
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.
- Controllability and algorithms of complex networks
- Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes
- Identifying and using driver nodes in temporal networks
- Minimum structural controllability problems of complex networks
- scientific article; zbMATH DE number 7156464
- Bond-graph approach for structural analysis of MIMO linear systems
- Controllability of a Leader–Follower Dynamic Network With Switching Topology
- Controllability of switching networks of multi-agent systems
- Criteria for global pinning-controllability of complex networks
- Decentralized control of complex systems
- Generic properties and control of linear structured systems: A survey
- scientific article; zbMATH DE number 3882430 (Why is no real title available?)
- scientific article; zbMATH DE number 2120941 (Why is no real title available?)
- Interconnection topologies for multi-agent coordination under leader-follower framework
- Leader localization in multi-agent systems subject to failure: a graph-theoretic approach
- Leader-follower formation control of nonholonomic mobile robots with input constraints
- Leader-following consensus of multi-agent systems under fixed and switching topologies
- Maintaining limited-range connectivity among second-order agents
- Multi-group coordination control for robot swarms
- Multivariable Control
- On Pinning Synchronization of Directed and Undirected Complex Dynamical Networks
- On structural controllability theorem
- On the irreducibility condition in the structural controllability theorem
- Structural controllability
- Structural Controllability and Observability of Linear Systems Over Finite Fields With Applications to Multi-Agent Systems
- Structural controllability of multiinput linear systems
- Minimum structural controllability problems of complex networks
- Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices
- Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes
- Controllability and algorithms of complex networks
- Identifying and using driver nodes in temporal networks
- Fixed node determination and analysis in directed acyclic graphs of structured networks
- A temporal segmentation algorithm for restoring the controllability of networked control systems
This page was built for publication: Algorithm for identifying minimum driver nodes based on structural controllability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1664935)
