利用图结构选择节能输入
Selecting Energy Efficient Inputs using Graph Structure
摘要：
为复杂网络描述的系统选择合适的输入是网络控制领域的一个重要而困难的问题。最近的工作提出了两种方法，能源效率的输入选择，基于梯度的启发式和贪婪近似算法。在这里，我们提出了一种替代方法输入选择的基础上的可控性Gramian的“气球图”，一个特殊的模型图，捕获的作用\emph{distance}和\emph{redundant paths}之间的驱动程序节点和目标节点的分析解。所提出的方法是特别适用于大型网络，其中一个是有兴趣在控制只有少量的输出，或目标节点，目前的方法可能是不切实际的，因为它们需要计算一个典型的非常病态矩阵，称为可控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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
