Midcourse Guidance via Variable-Discrete-Scale Sequential Convex Programming

Jinlin Zhang

doi:10.3390/aerospace12110952

2025-10-24

DOI：10.3390/aerospace12110952

原文链接

原文求助

摘要

En 中文

To address the challenges of strong nonlinearity, stringent terminal constraints, and the trade-off between computational efficiency and accuracy in the midcourse guidance trajectory optimization problem of aerodynamically controlled interceptors, this paper proposes a variable-discrete-scale sequential convex programming (SCP) method. Firstly, a dynamic model is established by introducing the range domain to replace the traditional time domain, thereby reducing the approximation error of the planned trajectory. Second, to overcome the critical issues of solution space restriction and trajectory divergence caused by terminal equality constraints, a terminal error-proportional relaxation approach is proposed. Subsequently, an improved second-order cone programming (SOCP) formulation is developed through systematic integration of three key techniques: terminal error-proportional relaxation, variable trust region, and path normalization. Finally, an initial trajectory generation algorithm is proposed, upon which a variable-discrete-scale optimization framework is constructed. This framework incorporates a residual-driven discrete-scale adaptation mechanism, which balances discretization errors and computational load. Numerical simulation results indicate that under large discretization scales, the computation time required by the improved SOCP is only about 5.4% of that of GPOPS-II. For small-discretization-scale optimization, the SCP method with the variable discretization framework demonstrates high efficiency, achieving comparable accuracy to GPOPS-II while reducing the computation time to approximately 7.4% of that required by GPOPS-II.

Keyword:

sequential convex programming

midcourse guidance

variable-discrete-scale

range domain

terminal error-proportional relaxation