伪谱最优控制中的快速网格细化
Fast Mesh Refinement in Pseudospectral Optimal Control
AI总结:
本文提出了一种基于Birkhoff插值的改进方法,用于在任意网格上生成条件数良好的伪谱最优控制离散化方案,从而在提高计算效率和精度的同时解决网格细化过程中出现的条件数问题。
摘要:
伪谱(PS)最优控制中的网格细化过程异常简单——只需增加拉格朗日插值多项式的阶数$N$,并使收敛性数学自动分配网格点。不幸的是,随着$N$的增加,所得到的线性代数的条件数以$N^2$增长;因此,谱效率和精度在实践中会丢失。在本文中,我们提出了一种在任意网格上应用Birkhoff插值概念的方法,以生成条件数良好的PS最优控制离散化方案。我们证明,一般情况下条件数的增长仅与$\sqrt{N}$成正比,但在边界点之一被固定的情况下,条件数与$N$无关。因此,随着$N$的增加,谱精度和效率得以保持。通过使用超过千阶的多项式来解决低推力、长周期轨道转移问题,验证了所提出快速网格细化策略的有效性。
英文摘要:
Mesh refinement in pseudospectral (PS) optimal control is embarrassingly easy --- simply increase the order $N$ of the Lagrange interpolating polynomial and the mathematics of convergence automates the distribution of the grid points. Unfortunately, as $N$ increases, the condition number of the resulting linear algebra increases as $N^2$; hence, spectral efficiency and accuracy are lost in practice. In this paper, we advance Birkhoff interpolation concepts over an arbitrary grid to generate well-conditioned PS optimal control discretizations. We show that the condition number increases only as $\sqrt{N}$ in general, but is independent of $N$ for the special case of one of the boundary points being fixed. Hence, spectral accuracy and efficiency are maintained as $N$ increases. The effectiveness of the resulting fast mesh refinement strategy is demonstrated by using \underline{polynomials of over a thousandth order} to solve a low-thrust, long-duration orbit transfer problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。