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

12/15/2019
by   Xin Liu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/01/2022

Presymplectic integrators for optimal control problems via retraction maps

Retractions maps are used to define a discretization of the tangent bund...
research
04/20/2020

Space-time finite element discretization of parabolic optimal control problems with energy regularization

We analyze space-time finite element methods for the numerical solution ...
research
12/10/2019

Moreau-Yosida Regularization for Optimal Control of Fractional Elliptic Problems with State and Control Constraints

Recently the authors have studied a state and control constrained optima...
research
08/24/2023

New time domain decomposition methods for parabolic control problems I: Dirichlet-Neumann and Neumann-Dirichlet algorithms

We present new Dirichlet-Neumann and Neumann-Dirichlet algorithms with a...
research
12/22/2022

Temporal Parallelisation of the HJB Equation and Continuous-Time Linear Quadratic Control

This paper presents a mathematical formulation to perform temporal paral...
research
11/06/2016

EM Algorithm and Stochastic Control in Economics

Generalising the idea of the classical EM algorithm that is widely used ...
research
01/31/2022

Imbedding Deep Neural Networks

Continuous depth neural networks, such as Neural ODEs, have refashioned ...

Please sign up or login with your details

Forgot password? Click here to reset