The evasion maneuver problem of hypersonic vehicles differs from those of ballistic missiles and other traditional weapons, showing distinctive properties including expansive maneuver range and weak maneuverability. How to avoid the disadvantage of low available overload and ensure follow-up tasks are the main concerns of the hypersonic penetration. This paper presents a penetration trajectory optimization algorithm for an air-breathing hypersonic vehicle, where the prerequisite penetration condition is analyzed and control costs are chosen as an objective function to minimize the fuel consumption and maneuver range. This paper focuses on how to formulate the complex, highly constrained nonconvex penetration problem to be a sequence of easily solved second-order cone programming through a combination of successive linearization and relaxation techniques. Innovation lies in the raising of the penetration angle and the relaxation technique of nonlinear and nonconvex elements. Various numerical simulations are conducted to verify the validity of penetration condition and to demonstrate that the proposed method is effective and has a good computational performance irrespective of initial guesses.

1. Introduction

Since the hypersonic vehicles have arrived, the attack and defense countermeasure game centered on it receives the focal attention by various military powers. The air-breathing hypersonic vehicle cruises at the altitude of the near space, featuring a lasting and wide-range maneuverability. But owing to the usage of the unique integrated propulsion technology and the scramjet engine [1], strict constraints are also imposed on its maneuverability, including the attack angle and bank angle [2, 3]. Therefore, the hypersonic penetration possesses characteristics of a “wide maneuvering range, weak maneuverability, and high flight speed.” Besides, the prominent infrared features of hypersonic vehicles make it easily to be detected and intercepted. Consequently, how to make maximal use of the speed superiority and achieve penetration with minimal energy consumption are the core of hypersonic penetration programming.

In the confrontation, the hypersonic vehicle and the interception missile maneuver actively and simultaneously, thus always regarded as a complicated gaming problem. With the game theory, differential gaming models are established. Shaferman and Shima [4, 5] studied the zero-sum differential game theory, the quadratic differential game theory, and various other forms of differential game and analyzed the conditions in which the saddle points of the differential game exist. However, most of studies of differential game theory focus on mathematical modeling and theoretical derivation, while its application to practical engineering remains a challenge [6]. Considering the huge speed gap, the game problem between a hypersonic vehicle and an interception missile is not like the normal one. In other words, only when harsh interception conditions are satisfied can the interceptor succeed. Accordingly, Dwivedi et al. [7] presented a midcourse guidance law against high-speed targets believing that alignment angle constraints in both elevation and azimuth could create a favorable condition for the terminal guidance while Guo et al. [8] tried to guide a hypersonic vehicle to break the alignment angle of the interceptor from an opponent view; thus, they converted the penetration problem into an optimal control problem.

In fact, using optimal control techniques for guidance of flight vehicles is not new. Numerical methods, like the shooting method [9], the gradient method [10], and the recently prominent one, the pseudospectral method [11, 12], have been developed to solve two-point boundary value problems (TPBVPs) derived from optimal problems. However, all of them lead to large computations that are infeasible to implement in real time. Other contributions have also been proposed in this regard, such as the model predictive control (MPC) theory [13] combined with approximate dynamic programming (APC) and model predictive static programming (MPSP) [7, 8]. The former one has been successfully used in the industry (especially in slow-varying process control) but is not guaranteed to remain optimal and stable for its sliding time window [13, 14]. As to MPSP which is rather efficient and adaptable, however, when applied to the hypersonic vehicle, it is also not a preferable method since it cannot properly solve the optimal problems with control constraints.

This paper is aimed at designing a rapid penetration method to generate an appropriate evasion trajectory of a hypersonic vehicle against a head-on intercepting missile. According to the above content, the main two barriers of this problem are an explicit expression of penetration condition and a rapid, robust optimization algorithm catering both terminal angular constraints and the demanding control constraints of hypersonic vehicles. About the former, this paper introduces the concept of the penetration angle on the basis of interception geometry, giving the clear formula of penetration condition. The validity of the condition is also verified by the numerical simulation in terms of the ultimate miss distance under different penetration angles. As to the feasible optimization method, this paper raises a method based on sequential convex programming, which could meet the control constraints as well as the penetration angle constraints in a short time, and compared with the existing optimal method GPM, the algorithm proposed in this paper has a very competitive convergence rate and does not require good initial guesses.

Convex optimization has been widely utilized in recent years for its unique theoretical advantages and the polynomial time complexity [15, 16]. However, applications of convex optimization in aerospace trajectory planning have been limited to problems without complex nonlinear dynamics and aerodynamic forces so far. This paper is mainly devoted to this difficulty in the penetration application. The technique developed in this paper successfully “convexifies” the initial nonconvex penetration problem into a series of second-order cone programming (SOCP) problems. Various convexity strategies are applied to different nonconvex elements. The SOCP-based method proves to be a very robust and rapid tool for hypersonic penetration trajectory optimization. Numerical results are provided to demonstrate the effectiveness and some of the noteworthy aspects of the method.

The rest of this paper is organized as follows. In Section 2, the countermeasure model is established, including the hypersonic vehicle model, the interceptor model, and the relative motion model, and thus, the original form of penetration problem is described. In Section 3, the convexification process is explained in detail and the converted SOCP problem is presented. Numerical simulation results are presented in Section 4. Finally, some conclusions are drawn in Section 5.

2. Mathematical Model for Attack and Defense Countermeasure

The primary objective of this paper is to present an effective penetration guidance logic. Hence, considering solving speed and application feasibility, one only requires point mass mathematical models for both the vehicle and the interception missile. Moreover, with the complex high-fidelity model, the calculation of Jacobi matrices presented in Section 3 will be boosted. Therefore, it is crucial to formulate the penetration problem in a certain simplified way conducive to the SOCP approach. This section presents the details of one such formulation of the problem.

2.1. Dynamics of the Hypersonic Vehicle

The penetration maneuver of a hypersonic vehicle is a short-range trajectory optimization problem; for this reason, we simplify its kinematic equation sets as follows: (a)With the rotation of the Earth not taken into account, namely, ignoring the Coriolis acceleration and convective acceleration(b)Assuming that the Earth is flat, namely, ignoring the influence of its centrifugal force

And as is mentioned above, this paper pays most of its attention to the trajectory programming; therefore, the mass point model is established and some simplifications of the vehicle’s thrust and aerodynamic forces are conducted.

Thus, we obtain the following equations of the mass point motion model of the hypersonic vehicle: where is the altitude of the hypersonic vehicle; is the speed; and represent the flight path angle and trajectory deflection angle; and are the angle of attack and bank angle; , and are its aerodynamic force and thrust; is its mass; is its mass consumption rate.

The thrust model, the aerodynamic force model, and the control constraints are as follows: where and represent the boundaries of attack of the angle while and represent the upper limits of the bank angle rate and mass consumption rate, respectively.

2.2. Dynamics of the Interception Missile

For the midcourse guidance of an interception missile against a high-speed target, it is desirable to shape the missile trajectory that provides a preferable initial state for terminal attack. Instead of the guidance laws carried out according to the nonlinear theory and the MPSP algorithm, whose practicability are always restricted in application, this paper utilizes a more compendious and feasible guidance law called the trajectory shaping guidance law [17, 18].

The trajectory shaping guidance law has been developed to travel to the desired trajectory and verified by physical applications, such as landing the Apollo spacecraft on the moon. The guidance law appears to be a form of augmented proportional navigation plus an extra term that is proportional to the difference between the line of sight angle and the desired angle at the end of flight. The application formula for this paper is as follows: where and are the flight path angle and the trajectory deflection angle; and are the line of sight (LOS) angle in elevation and azimuth, respectively. Figure 1 shows explicit geometric meaning; are the constants of the guidance law, where is the remaining flight time.

2.3. Attack and Defense Countermeasure Analysis

Under usual circumstances, the speed of a hypersonic vehicle is much higher than that of a defense system. Hence, only the head-on strike by an interception missile can impose a threat to the hypersonic vehicle. Through reasonable assumptions and simplifications, the interception geometry is established, and thus, one can gain the interception missile’s attack area. The attack area is a round spherical surface that includes the interception missile but excludes the hypersonic vehicle, and its boundary is tangent to the hypersonic vehicle, as shown in Figure 2. See reference [19] for specific derivation processes.

It is known from interception geometry that if the velocity vector of the hypersonic vehicle is always outside of the interception geometric tangent line, namely, , then it can break through the head-on strike situation of the interception missile, achieving a successful penetration [20].

is defined as the penetration angle of the hypersonic vehicle, namely, the angle between the line-of-sight and the velocity of the hypersonic vehicle. Its cosine value can be obtained with the transformation matrices of the ground-trajectory coordinate system and the ground-LOS coordinate system. The relationship can be formulated as follows:

2.4. Mathematical Model of Relative Motions

With the penetration angle constraints taken into consideration, the model of relative motion between the hypersonic vehicle and the interception missile is established under the LOS coordinate system. The spatial coordinates and relative kinetics in the attack and defense countermeasure are shown in Figure 1.

The relative motions are defined by the following equations: where are the relative distance, the LOS elevation angle, and the LOS azimuth angle between the hypersonic vehicle and the interception missile.

2.5. Hypersonic Vehicle’s Penetration Problem

Taking the minimum control as the objective function and the penetration angle constraint into consideration, the hypersonic vehicle’s penetration problem can be described as an optimal control problem : where the control vector is ; represents the state vector.

3. Penetration Problem Convexification

The hypersonic penetration problem has nonlinear inequation constraints and other nonconvex factors brought about by the quadratic integral objective function, nonlinear differential equation constraints, and penetration angle constraints. Therefore, how to transform the penetration problem into a convex problem that can be easily solved is crucial for applying a convex optimization algorithm. The following section will explain in some detail the processes.

3.1. Linearization and Discretization of Dynamics Equations

The nonlinear differential equations are approximated by a series of linear time-varying systems, and the solution sequence of linear systems, through several iterations, will be convergent to the optimal solution of the original system [21].

For simplicity of notation, the nonlinear state equation is expressed as follows:

In the form of state correlation coefficient, the nonlinear state equations can be presented as follows: where and are the Jacobi matrices of the state function in terms of and . If the above equations meet the local Lipschitz condition, then the solution of the nonlinear state equation can be approximated with the following linear time-varying equation: where and denote the values of the state variable and control variable in the times of iteration.

The sequences of solutions obtained through solving the above linear time-varying equations converge to the solutions of original nonlinear equations [22], namely,

To ensure the effectiveness of state equation linearization, we add thrust domain constraints to state variables. where denotes the solution of state variables in the times of iteration; denotes the trust threshold value and is a constant vector.

What follows is the discretization of the linearized state equation, but before discretization, it is imperative to confirm the optimization range and discrete points. We choose the relative distance as the independent variable of the hypersonic vehicle’s penetration problem under investigation in this paper. The work has the following advantages: (1) compared with the separate state of the hypersonic vehicle and the interception missile at a certain moment, we are more concerned about the attack and defense countermeasure in terms of a certain relative distance and (2) if we use time as an independent variable, the appearance of uncertain terminal time will make the optimal control problem more complicated. With the relative distance served as the independent variable, the final value of can be assumed to be the ending point of midcourse guidance of the interception missile. Thus, the terminal penetration angle constraint can also be determined.

Accordingly, and are chosen as the optimization range of the penetration problem and the problem is discretized by numbers of discrete points whose intervals are equal. Thus, the discrete step length is . Firstly, we discretize the state variable and the control variable on discrete points, namely, . Then according to the trapezoidal formula, we perform the mathematical integration of the sequentially linearized state equation (namely, equation (9)) with the following formula: where , , and .

Equation (12) is further represented as follows: where , , , and ; the number of dimensions of unit matrix is in agreement with that of coefficient matrix .

All the variables to be optimized are unitarily represented as optimized vector ; the linearly discretized state equations are written into the expressions related to : where

It should be pointed out that the first line of equation in the equality constraints (namely, equation (14)) obtained through linearizing the initial state constraint .

3.2. Control Constraint Convexification

The original problem has control constraints with the angle of attack, bank angle, and mass consumption rate. The constraints on both the angle of attack and the mass consumption rate are all linear constraints while the constraint on the bank angle is nonlinear and handled in the following ways: the bank angle rate is introduced as a control variable, namely, , and the state variable is also added to the differential function.

3.3. Penetration Angle Constraint Convexification

The interception missile is assumed to use the head-on interception method, and the angles and formed by the missile’s line of sight and the hypersonic vehicle’s velocity vector are less than 45 degrees. Therefore, we perform the following slackening on formula (4):

The nonlinear inequality constraint is then transformed into the concave inequality constraint:

To show that equation (17) is a concave inequation constraint, we further transform the left hand-side term of the inequation into the following:

According to the abovementioned assumptions and , the value ranges of the two cosine functions at the left side of equation (18) are all in ; within this scope, the cosine function is a concave function. Refer to the compound affine mapping theorem and the vector compound theorem [23] in the convex optimization theory. Equation (17) is deduced to be a concave inequation constraint.

Similar to the differential equation convexification method, the concave inequation constraint can also be approximated with the sequential linearization; the sequential linearization of a concave inequation has already been proved to be able to converge to its optimal solutions [24]. The formula for sequentially linearizing the penetration angle constraint is as follows: where

, , , and denote the solutions of the times of iteration; the linearized residual error is as follows:

Thus, the penetration angle constraint is represented in the form of terminal state constraint qualification, namely, where the coefficient matrix is obtained with sequential linearization equation (19).

3.4. Objective Convexification

Through introducing the intermediate variable , the quadratic performance index in problem can be equivalently discretized into the following: where is obtained with the square root matrix decomposition formula, namely, .

So far, through slackening, sequentially linearizing, and discretizing objective functions, differential equations, and nonlinear inequations, the original penetration problem is transformed into a convex problem in its discrete form, noted as problem : where is a 2 norm; .

Problem is a sort of convex problem named second-order cone problem (SOCP), with a linear objective function and all convex constraints including linear constraints and second-order cone constraints. The optimal solution of the original penetration problem can be obtained through iteratively solving problem . Each iteration process uses solution of the last iteration to update problem , constantly solves problem within a thrust domain, and gradually approximates the optimal solution of problem till . Then the optimization algorithm converges and obtains optimal solutions.

4. Numerical Demonstrations

4.1. Settings of Simulation Parameters

The basic parameters and the relevant simulation parameter settings in the attack and defense countermeasure simulation model of the hypersonic vehicle are given in Tables 1 and 2. The boundary values in the control constraints are set as , , , and ; the boundary value in the penetration angle constraints is set as .

Simulation conditions are set as follows: in the first iteration, control guesses are set to , the number of discrete points is set as , and the thrust domain constraint values in the formula are set as follows:

The error threshold values in the simulation iteration termination condition are set as follows:

The above simulation conditions are used to perform numerical simulation with the YALMIP modeling environment of MATLAB; the primal-dual interior point algorithm in the MOSEK [25] software package is used to solve the SOCP problem. After five times of sequential iteration, the trajectory converges. The time required by each iteration is around 0.4 s; the resolving time required by the interior point algorithm is around 0.2 s. The penetration angle and the hypersonic vehicle’s angle of attack calculated by the first four iterations are shown in Figures 3 and 4. The figures show that the sequential convex optimization algorithm converges quickly; the angle-of-attack value solved in the second iteration is already close to the ultimate optimal solution.

In addition, in order to validate the effectiveness of the second-order cone programming (SOCP) method proposed in the paper, numerical results are compared with those obtained by the Gaussian pseudospectral method (GPM). The GPM solves the problem with the sequential quadratic programming (SQP), and we program it by the GPOPS5.1 software package [26].The GPM has already been proved to obtain its globally optimal solution [27].

The trajectory profile by the SOCP-based method and the GPM (the mesh tolerance is set to 10-3) are shown in Figures 57, while the solving times required and optimal performance indexes are given in Table 3. Figure 8 presents the required calculating time of the two methods using different random control initial guesses within control constraints; the horizontal axis only represents the number of initial guesses without any specific physical meaning.

Based on the figures, the SOCP and GPM solutions show very similar trends; the control profiles in Figures 57 match well in general. The relatively small differences between the two methods are attributable to the different discretization strategies used in the two solutions, which also occur in reference [28]. On the other hand, the performance of the GPM is only slightly optimal than that of SOCP in terms of the values of 751 and 770, respectively. Therefore, we can at least reckon that the SOCP method is near optimal. Despite the compromise of the optimum objective, the SOCP method performs much better in terms of computational complexity based on Table 3 and Figures 4 and 8. The SOCP-based method in this paper takes an average of 1.3 seconds to generate trajectories, and the peak calculating time for different initial guesses is only 2.45 seconds, while the GPM method takes an average of 7.98 seconds and the longest time can reach 13.1 seconds. To tackle penetration problems, a method with competitive convergence speed and robust solution process is what we always seek for, though it is not rigorously optimal.

Further simulation is conducted to verify whether the penetration angle could function as an index for evaluating the penetration effects when the distance between the missile and the hypersonic vehicle is fixed. In other words, the hypersonic vehicle can successfully escape once it meets certain penetration angle constraints in the attack and defense countermeasure.

Therefore, we design different penetration angle constraints and conduct the simulation in which the continuing terminal-course relative motion is considered. In the simulation, when the distance between the attack side and the defense side equals to , the countermeasure enters the terminal phase where the two sides continue to approach each other till the vehicle is intercepted or successfully escapes. During this period, the guidance law of the interception missile is the pure proportional guidance law with the proportional constant of 3, while the vehicle adopts two kinds of maneuver in order to illustrate the impact of angle constraints. It does not make any maneuver and continues flying at the current speed and direction or maneuvers with maximum overload in the opposite direction of the attacked missile. The maximum overload, about , is obtained by the maximum available attack angle and maximum thrust for a hypersonic vehicle. The formulas for calculating its overload and maneuver direction are as follows: where represents the maneuver direction; and represent the vehicle’s velocity vector and line-of-sight vector, respectively. With various factors being considered, the time constant of an interception missile is set as 0.05 s and the miss distance is designed as 1 m.

Under different penetration angle constraints and two scenarios of the hypersonic vehicle’s continuing motion method, the miss distances of the interception missile in the two scenarios are shown in Table 4. The whole trajectory profiles for the attack side and the defense side are given in Figures 9 and 10, while the figure for comparing the terminal trajectory (20°penetration angle) in the horizonal plane between different maneuver methods is also shown in Figure 11.

Table 4 shows that if the penetration angle in the countermeasure is larger than 20 degrees, no matter whether or not the vehicle maneuvers in its terminal countermeasure, it can successfully penetrate. Otherwise, the interception missile will create a head-on strike situation; then even the high-overload terminal maneuver of the hypersonic vehicle cannot evade the attack by an interception missile. The penetration angle successfully transforms the complicated countermeasure process of the hypersonic vehicle’s evasion into a simple penetration angle constraint. The penetration can be accomplished without any energy waste.

5. Conclusions

Confronted with the serious interception threat, hypersonic vehicles need to be empowered with the ability to generate a penetration trajectory, cope with air defense missiles, and attack targets simultaneously. In this paper, a rapid penetration trajectory programming method is proposed to guide the hypersonic vehicle to evade against a head-on interception missile with the minimum energy consumption. It has been demonstrated that the method raised in this paper is effective and has competitive computational performances including a quick convergence rate, rapid calculation speed, and robustness of initial guesses. Moreover, the penetration angle summarized in this paper proves to be a valid index of the penetration effect, facilitating the application of optimization methods to hypersonic penetration problems. As a whole, these research results contribute to the future online application of hypersonic penetration programming.

Data Availability

The data used to support the findings of this study are included within the article.

Conflicts of Interest

The authors declare that they have no conflicts of interest.


The research involving this paper is supported by the NSFA (Grant no: U1730135).