Sequential Convex Programming for Reentry Trajectory Optimization Utilizing Modified hp-Adaptive Mesh Refinement and Variable Quadratic Penalty

Abstract

Due to the strong nonlinearity in the reentry trajectory planning problem for reusable launch vehicles (RLVs), the scale of the problem after high-precision discretization can become significantly large, and the non-convex path constraints are prone to exceed limits. Meanwhile, the objective function oscillation phenomenon may occur due to successive convexification, which results in poor convergence. To address these issues, a novel sequential convex programming (SCP) method utilizing modified hp-adaptive mesh refinement and variable quadratic penalty is proposed in this paper. Firstly, a local mesh refinement algorithm based on constraint violation is proposed. Additional mesh intervals and mesh points are added in the vicinity of the constraint violation points, which improves the satisfaction of non-convex path constraints. Secondly, a sliding window-based mesh reduction algorithm is designed and introduced into the hp-adaptive pseudospectral (PS) method. Unnecessary mesh intervals are merged to reduce the scale of the problem. Thirdly, a variable quadratic penalty-based SCP method is proposed. The quadratic penalty term related to the iteration direction and the weight coefficient updating strategy is designed to eliminate the oscillation. Numerical simulation results show that the proposed method can strictly satisfy path constraints while the computational efficiency and convergence of SCP are improved.