Answers are grounded in this paper and cite their sources.
Demonstrates global convergence in discrete-time optimal control, suggesting improved algorithmic efficiency.
The differential dynamic programming algorithm (DDP) and the stagewise Newton procedure are two typical examples of efficient local procedures for discrete-time optimal 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 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 presented to compare these algorithms and the Coleman-Liao algorithm.
No takes yet. Share an insight, caveat, or question.
Aiping Liao (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: