arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2304.04980math.OC
收藏

二维网格上结构化线性二次控制计算

Structured linear quadratic control computations over 2D grids

Armaghan Zafar, Ian R. Manchester

AI总结:

本文针对二维网格连接的多个子系统线性二次最优控制问题,提出一种基于嵌套块雅可比预条件的结构化PCGM求解器,证明预条件子正定且保留时空结构,计算复杂度为O(KNT),并支持二维网格并行分布式实现。

摘要:

本文提出了一种基于预条件共轭梯度法(PCGM)的结构化求解器,用于求解以二维(2D)网格结构连接的 $K \ imes N$ 个子系统的线性二次(LQ)最优控制问题。我们的主要贡献是开发了一种基于嵌套块雅可比方法固定次数内外迭代的结构化预条件子。我们证明了所提出的预条件子是正定的。此外,所提出的方法在问题的两个空间维度以及时间维度上都保留了结构。每个 PCGM 步骤的算术复杂度为 $O(KNT)$,其中 $T$ 是时间范围的长度。所提出的 PCGM 每一步所涉及的计算是可分解的,并且适合在按二维网格结构连接、仅需局部数据交换的并行处理器上进行分布式实现。我们还提供了在两个示例系统上进行的数值实验结果。

英文摘要:

In this paper, we present a structured solver based on the preconditioned conjugate gradient method (PCGM) for solving the linear quadratic (LQ) optimal control problem for $K \times N$ sub-systems connected in a two-dimensional (2D) grid structure. Our main contribution is the development of a structured preconditioner based on a fixed number of inner-outer iterations of the nested block Jacobi method. We establish that the proposed preconditioner is positive-definite. Moreover, the proposed approach retains structure in both spatial dimensions as well as in the temporal dimension of the problem. The arithmetic complexity of each PCGM step scales as $O(KNT)$, where $T$ is the length of the time horizon. The computations involved at each step of the proposed PCGM are decomposable and amenable to distributed implementation on parallel processors connected in a 2D grid structure with localized data exchange. We also provide results of numerical experiments performed on two example systems.

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

↑