Topological and graph-coloring conditions on the parameter-independent stability of second-order networked systems
From MaRDI portal
(Redirected from Publication:4596855)
Abstract: In this paper, we study parameter-independent stability in qualitatively heterogeneous passive networked systems containing damped and undamped nodes. Given the graph topology and a set of damped nodes, we ask if output consensus is achieved for all system parameter values. For given parameter values, an eigenspace analysis is used to determine output consensus. The extension to parameter-independent stability is characterized by a coloring problem, named the richly balanced coloring (RBC) problem. The RBC problem asks if all nodes of the graph can be colored red, blue and black in such a way that (i) every damped node is black, (ii) every black node has blue neighbors if and only if it has red neighbors, and (iii) not all nodes in the graph are black. Such a colored graph is referred to as a richly balanced colored graph. Parameter-independent stability is guaranteed if there does not exist a richly balanced coloring. The RBC problem is shown to cover another well-known graph coloring scheme known as zero forcing sets. That is, if the damped nodes form a zero forcing set in the graph, then a richly balanced coloring does not exist and thus, parameter-independent stability is guaranteed. However, the full equivalence of zero forcing sets and parameter-independent stability holds only true for tree graphs. For more general graphs with few fundamental cycles an algorithm, named chord node coloring, is proposed that significantly outperforms a brute-force search for solving the NP-complete RBC problem.
Recommendations
Cites work
- Consensus and Cooperation in Networked Multi-Agent Systems
- Controllability of multi-agent systems from a graph-theoretic perspective
- Duality and network theory in passivity-based cooperative control
- Graph multiplication
- Hierarchical Clustering of Dynamical Networks Using a Saddle-Point Analysis
- scientific article; zbMATH DE number 3337198 (Why is no real title available?)
- Kron Reduction of Graphs With Applications to Electrical Networks
- On robust synchronization of heterogeneous linear multi-agent systems with static couplings
- On the Reachability and Observability of Path and Cycle Graphs
- Output synchronization for heterogeneous networks of introspective right-invertible agents
- Passivity as a Design Tool for Group Coordination
- Pinning a Complex Dynamical Network to Its Equilibrium
- Port-Hamiltonian systems on graphs
- Port-Hamiltonian systems theory: an introductory overview
- Stability analysis of multimachine power networks with linear frequency dependent loads
- Synchronization of Dynamical Networks With Nonidentical Nodes: Criteria and Control
- Zero forcing number, constrained matchings and strong structural controllability
- Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
- Zero forcing sets and the minimum rank of graphs
Cited in
(4)- On the error of \textit{a priori} sampling: zero forcing sets and propagation time
- Topology identification of heterogeneous networks: identifiability and reconstruction
- The impact of damping in second-order dynamical systems with applications to power grid stability
- Controllability measure for disturbance rejection capabilities of control systems with undamped flexible structures
This page was built for publication: Topological and graph-coloring conditions on the parameter-independent stability of second-order networked systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596855)
