Midcourse Guidance Trajectory Optimization of Interceptor Missile Based on Sequential Convex Programming

Abstract

Aiming at the trajectory optimization problem of interceptor midcourse guidance under strong nonlinear multi-constraint conditions, a trajectory optimization algorithm for fixed time constraints is proposed based on sequential convex programming method and capture region. Sequential convex optimization method has high computational efficiency for solving complex polynomials. However, in trajectory optimization problems, the strong nonlinearity of control variables and the convergence difficulty of fixed time terminal constraints are two main difficulties. Firstly, the problem is transformed into an affine system by using affine variables, and the affine system is convexized and discretized to solve the nonlinearity. Then, aiming at the problem that terminal constraints are difficult to converge in a fixed time, a weighted relaxation method of terminal constraints is proposed to transform the midcourse guidance problem into a sequence convex programming problem. The simulation results show that the proposed algorithm can quickly generate the midcourse guidance trajectory of interceptor that meets multiple constraints.

Keywords

• |sequence convex programming|midcourse guidance|trajectory optimization|capture region|multiple constraints|hypersonic|interceptor