Input addition and leader selection for the controllability of graph-based systems
From MaRDI portal
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
Cited in
(26)- On structural behavioural controllability of linear discrete time systems with delays
- Minimal inputs/outputs for subsystems in a networked system
- An overview of structural systems theory
- Leader selection in networks under switching topologies with antagonistic interactions
- Approximating constrained minimum cost input-output selection for generic arbitrary pole placement in structured systems
- Characterizing controllable subspace and herdability of signed weighted networks via graph partition
- On the controllability and observability of networked dynamic systems
- On the fixed controllable subspace in linear structured systems
- Leader-follower containment control over directed random graphs
- Minimum cost input/output design for large-scale linear structural systems
- Controllability of heterogeneous multi-agent systems under directed and weighted topology
- Any dynamical system is fully accessible through one single actuator and related problems
- Graph theoretical methods to study controllability and leader selection for dead-time systems
- Controllability improvement for multi-agent systems: leader selection and weight adjustment
- Nodes selection strategy in cooperative tracking problem
- Key-nodes selection problem for minimum cost control of directed networks
- Toward optimizing control signal paths in functional brain networks
- Controllable containment control of multi-agent systems based on hierarchical clustering
- Strong structural controllability and leader selection for multi-agent systems with unidirectional topology
- On polynomially solvable constrained input selections for fixed and switched linear structured systems
- Controllability of networked multiagent systems based on linearized Turing's model
- Output null controllability for linear time-invariant structured discrete-time systems: a graph theoretic condition
- A distributed framework for the minimum cost problem based on graph decomposition
- The single-input minimal controllability problem for structured systems
- Graph-theoretic analysis of network input-output processes: zero structure and its implications on remote feedback control
- On the complexity of the constrained input selection problem for structural linear systems
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)
