Input addition and leader selection for the controllability of graph-based systems
From MaRDI portal
Publication:2350792
DOI10.1016/J.AUTOMATICA.2013.07.021zbMATH Open1315.93013OpenAlexW2055340995MaRDI QIDQ2350792FDOQ2350792
Authors: Christian Commault, Jean-Michel Dion
Publication date: 25 June 2015
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2013.07.021
Recommendations
- Graph theoretical methods to study controllability and leader selection for dead-time systems
- Controllability of weighted and directed networks with nonidentical node dynamics
- Graph-theoretic characterization of controllability for multi-agent systems
- Controllability improvement for multi-agent systems: leader selection and weight adjustment
- Structural controllability analysis based on dilations under leader-follower framework
Controllability (93B05) Large-scale systems (93A15) Applications of graph theory to circuits and networks (94C15)
Cited In (25)
- Leader-follower containment control over directed random graphs
- Graph theoretical methods to study controllability and leader selection for dead-time systems
- On structural behavioural controllability of linear discrete time systems with delays
- Characterizing controllable subspace and herdability of signed weighted networks via graph partition
- Minimum cost input/output design for large-scale linear structural systems
- Controllability of heterogeneous multi-agent systems under directed and weighted topology
- Key-nodes selection problem for minimum cost control of directed networks
- Controllability improvement for multi-agent systems: leader selection and weight adjustment
- On the complexity of the constrained input selection problem for structural linear systems
- An overview of structural systems theory
- On polynomially solvable constrained input selections for fixed and switched linear structured systems
- Output null controllability for linear time-invariant structured discrete-time systems: a graph theoretic condition
- On the fixed controllable subspace in linear structured systems
- Controllable containment control of multi-agent systems based on hierarchical clustering
- Leader selection in networks under switching topologies with antagonistic interactions
- Any dynamical system is fully accessible through one single actuator and related problems
- Approximating constrained minimum cost input-output selection for generic arbitrary pole placement in structured systems
- Strong structural controllability and leader selection for multi-agent systems with unidirectional topology
- Graph-theoretic analysis of network input-output processes: zero structure and its implications on remote feedback control
- Minimal inputs/outputs for subsystems in a networked system
- The single-input minimal controllability problem for structured systems
- Nodes selection strategy in cooperative tracking problem
- On the controllability and observability of networked dynamic systems
- Controllability of networked multiagent systems based on linearized Turing's model
- Toward optimizing control signal paths in functional brain networks
This page was built for publication: Input addition and leader selection for the controllability of graph-based systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350792)