Characterizing controllable subspace and herdability of signed weighted networks via graph partition
From MaRDI portal
Publication:2307587
Recommendations
- On the herdability of linear time-invariant systems with special topological structures
- Controllability of multi-agent systems with directed and weighted signed networks
- Controllability of weighted and directed networks with nonidentical node dynamics
- Edge controllability of signed networks
- Controllability for multi-agent systems with matrix-weight-based signed network
Cites work
- Almost equitable partitions and new necessary conditions for network controllability
- Asymptotic Synchronization of a Leader-Follower Network of Uncertain Euler-Lagrange Systems
- Consensus Problems on Networks With Antagonistic Interactions
- Containment control for a social network with state-dependent connectivity
- Controllability of multi-agent systems from a graph-theoretic perspective
- Controllability of multi-agent systems with directed and weighted signed networks
- Controllability of Multiagent Networks With Antagonistic Interactions
- Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
- Graph Distances and Controllability of Networks
- Graph partitions and cluster synchronization in networks of oscillators
- Graph-theoretic characterisations of structural controllability for multi-agent system with switching topology
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- Input addition and leader selection for the controllability of graph-based systems
- Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
- Interconnection topologies for multi-agent coordination under leader-follower framework
- Laplacian eigenvectors and eigenvalues and almost equitable partitions
- Leader localization in multi-agent systems subject to failure: a graph-theoretic approach
- Linear systems theory
- Stabilization of positive linear systems
- Structural controllability of switched linear systems
- Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
Cited in
(14)- Edge controllability of signed networks
- An overview of structural systems theory
- Leader selection in networks under switching topologies with antagonistic interactions
- Strong targeted controllability of multi-agent systems with time-varying topologies over finite fields
- On stabilizability of multi-agent systems
- Relative controllability of multi-agent systems with input delay and switching topologies
- On the herdability of linear time-invariant systems with special topological structures
- Unified understanding and new results of controllability model of multi‐agent systems
- Relative controllability of delay multi‐agent systems
- Design of controllable leader-follower networks via memetic algorithms
- Herdability of Nash equilibrium in neighbour-based game control system
- Herdability of switching signed networks
- Target herdability of directed signed networks
- Finite-horizon optimal herdability control for hierarchical linear multi-agent systems with signed weighted graphs
This page was built for publication: Characterizing controllable subspace and herdability of signed weighted networks via graph partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307587)
