Selecting energy efficient inputs using graph structure
Selecting energy efficient inputs using graph structure
复制标题
DOI：
10.1080/00207179.2021.2022218
复制
发表时间：
2022-01-06
影响因子：
2.1
通讯作者：
Sorrentino, Francesco
中科院分区：
文献类型：
--
作者：
Klickstein, Isaac;Sorrentino, Francesco
为复杂网络描述的系统选择适当的输入是一个重要但困难的问题，在网络控制领域很大程度上仍然是开放的。最近的工作提出了两种节能输入选择的方法；基于梯度的启发式算法和贪婪近似算法。我们在这里提出了一种基于“气球图”可控性格拉米安解析解的输入选择替代方法，“气球图”是一种特殊的模型图，它捕获驱动节点和目标节点之间的距离和冗余路径的作用。所提出的方法特别适用于大型网络，在大型网络中，人们只对控制少量输出或目标节点感兴趣，而当前的方法可能不实用，因为它们需要计算一个通常非常病态的矩阵，称为可控性格拉米安。我们的方法产生与以前的方法相当的结果，同时计算效率更高。
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 distance and 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.