Entry Trajectory Optimization via hp Pseudospectral Convex Programming

In this paper, a hp pseudospectral sequential convex programming (hp-PSCP) method is proposed to solve the entry trajectory optimization problem. The hp flipped Radau pseudospectral method (FRPM) is utilized to discretize the nonlinear dynamics. By successive linearization technology and introducing new variables, the optimization problem is converted into a series of convex problems and solved by primal-dual interior-point method. Numerical results show that the proposed method provides a good compromise between computational accuracy and speed compared to existing convex methods.