Answers are grounded in this paper and cite their sources.
Second-variation methods for computing optimal control exhibit more rapid convergence than first-variation methods but at the exponse of vastly increased computing effort. In this paper two second-order algorithms for determining optimal control are derived using the notion of differential dynamic programming, which is also used to re-derive the well known second-variation method. This unified treatment allows the differences between the three algorithms to be studied in detail. It is shown that the second-order algorithms are more accurate than the second-variation method and, moreover, that one of these algorithms is simpler to implement.
No takes yet. Share an insight, caveat, or question.
D. Jacobson (1968) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: