Numerical Discretization Methods for the Extended Linear Quadratic Control Problem
In this study, we introduce numerical methods for discretizing continuous-time linear-quadratic optimal control problems (LQ-OCPs). The discretization of continuous-time LQ-OCPs is formulated into differential equation systems, and we can obtain the discrete equivalent by solving these systems. We present the ordinary differential equation (ODE), matrix exponential, and a novel step-doubling method for the discretization of LQ-OCPs. Utilizing Euler-Maruyama discretization with a fine step, we reformulate the costs of continuous-time stochastic LQ-OCPs into a quadratic form, and show that the stochastic cost follows the $\chi^2$ distribution. In the numerical experiment, we test and compare the proposed numerical methods. The results ensure that the discrete-time LQ-OCP derived using the proposed numerical methods is equivalent to the original problem.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Numerical Discretization Methods for Linear Quadratic Control Problems with Time Delays
This paper presents the numerical discretization methods of the continuous-time linear-quadratic optimal control problems (LQ-OCPs) with time delays. We describe the weight matrices of the LQ-OCPs as differential equatio…
Model Predictive ControlIterative Linear Quadratic Regulator With Variational Equation-Based Discretization
This paper discusses discretization methods for implementing nonlinear model predictive controllers using Iterative Linear Quadratic Regulator (ILQR). Finite-difference approximations are mostly used to derive a discrete…
Continuous-time iterative linear-quadratic regulator
We present a continuous-time equivalent to the well-known iterative linear-quadratic algorithm including an implementation of a backtracking line-search policy and a novel regularization approach based on the necessary c…
Numerical IntegrationUniversal approximation with signatures of non-geometric rough paths
We establish a universal approximation theorem for signatures of rough paths that are not necessarily weakly geometric. By extending the path with time and its rough path bracket terms, we prove that linear functionals o…
A Fourier interpolation method for numerical solution of FBSDEs: Global convergence, stability, and higher order discretizations
The convolution method for the numerical solution of forward-backward stochastic differential equations (FBSDEs), introduced in [21], uses a uniform space grid. In this paper we utilize a tree-like spatial discretization…
Spatial Interpolation