arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.09722math.OCcs.NAmath.NA
收藏

切换点算法向边值问题的扩展

Extension of Switch Point Algorithm to Boundary-Value Problems

William W. Hager

AI总结:

本文将切换点算法从仅含初始条件的最优控制问题扩展到同时含初始与终端约束的边值问题,并证明成本对切换点的导数仍为哈密顿量在该点的跳跃。

摘要:

在早先的一篇论文(https://doi.org/10.1137/21M1393315)中,切换点算法被提出用于求解最优控制问题,这些问题的解要么是奇异的,要么是 bang-bang 的,或者同时具有奇异和 bang-bang 结构,并且在解结构发生变化的时刻,最优控制具有有限数量的跳跃不连续点。当时所考虑的控制问题类别具有给定的初始条件,但没有终端约束。现在该理论被扩展以包含同时具有初始约束和终端约束的问题,这种结构经常出现在边值问题中。为了处理这一更一般的设定,需要对理论进行实质性修改。尽管如此,成本关于切换点的导数仍然是哈密顿量在切换点处的跳跃。

英文摘要:

In an earlier paper (https://doi.org/10.1137/21M1393315), the Switch Point Algorithm was developed for solving optimal control problems whose solutions are either singular or bang-bang or both singular and bang-bang, and which possess a finite number of jump discontinuities in an optimal control at the points in time where the solution structure changes. The class of control problems that were considered had a given initial condition, but no terminal constraint. The theory is now extended to include problems with both initial and terminal constraints, a structure that often arises in boundary-value problems. Substantial changes to the theory are needed to handle this more general setting. Nonetheless, the derivative of the cost with respect to a switch point is again the jump in the Hamiltonian at the switch point.

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

↑