利用基于聚类的投影对大规模网络进行最优控制
Optimal Control of Large-Scale Networks using Clustering Based Projections
AI总结:
本文提出基于投影的设计方法,用于构建大规模网络系统的简化线性二次调节器(LQR)控制器。通过聚类系统状态,减少维度,从而降低计算难度和通信需求。
摘要:
本文提出了一组基于投影的设计方法,用于构建大规模网络系统的简化线性二次调节器(LQR)控制器。当系统具有上万状态时,传统LQR控制器的设计变得数值上具有挑战性,且其实施需要大量的通信链路。我们提出的方法通过利用闭环传递矩阵的结构特性对系统状态进行聚类,从而减少维度。最终通过逆向投影将降维控制器投影回原始坐标。因此,该问题被提出为一个模型匹配问题,即寻找最优的聚类集或P,以最小化全阶网络与全阶LQR之间的误差的H2范数。我们推导了该模型匹配问题的可处理松弛形式,并设计了求解松弛的P。该设计被证明可以通过一种方便的、分层的双层控制架构实现,所需的通信链路数量远少于全阶LQR。
英文摘要:
In this paper we present a set of projection-based designs for constructing simplified linear quadratic regulator (LQR) controllers for large-scale network systems. When such systems have tens of thousands of states, the design of conventional LQR controllers becomes numerically challenging, and their implementation requires a large number of communication links. Our proposed algorithms bypass these difficulties by clustering the system states using structural properties of its closed-loop transfer matrix. The assignment of clusters is defined through a structured projection matrix P, which leads to a significantly lower-dimensional LQR design. The reduced-order controller is finally projected back to the original coordinates via an inverse projection. The problem is, therefore, posed as a model matching problem of finding the optimal set of clusters or P that minimizes the H2-norm of the error between the transfer matrix of the full-order network with the full-order LQR and that with the projected LQR. We derive a tractable relaxation for this model matching problem, and design a P that solves the relaxation. The design is shown to be implementable by a convenient, hierarchical two-layer control architecture, requiring far less number of communication links than full-order LQR.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。