Work

An efficient algorithm for optimum trajectory computation

Year: 1970
Type: conference-abstract
Abstract: This paper describes a variation to the steepest-descent method for generating optimum trajectories. The steepest-descent approach to trajectory optimization was formulated by Kelley, Bryson et al., for numerically solving a variety of two-point boundary-value problems. The procedure is iterative, requiring repeated forward numerical integrations of the state differential equations and backward integrations of the adjoint equations. In many applications, however, convergence was slow; thus, several techniques for speeding convergence were devised.
Language: English
Open Access status: bronze
OpenAlex ID: W2008999033
Cites: 7
Cited by: 2
Related to: 10