Some Efficient Algorithms for Unconstrained Discrete-time Optimal Control Problems
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Authors
Abstract
The differential dynamic programming algorithm (DDP)and the stagewise Newton procedure are two typical examples of efficient local procedures for discrete-timeoptimal control (DTOC) problems. It is desirable to generalize these local procedures to globally convergent methods. One successful globalization was recently proposed by Coleman and Liao [3] which combines the trust region idea with Pantoja's stagewise Newton procedure. In this paper, we propose several algorithms for DTOC problems which combine a modified "dogleg" algorithm with DDP or Pantoja's Newton procedure. These algorithms possess advantages of both the dogleg algorithm and the DDP or the stagewise procedure, i.e.,they have strong global and local convergence properties yet remain economical. Numerical results are presentedto compare these algorithms and the Coleman-Liao algorithm.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1993-11
Publisher
Cornell University
Keywords
theory center
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.tc/93-159
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report