arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.13345math.OC
收藏

线性时变网络系统的能控性分数

Controllability scores of linear time-varying network systems

Kota Umezu, Kazuhiro Sato

AI总结:

本文将能控性分数从LTI系统扩展到LTV网络系统,证明其几乎处处唯一且对时间参数连续,并提出数据驱动计算方法,数值实验验证了有效性。

摘要:

对于大规模网络系统,基于控制理论的网络中心性在理解其性质并高效控制它们方面发挥着关键作用。能控性分数就是这样一种中心性指标,并能给出具有物理意义的度量。它最初是为线性时不变(LTI)系统提出的,而在本文中,我们将其扩展到线性时变(LTV)系统。由于能控性分数被定义为某个优化问题的最优解,因此它不一定是唯一确定的。为了可复现性和可解释性,必须保证其唯一性。在本文中,我们证明了它在几乎所有情况下的唯一性,这保证了它可作为一种网络中心性度量使用。我们还证明了它关于时间参数的连续性。此外,我们提出了一种数据驱动方法来计算它。最后,我们通过数值实验验证了该扩展的有效性,并检验了数据驱动方法的性能。

英文摘要:

For large-scale network systems, network centrality based on control theory plays a crucial role in understanding their properties and controlling them efficiently. The controllability score is such a centrality index and can give a physically meaningful measure. It is originally proposed for linear time-invariant (LTI) systems, and we extend it to linear time-varying (LTV) systems in this paper. Since the controllability score is defined as an optimal solution to some optimization problem, it is not necessarily uniquely determined. Its uniqueness must be guaranteed for reproducibility and interpretability. In this paper, we show its uniqueness in almost all cases, which guarantees its use as a network centrality measure. We also prove its continuity with respect to the time parameters. In addition, we propose a data-driven method to compute it. Finally, we verify the effectiveness of the extension and examine the performance of the data-driven method through numerical experiments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑