Optimal Rocket Trajectories using Gradient Methods

摘要

The problem of optimizing the trajectories of maneuvering rockets isconsidered. The optimization objectives are the maximal range or theminimal control effort for a given range. The gradient method in functionspace is revisited and applied to solve the problem with and without stateand path constraints. The method is shown to provide implementable andfast algorithms for to approximate the optimal solutions. It does notrequire any non-linear programming solver, and can be straightforwardlyprogrammed in a flight computer. The method can also be used toprovide an initial guess for more precise techniques, thus accelerating thecomputational process.