Penetration trajectory optimization for the hypersonic gliding vehicle encountering two interceptors

TL;DR

This paper develops a novel optimization method for hypersonic gliding vehicles to evade two interceptors, transforming a complex control problem into a solvable SOCP form, verified through simulations.

Contribution

It introduces a new penetration strategy using only initial LOS angle data and a successive SOCP method with trust regions for efficient trajectory optimization.

Findings

Successfully evades two interceptors in simulations

Balances time and optimality effectively

Transforms nonconvex control problem into SOCP for practical solving

Abstract

The penetration trajectory optimization problem for the hypersonic gliding vehicle (HGV) encountering two interceptors is investigated. The HGV penetration trajectory optimization problem considering the terminal target area is formulated as a nonconvex optimal control problem. The nonconvex optimal control problem is transformed into a second-order cone programming (SOCP) problem, which can be solved by state-of-the-art interior-point methods. In addition, a penetration strategy that only requires the initial line-of-sight angle information of the interceptors is proposed. The convergent trajectory obtained by the proposed method allows the HGV to evade two interceptors and reach the target area successfully. Furthermore, a successive SOCP method with a variable trust region is presented, which is critical to balancing the trade-off between time consumption and optimality. Finally, the effectiveness and performance of the proposed method are verified by numerical simulations.