Selecting Energy Efficient Inputs using Graph Structure
arXiv:2008.12940 · doi:10.1080/00207179.2021.2022218
Abstract
Selecting appropriate inputs for systems described by complex networks is an important but difficult problem that largely remains open in the field of control of networks. Recent work has proposed two methods for energy efficient input selection; a gradient based heuristic and a greedy approximation algorithm. We propose here an alternative method for input selection based on the analytic solution of the controllability Gramian of the `balloon graph', a special model graph that captures the role of both \emph{distance} and \emph{redundant paths} between a driver node and a target node. The method presented is especially applicable for large networks where one is interested in controlling only a small number of outputs, or target nodes, for which current methods may not be practical because they require computing a typically very ill-conditioned matrix, called the controllability Gramian. Our method produces comparable results to the previous methods while being more computational efficient.
arXiv commentAccepted for publication in the International Journal of Control
References in corpus (11)
- Influence of fake news in Twitter during the 2016 US presidential election
- Control Principles of Complex Networks
- Exact Controllability of Complex Networks
- On Submodularity and Controllability in Complex Dynamical Networks
- Controlling complex networks: How much energy is needed?
- Power grids vulnerability: a complex network approach
- Spectrum of Controlling and Observing Complex Networks
- Controllability transition and nonlocality in network control
- Energy Scaling of Targeted Optimal Control of Complex Networks
- Locally Optimal Control of Complex Networks
- Efficient target control of complex networks based on preferential matching