Convex Programming-based Optimal Three-Dimensional Mid-course Guidance with Lossless Convexification

Abstract

The problem of optimal mid-course guidance of boost-glide missiles is studied. The final velocity is maximized with sequential second-order cone programming (SOCP). First, the missile flight phase is divided into boost and glide phases. Since the flight time of the glide phase is not fixed, this phase is reformulated using a new independent variable and the original problem is converted to a fixed final time problem. Then, dynamics is converted to input-affine form and partially linearized. To reduce an oscillation of input profiles, lossless convexification is performed to input terms consisting of a total angle-of-attack and bank angle. And the modified trust-region method is applied for robust convergence of solution with a roughly guessed initial trajectory.