Convex approach to three-dimensional launch vehicle ascent trajectory optimization

This paper deals with the optimization of the ascent trajectory of a multistage launch vehicle, from liftoff to the payload injection into the target orbit, considering inverse-square gravity acceleration and aerodynamic forces. A combination of lossless and successive convexification techniques is adopted to generate a sequence of convex problems that rapidly converges to the original problem solution. An automatic initialization strategy is proposed to make the solution process completely autonomous. In particular, a novel three-step continuation procedure is developed and proved to be more efficient than simpler strategies. This approach relies on the solution of intermediate problems, which either neglect atmospheric drag or fix the time-lengths of the launch vehicle ascent phases, that are solved in succession, gradually passing from easier instances of the optimization problem to the originally intended problem. State-of-the-art techniques to deal with such a complex problem are adopted to enhance the convergence rate, including safeguarding modifications, such as virtual controls and an adaptive trust region. To assess the validity of the proposed approach in a practical scenario, numerical results are presented for two representative practical applications, using as reference a Falcon 9 launch vehicle.