Differential dynamic programming and Newton's method for discrete optimal control problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 3325181 (Why is no real title available?)
- scientific article; zbMATH DE number 3354103 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Maximum Principle of the Pontryagin Type for Systems Described by Nonlinear Difference Equations
- A new approach to differential dynamic programming for discrete time systems
- Algorithms and computational techniques in differential dynamic programming
- Convergence rate analysis of the state increment dynamic programming method
- Principles and procedures of numerical analysis
- The application of optimal control methodology to nonlinear programming problems
Cited in
(16)- A quasi-Newton differential dynamic programming algorithm for discrete- time optimal control
- Some efficient algorithms for unconstrained discrete-time optimal control problems
- Adaptive importance sampling for control and inference
- Dynamic programming method for constrained discrete-time optimal control
- Efficient sequential quadratic programming implementations for equality-constrained discrete-time optimal control
- A sparsity preserving convexification procedure for indefinite quadratic programs arising in direct optimal control
- On Pantoja's problem allegedly showing a distinction between differential dynamic programming and stagewise Newton methods
- Newton's method, Bellman recursion and differential dynamic programming for unconstrained nonlinear dynamic games
- Differential dynamic programming and Newton's method
- Cheap Newton steps for optimal control problems: automatic differentiation and Pantoja's algorithm
- Computational aspects of discrete-time optimal control
- Application of multiobjective dynamic programming to regional natural resource management
- Sequential quadratic programming algorithm for discrete optimal control problems with control inequality constraints
- A continuous implementation of a second-variation optimal control method for space trajectory problems
- Discrete LQR and ILQR methods based on high order Runge-Kutta discretizations
- An introduction to trajectory optimization: how to do your own direct collocation
This page was built for publication: Differential dynamic programming and Newton's method for discrete optimal control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1053982)
