DIFFERENTIAL DYNAMIC PROGRAMMING FOR SOLVING NONLINEAR PROGRAMMING PROBLEMS
Abstract
No abstract recorded for this item.
Similar items
Differential Dynamic Programming for Solving Nonlinear Programming Problems
Dynamic programming is one of the methods which utilize special structures of large-scale mathematical programming problems. Conventional dynamic programming, however, can hardly solve mathematical programming problems with many constraints. This paper proposes differential dynam
A Robust Algorithm for Solving Nonlinear Programming Problems
In this paper, we introduce a new algorithm for solving nonlinear programming (NLP) problems. It is an extension of Guo’s algorithm[1] which possesses enhanced capabilities for solving NLP problems. These capabilities include: a) advancing the variable subspace, b) adding a searc
Modified Constrained Differential Evolution for Solving Nonlinear Global Optimization Problems
Nonlinear optimization problems introduce the possibility of multiple local optima. The task of global optimization is to find a point where the objective function obtains its most extreme value while satisfying the constraints. Some methods try to make the solution feasible by u
A Hybrid Differential Dynamic Programming Algorithm for Constrained Optimal Control Problems. Part 2: Application
In the first part of this paper series, a new solver, called HDDP, is presented for solving constrained, nonlinear optimal control problems. In the present paper, the algorithm is extended to include practical safeguards to enhance robustness, and four illustrative examples are u
From Zeroing Dynamics to Zeroing-Gradient Dynamics for Solving Tracking Control Problem of Robot Manipulator Dynamic System with Linear Output or Nonlinear Output
With the vigorous development of mechanical intelligence in industrial manufacturing, tracking control dynamic systems have been widely applied many aspects industry. In this paper, we present one theorem to discuss validity condition a ZD model with order-n for solving problem n
Differential Dynamic Programming and Newton's Method for Discrete Optimal Control Problems I
The purpose of this paper is to draw a detailed comparison between Newton's method, as applied to discrete-time, unconstrained optimal control problems, and the second-order method known as differential dynamic programming (DDP). The main outcomes of the comparison are: (i) DDP d