Symplectic Runge-Kutta discretization of a regularized forward-backward sweep iteration for optimal control problems

From MaRDI portal
Publication:2199787

DOI10.1016/J.CAM.2020.113133zbMATH Open1447.49043arXiv1912.07028OpenAlexW3048081146MaRDI QIDQ2199787FDOQ2199787

Jason Frank, Xin Liu

Publication date: 14 September 2020

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Abstract: Li, Chen, Tai & E. (J. Machine Learning Research, 2018) have proposed a regularization of the forward-backward sweep iteration for solving the Pontryagin maximum principle in optimal control problems. The authors prove the global convergence of the iteration in the continuous time case. In this article we show that their proof can be extended to the case of numerical discretization by symplectic Runge-Kutta pairs. We demonstrate the convergence with a simple numerical experiment.


Full work available at URL: https://arxiv.org/abs/1912.07028




Recommendations




Cites Work


Cited In (9)

Uses Software





This page was built for publication: Symplectic Runge-Kutta discretization of a regularized forward-backward sweep iteration for optimal control problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199787)