A Convex Programming Method for Rocket Powered Landing With Angle of Attack Constraint

Real time trajectory planning is vital in rocket precision powered landing guidance. Due to the nonconvex angle of attack (AOA) constraint and other constraints, including nonlinear dynamics and thrust constraint, the powered landing trajectory planning problem is highly nonconvex, which makes it difficult to be solved in real time via existing nonconvex optimization algorithms. As the main contribution of this paper, the AOA constraint is taken into account in the problem. A convex feasible set method is presented to handle it, in which a quadratic concave function is introduced to find a convex feasible subset in the original AOA constraint and the second order term of this function is estimated by Gersgorin disc theorem. For the remaining nonconvexities, the lossless convexification is employed to address the thrust constraint, and the successive linearization is performed to handle the nonlinear dynamics. Thus, a convex optimization problem with AOA constraint for landing trajectory planning is built. The optimal solution to the original problem is obtained by iteratively solving convex problems. Numerical simulations show that the proposed method can find a feasible landing trajectory where the AOA constraint is satisfied and has a better convergence performance compared with the traditional linearization method.