Application of the steepest ascent optimization method to a reentry trajectory problem

Abstract

The direct optimization method is presented in detail. Nominal values of the control variables are input parameters. Perturbations are introduced into the control variables and the resulting first order predictions of changes in the payoff, and constraint functions are then determined. Through a sequence of prescribed cycles, a trajectory is eventually obtained which is reasonably close to the optimum. The method is successfully applied to an Apollo three-dimensional reentry problem. The study of this Apollo application problem has resulted in the development of a highly flexible computer program that can be modified to consider other trajectory optimization problems.