Discrete LQR and ILQR methods based on high order Runge-Kutta discretizations
From MaRDI portal
Publication:2085658
Abstract: In this paper, discrete linear quadratic regulator (DLQR) and iterative linear quadratic regulator (ILQR) methods based on high-order Runge-Kutta (RK) discretization are proposed for solving linear and nonlinear quadratic optimal control problems respectively. As discovered in [W. Hager, Runge-Kutta method in optimal control and the discrete adjoint system, Numer. Math.,2000, pp. 247-282], direct approach with RK discretization is equivalent with indirect approach based on symplectic partitioned Runge-Kutta (SPRK) integration. In this paper, we will reconstruct this equivalence by the analogue of continuous and discrete dynamic programming. Then, based on the equivalence, we discuss the issue that the internal-stage controls produced by direct approach may have lower order accuracy than the RK method used. We propose order conditions for internal-stage controls and then demonstrate that third or fourth order explicit RK discretization cannot avoid the order reduction phenomenon. To overcome this obstacle, we calculate node control instead of internal-stage controls in DLQR and ILQR methods. And numerical examples will illustrate the validity of our methods. Another advantage of our methods is high computational efficiency which comes from the usage of feedback technique. In this paper, we also demonstrate that ILQR is essentially a quasi-Newton method with linear convergence rate.
Recommendations
- Runge-Kutta discretizations of optimal control problems
- Higher-order approximations of linear control systems via Runge-Kutta schemes
- Implicit-explicit Runge-Kutta schemes for numerical discretization of optimal control problems
- Application of implicit-explicit high order Runge-Kutta methods to discontinuous-Galerkin schemes
- scientific article; zbMATH DE number 3849957
- scientific article; zbMATH DE number 1070387
- scientific article; zbMATH DE number 1664845
- scientific article; zbMATH DE number 1264473
- Inexact restoration for Runge-Kutta discretization of optimal control problems
- On high order strong stability preserving Runge-Kutta and multi step time discretizations
Cites work
- Collocation at Gauss Points as a Discretization in Optimal Control
- Computation of order conditions for symplectic partitioned Runge-Kutta schemes with application to optimal control
- Consistent Approximations for Optimal Control Problems Based on Runge–Kutta Integration
- Differential dynamic programming and Newton's method for discrete optimal control problems
- Discrete mechanics and optimal control: An analysis
- Explicit Stabilized Integrators for Stiff Optimal Control Problems
- Geometric Numerical Integration
- scientific article; zbMATH DE number 3999169 (Why is no real title available?)
- Iterative linearization methods for approximately optimal control and estimation of non-linear stochastic system
- Linear multistep methods for optimal control problems and applications to hyperbolic relaxation systems
- Numerical Methods for Ordinary Differential Equations
- Numerical Optimization
- Optimality, stability, and convergence in nonlinear control
- Runge-Kutta methods in optimal control and the transformed adjoint system
- Second-Order Runge--Kutta Approximations in Control Constrained Optimal Control
- Solving Ordinary Differential Equations I
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Survey of Numerical Methods for Trajectory Optimization
- Symplectic Runge-Kutta discretization of a regularized forward-backward sweep iteration for optimal control problems
- Symplectic Runge-Kutta schemes for adjoint equations, automatic differentiation, optimal control, and more
Cited in
(3)
This page was built for publication: Discrete LQR and ILQR methods based on high order Runge-Kutta discretizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2085658)
