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

基于块状准牛顿雅可比更新的伴随法SQP方法用于非线性最优控制

Adjoint-based SQP Method with Block-wise quasi-Newton Jacobian Updates for Nonlinear Optimal Control

Mitsubishi Electric Research Laboratories(三菱电机研究实验室);University of California, Berkeley(加州大学伯克利分校)

Pedro Hespanhol, Rien Quirynen

AI总结:

本文提出了一种基于块状结构的两面一阶准牛顿更新公式改进的伴随法SQP算法,用于非线性模型预测控制中的非凸优化问题求解,并通过两个仿真案例展示了该算法的收敛性和计算性能。

摘要:

非线性模型预测控制(NMPC)通常需要在每个采样瞬间严格的时间约束下求解非凸优化问题,基于一组可能刚性和/或包含隐式代数方程的微分方程。本文对最近提出的基于伴随法的序列二次规划(SQP)算法进行了局部收敛性分析,该算法基于一种块状结构的两面一阶(quasi-Newton)更新公式,以稀疏保持的方式高效计算雅可比矩阵近似值。在使用隐式积分方案对最优控制问题进行离散化时,提出了一种特别高效的算法实现,其中矩阵分解和矩阵-矩阵运算可以完全避免。通过两个非线性MPC的仿真案例研究,展示了所提出优化算法的收敛分析结果以及计算性能。

英文摘要:

Nonlinear model predictive control~(NMPC) generally requires the solution of a non-convex optimization problem at each sampling instant under strict timing constraints, based on a set of differential equations that can often be stiff and/or that may include implicit algebraic equations. This paper provides a local convergence analysis for the recently proposed adjoint-based sequential quadratic programming~(SQP) algorithm that is based on a block-structured variant of the two-sided rank-one~(TR1) quasi-Newton update formula to efficiently compute Jacobian matrix approximations in a sparsity preserving fashion. A particularly efficient algorithm implementation is proposed in case an implicit integration scheme is used for discretization of the optimal control problem, in which matrix factorization and matrix-matrix operations can be avoided entirely. The convergence analysis results as well as the computational performance of the proposed optimization algorithm are illustrated for two simulation case studies of nonlinear MPC.

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

↑