A quasi-Newton differential dynamic programming algorithm for discrete- time optimal control
discrete-time optimal control problemsglobal convergencequasi-Newton differential dynamic programming algorithmsuperlinear convergence rate
Dynamic programming in optimal control and differential games (49L20) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Dynamic programming (90C39) Methods of reduced gradient type (90C52) Nonlinear systems in control theory (93C10) Discrete-time control/observation systems (93C55)
We develop a quasi-Newton differential dynamic programming algorithm (QDDP) for discrete-time optimal control problems. In the spirit of dynamic programming, the quasi-Newton approximations are performed in a stagewise manner. We establish the global convergence of the method and also show a superlinear convergence rate. Among other advantages of the QDDP method, second derivatives need not be calculated. In theory, the computational effort of each recursion grows proportionally to the number of stages N, whereas with conventional quasi-Newton techniques which do not take advantage of the optimal control problem structure, the growth is as \(N^ 2\). Computational results are also reported.
- Algorithms and computational techniques in differential dynamic programming
- Differential dynamic programming and Newton's method
- Differential dynamic programming technique for optimal control
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory
- Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
- A new approach to differential dynamic programming for discrete time systems
- Computational aspects of discrete-time optimal control
- Convergence rate analysis of the state increment dynamic programming method
- Differential dynamic programming and Newton's method for discrete optimal control problems
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3325181 (Why is no real title available?)
- The application of optimal control methodology to nonlinear programming problems
- Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
- The DQR algorithm, basic theory, convergence, and conditional stability
- Efficient sequential quadratic programming implementations for equality-constrained discrete-time optimal control
- An efficient trust region method for unconstrained discrete-time optimal control problems
- On Pantoja's problem allegedly showing a distinction between differential dynamic programming and stagewise Newton methods
- Algorithms and computational techniques in differential dynamic programming
- scientific article; zbMATH DE number 5016566 (Why is no real title available?)
- Sequential rank-one/rank-two updates for quasi-newton differential dynamic programming
- scientific article; zbMATH DE number 3990215 (Why is no real title available?)
- scientific article; zbMATH DE number 4095244 (Why is no real title available?)
- Differential dynamic programming technique for optimal control
- Computational aspects of discrete-time optimal control
This page was built for publication: A quasi-Newton differential dynamic programming algorithm for discrete- time optimal control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092853)