On Submodularity and Controllability in Complex Dynamical Networks
From MaRDI portal
Publication:5358487
Abstract: Controllability and observability have long been recognized as fundamental structural properties of dynamical systems, but have recently seen renewed interest in the context of large, complex networks of dynamical systems. A basic problem is sensor and actuator placement: choose a subset from a finite set of possible placements to optimize some real-valued controllability and observability metrics of the network. Surprisingly little is known about the structure of such combinatorial optimization problems. In this paper, we show that several important classes of metrics based on the controllability and observability Gramians have a strong structural property that allows for either efficient global optimization or an approximation guarantee by using a simple greedy heuristic for their maximization. In particular, the mapping from possible placements to several scalar functions of the associated Gramian is either a modular or submodular set function. The results are illustrated on randomly generated systems and on a problem of power electronic actuator placement in a model of the European power grid.
Cited in
(45)- Numerical interpretation of controllability coefficients in nonlinear dynamics
- Robust controllability assessment and optimal actuator placement in dynamic networks
- Sparsity in max-plus algebra and systems
- Controllability metrics on networks with linear decision process-type interactions and multiplicative noise
- Optimizing network topology for average controllability
- Optimal resilient sensor placement problem for secure state estimation
- Closed-loop control of nonlinear neural networks: the estimate of control time and energy cost
- Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems: a new approach using secants
- Sufficient control of complex networks
- A randomized approach to sensor placement with observability assurance
- \texttt{emgr} -- the empirical Gramian framework
- On the control of psychological networks
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
- A sub-modular receding horizon solution for mobile multi-agent persistent monitoring
- Complexity of constrained sensor placement problems for optimal observability
- Maximizing the smallest eigenvalue of a symmetric matrix: a submodular optimization approach
- Design of controllable leader-follower networks via memetic algorithms
- Real-time sensor selection for time-varying networks with guaranteed performance
- Selecting energy efficient inputs using graph structure
- On verification and design of input matrix for robust linear systems: complexity and polynomially solvable cases
- Spectrum computation and optimization for controllability Gramian of networked Laplacian systems with limited control placement
- A separation theorem for joint sensor and actuator scheduling with guaranteed performance bounds
- Input matrix construction and approximation using a graphic approach
- On polynomially solvable constrained input selections for fixed and switched linear structured systems
- Security-aware optimal actuator placement in vehicle platooning
- Particle filtering of dynamical networks: highlighting observability issues
- Learning-based actuator selection for increased attack resilience of uncertain systems
- A study on \(\langle(\mathcal{Q,S,R})-\gamma\rangle\)-dissipative synchronisation of coupled reaction-diffusion neural networks with time-varying delays
- Novel Gramians for linear semistable systems
- Control‐channel interactions in diffusive dynamical networks: A graph‐theoretic perspective
- Strategic sensor placement on graphs
- Parameter estimation in epidemic spread networks using limited measurements
- The controllability Gramian of lattice graphs
- Distributed strategy selection: a submodular set function maximization approach
- Minimal inputs/outputs for subsystems in a networked system
- Measure of quality of finite-dimensional linear systems: a frame-theoretic view
- Controllability-Gramian submatrices for a network consensus model
- Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms
- Eigenvalue clustering, control energy, and logarithmic capacity
- Key-nodes selection problem for minimum cost control of directed networks
- Observability-blocking control using sparser and regional feedback for network synchronization processes
- Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms
- Submodular containment is hard, even for networks
- Key node selection in minimum-cost control of complex networks
- Strong structural controllability of networks: comparison of bounds using distances and zero forcing
This page was built for publication: On Submodularity and Controllability in Complex Dynamical Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358487)
