论文标题
使用图结构选择节能输入
Selecting Energy Efficient Inputs using Graph Structure
论文作者
论文摘要
为复杂网络描述的系统选择适当的输入是一个重要但困难的问题，在网络控制领域中基本保持开放。最近的工作提出了两种用于节能输入选择的方法。基于梯度的启发式和贪婪的近似算法。我们在这里提出了一种基于“气球图”的可控性图的分析解决方案输入选择的替代方法，这是一个特殊的模型图，该图捕获了\ emph {decans {decans}和\ emph {decamph {decemph {冗余路径}之间的作用。提出的方法尤其适用于仅控制少数输出或目标节点的大型网络，而当前方法可能不切实际，因为它们需要计算一个典型的非常不良条件的矩阵，称为Gramian。我们的方法与以前的方法产生可比的结果，同时更加有效。
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.
