Application of Sequential Convex Optimization in the Spacecraft Aero-Assisted Orbital Transfer Problem

An algorithm based on sequential convex optimization (SCP) is introduced to facilitate the fast and efficient solution of a spacecraft aero-assisted orbital transfer problem. Firstly, an optimal model for this problem is formulated. Given the discontinuity of aerodynamic force, uniform discretization is applied, and the terminal time is used as a control variable. To convexify the optimal model, the spacecraft's equations of motion are linearized, and path constraints are convexified. Based on SCP, the detailed procedure for the solution of the spacecraft aero-assisted orbital transfer problem is outlined. Numerical simulations demonstrate that the efficiency and robustness of the sequential convex optimization are superior to that of the pseudo-spectral method.