Next Article in Journal
Entropy Optimization in MHD Nanofluid Flow over an Exponential Stretching Sheet
Next Article in Special Issue
A Fast Prediction Method for the Target Reachable Zone of Boosting Gliding Vehicle Based on Database
Previous Article in Journal
Traffic Light Detection and Recognition Method Based on YOLOv5s and AlexNet
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Intelligent Trajectory Prediction Algorithm for Reentry Glide Target Based on Intention Inference

1
Graduate College, Air Force Engineering University, Xi’an 710051, China
2
Air Defense and Missile Defense College, Air Force Engineering University, Xi’an 710051, China
*
Author to whom correspondence should be addressed.
Submission received: 29 September 2022 / Revised: 20 October 2022 / Accepted: 21 October 2022 / Published: 25 October 2022
(This article belongs to the Special Issue Advanced Guidance and Control of Hypersonic Vehicles)

Abstract

:

Featured Application

The method proposed can be used of accurate trajecotory prediction of reentry glide target based on intention inference. And it also provides ideas for intention inference of target using deep neural network.

Abstract

Aimed at the problem of the insufficient utilization of intention information and flight data for the trajectory prediction of a reentry glide target, an intelligent trajectory prediction algorithm based on intention inference was proposed. Firstly, a control parameter prediction network was developed to predict the variation of the control parameter values. Secondly, based on the Gaussian mixture model and Dubins circle, the importance of strategic places was modeled, the functional relationship between the strategic places and trajectories was established, and the influence factors of target threat were analyzed. Subsequently, an intention inference network was designed, which can accurately identify the key point the target intends to attack and realize the nonlinear calculation of the target’s threat value. Finally, according to the common guidance law of reentry glide target, the lateral sign-variation rule was designed to carry out the target trajectory prediction based on intention inference. Simulation revealed that the parameter prediction network designed in this paper can realize the modification of filtering control parameters and effectively predict the value of these parameters. Moreover, taking the result of intention inference network, trajectory prediction in different prediction cases was accomplished. The maximal error of spatial distance (MESD) of the proposed method was less than 9 km when the prediction time was 100 s, and the best result was obtained in the long-term prediction. Compared with other mainstream prediction methods, the proposed method obtained the best prediction accuracy.

1. Introduction

Reentry glide targets can glide in near space with high speed and mobility. This type of target usually has a flight speed higher than Mach 5, a longitudinal maneuverable range of tens of kilometers, and a lateral maneuverable range of hundreds of kilometers [1]. Compared with a ballistic target, its longitudinal and lateral maneuverability make it more difficult to precisely predict its trajectory. Therefore, the reentry glide target has been a great challenge for interceptors that realize handover between midcourse and terminal guidance according to high-probability region prediction [2].
At present, there are several excellent control algorithms [3,4] for hypersonic vehicles, while research on its trajectory prediction is still in its infancy. According to the prediction mechanism, the current trajectory prediction methods for reentry glide targets can be divided into three types: prediction through control parameter estimation; prediction by maneuver mode identification; and prediction using intention inference.
The first type of method entails obtaining the prediction trajectory by selecting the suitable control parameters and iterative integration. Based on the aerodynamic model of the reentry glide target, Zhai D.L. et al. [5] proposed a group of control parameters with a simple variation law through simulation analysis, which has a good prediction effect for the HTV-2 target. Li S.J. et al. [6] introduced a new control parameter for the problem that the variation law of control parameters is not easy to predict in the literature [5]. The simulation showed that the variation law of this new control parameter was easier to estimate. Han C.Y. et al. [7] simplified the aerodynamic force on a reentry glide target and obtained the simplified dynamic model. On this basis, the dynamic equation was deduced, and the trajectory prediction method was proposed. The above methods can effectively analyze the model, estimate the variation of control parameters, and predict the trajectory; however, the correlation between the prediction method and the flight data are not strong, as the prediction accuracy is limited by fitting the variation law of the control parameter with a simple function. Experiments in this paper have shown that it can lead to hundreds of kilometers of errors in long-term predictions.
The second type of method to predict trajectories involves identifying the maneuvering mode of the target. Ferreira et al. [8] and Chen et al. [9] analyzed the long-period motion of equilibrium glide, fitted skip glide into the oscillation curve by Liouville transformation and the multi-scale theory method, and provided the formula of skip times. Vinh et al. [10,11] analyzed the second-order approximate solutions of skip glide and equilibrium glide of targets with the constant attack angle, but the solutions were fairly complex. Lu et al. [12] regarded the quasi-equilibrium glide state of lift vehicles as a regular perturbation problem, decomposed the longitudinal trajectory of quasi-equilibrium glide into the combination of equilibrium glide and high-order terms, and analyzed the error between the real solution and the low-order solution. Cheng Y.P. et al. [13] accomplished trajectory prediction by analyzing the maneuvering mode of the target, generating a corresponding training set, training a support vector machine classifier, and combining it with an extended Kalman filter algorithm. However, the above methods only have good effects on trajectory prediction in partial maneuvering modes, while using training sets or networks to predict trajectories lacks a modeling basis, which may reduce the prediction accuracy and lead to the rapid divergence of prediction errors
The above two types of trajectory prediction methods mainly analyze the observation information of the target to realize prediction, which is insufficient in the modern situation analysis of strategic places and guidance mechanism of the target and may accelerate the accumulation of long-time trajectory prediction errors. Therefore, introducing auxiliary information for trajectory prediction is a useful method to improve prediction accuracy. As auxiliary information, the attack intention of the target plays an important role in improving prediction accuracy and has been widely used in aircraft trajectory prediction. Yu L. et al. [14] proposed a trajectory predictor based on the interacting multiple model (IMM) algorithm guided by the spatial and temporal information in the intent. Inspired by search strategies used in artificial intelligence, Guillermo et al. proposed a novel approach in which a search tree is generated to evaluate possible intent maneuvers at each point [15]. Further analyses of target attack intentions to realize the trajectory prediction of reentry glide targets have a good application value. Zhang K. et al. [16] discussed the key technology of reentry glide target trajectory prediction from the four aspects of establishing a prediction model, correcting the prediction error, identifying the guidance law, and inferring the target intention, and proposed a trajectory prediction theory combining state information and attack intention. Accordingly, based on the assumption that target intention is our strategic places, the maneuvering mode of the target is deduced based on Bayesian theory, and trajectory prediction is realized based on Monte Carlo sampling [17]. Hu Y.D. et al. [18] used an autoregressive model to identify maneuver modes, combined target intention with Bayesian theory to obtain the target’s state iteration dynamic equation, and selected prediction methods based on the effects. Combined with relevant intention information, the above methods further simplify the prediction model and effectively realize trajectory prediction. However, the uncertainty of the Bayesian process and sampling method may produce errors.
With the development of deep learning technology, fitting complex functions using a deep network has a favorable effect. In particular, recurrent neural networks (RNN) and long- and short-term memory networks (LSTM) [19] have beneficial effects on sequential feature extraction and sequential rule learning [20]. Trajectory prediction methods based on deep neural networks have also been widely applied in the field of aircraft trajectory prediction [21,22]. Recently, the temporal network has also been used in the trajectory prediction of reentry glide targets. Cai Y.L. et al. [23] designed a trajectory classifier and predictor based on the LSTM network and realized the trajectory prediction of non-ballistic targets driven by pure data. Xie Y. et al. [24] designed a gated recurrent unit (GRU) network based on a double-channel network that generates a prediction data set and carried out the trajectory prediction of high-speed targets. Using deep learning, Zhang J.B. el al. [25] identified the HGV’s motion state according to state information then the appropriate prediction scheme was adopted to predict the trajectory robustly. Bartusiak et al. [26] used methods from natural language processing to model the flight phases and trajectories, and learned the grammar from the HGV trajectories to realize prediction.
The prediction effect of the above methods is excellent, however, their combination with the dynamic model and the design of the network is not strong enough, and the training dataset lacks filtering processing.
In short, for the current trajectory prediction methods based on intention inference, the analysis of associations among target, strategic places and no-fly zones is inadequate, and the influencing factors of intention are too simple to reflect the intention information. What is more, for the selection of control parameters and design of the target threat function, the guidance mechanism and flight data of reentry glide targets are not considered. Aimed at solving the above problems, this paper proposes the application of the target’s initial and last state modification network, parameter modification network and parameter value prediction network to predict the value of control parameters according to the target-filtering data. Then, based on the relationship between the strategic place and the target, the importance map of strategic places is established, which is used to infer the attack position and calculate the importance of strategic places. The association model between trajectories and key points is constructed to calculate the time-to-go and importance changes. Then, according to the common guidance mechanism of reentry glide targets, the time-to-go, cross-range, longitudinal range and the relative importance values are taken as the influencing factors, which are used as a basis to establish the intention inference network by the deep temporal neural network. Finally, combined with the guidance logic, the predicted trajectory is obtained.
The main innovations of this paper are as follows:
  • According to the guidance characteristics of the reentry glide target, an initial and last state modification network, parameter modification network and parameter value prediction network are proposed to realize the prediction of target control parameter values;
  • The importance map of strategic places and the association model between key points and trajectories are proposed. On this basis, the relative importance, time-to-go, cross-range and longitudinal range can be further calculated, which better reflects the intention of the target;
  • The intention inference network of the target is designed by using the deep temporal network, and an explainable model of the threat function is learnt. Combined with the designed change rule of bank angle, the long-term trajectory prediction of the reentry glide target is realized.
The content of this paper is arranged as follows. In Section 1, the research status of reentry glide target trajectory prediction is introduced, and the innovation points and arrangements of this paper are explained. Target dynamic and prediction models are introduced in Section 2. The structure of the parameter prediction network is outlined in Section 3, and the importance map of strategic places and the association model between key points and trajectories are described in Section 4. Then, in Section 5, the intention inference network and change rules of bank angle are designed. In Section 6, simulation is carried out to verify the validity of the proposed prediction method, the error is analyzed, and other trajectory prediction algorithms are compared with the proposed method. Finally, the paper is concluded in Section 7.

2. Dynamic Models and Parameter Prediction Models of Reentry Glide Targets

2.1. Dynamic Model of Reentry Glide Targets

Without considering the Earth’s curvature and rotation, the dynamic model of reentry glide targets is usually expressed as
h ˙ = v sin θ ϕ ˙ = v cos θ sin ψ ( R e + h ) cos φ φ ˙ = v cos θ cos ψ ( R e + h ) v ˙ = D m g sin θ θ ˙ = L cos β m v + cos θ ( v R e + h g v ) ψ ˙ = L sin β m v cos θ + v cos θ sin ψ tan φ R e + h
where h represents the flight height, R e represents the radius of earth, ϕ , φ represent the longitude and latitude, respectively, v represents the velocity, θ is the flight path angle, ψ is the flight heading angle, m represents the mass of target, S is the stress area, and L , D represent the lift and drag force, respectively. It can be expressed as
L = C L ρ v 2 S / 2 D = C D ρ v 2 S / 2
where C L , C D represent the lift and drag parameters of target, and ρ is the atmospheric density that is usually calculated as ρ = ρ 0 e h / H 0 . Here, ρ 0 represents atmospheric density constant and H 0 represents atmospheric altitude constant.

2.2. Control Parameter Models of Reentry Glide Target

For a reentry glide target, there are many unknown characteristic parameters for the predictor. For the benefit of parameter estimation and to reduce the number of unknown parameters, it is an effective method for trajectory prediction to combine many characteristic parameters and obtain new control parameters. A new group of the control parameters K D , β , K L was proposed in the literature [4], where K L = C L S / 2 m , K D = C D S / 2 m . On this basis, the dynamic model of targets can be transformed into
h ˙ = v sin θ ϕ ˙ = v cos θ sin ψ ( R e + h ) cos φ φ ˙ = v cos θ cos ψ R e + h v ˙ = K D ρ v 2 g sin θ θ ˙ = K L ρ v cos β + cos θ ( v R e + h g v ) ψ ˙ = K L ρ v sin β cos θ + v cos θ sin ψ tan φ R e + h
Based on the analysis of the guidance mechanism of the target, the longitudinal guidance characteristics can be expressed by K L K D and β when the sign variation law of bank angle sgn ( β ) represents the lateral guidance characteristics. Therefore, it is easier to realize the intention inference and trajectory prediction by selecting K D , β , K L as the predicted control parameters.

3. Parameter Value Prediction Network

The setting model or simple functions are selected to fit the control parameters when the common trajectory prediction algorithms estimate the control parameters, which lack the utilization of control parameter data. On the other hand, the variation of filtering parameters has a great influence on model fitting. To address the above problems, this paper designs a parameter value prediction network, and makes use of the temporal relationship of flight data to predict the key control parameters value of the target. The parameter value prediction network consists of three parts: the initial and last state modification network; the parameter modification network; and the parameter value prediction network.

3.1. Initial and Last State Modification Network φ l ( )

When trajectory prediction is achieved by the integral-iteration method, the initial state of integration has a great influence on the prediction precision. As can been seen from Figure 1, The original data and observation data are brought into the initial and last state modification network, which is designed to modify the initial and last state of observation data, in order to generate a more accurate initial and last state. The LSTM network with a size of [ 6 , 128 , 2 ] , and the fully connected network with a size of [ 128 , 6 ] are used for training. The observed normalized 6-dimensional state sequence is brought into the LSTM network with 128 hidden nodes at 2 layers to learn temporal relationship, and then it is integrated into the fully connected network for dimensionality reduction, which is used to obtain the state of modified initial and last state, S i and S l , respectively. The structure is shown in Figure 2.

3.2. Parameter Modification Network φ m ( )

Due to the error of the filtering algorithm, the variation of control parameters is not smooth and is fluctuant. Direct estimation using filtering control parameters may lead to a large prediction error. Therefore, the parameter modification network into which the original data and filtering data are brought is designed to modify and smooth the variation of control parameters. The LSTM network, with a size of [ 3 , 128 , 2 ] and the fully connected network with a size of [ 128 , 6 ] , are used for training. The normalized control parameters after filtering K D f , β f , K L f are brought into the network for training, and the modified control parameters K D m , β m , K L m are obtained. The network is shown in Figure 2a.

3.3. Parameter Value Prediction Network φ p ( )

This network is designed to learn the temporal characteristic from the truth control parameter value data, through which the variation of future control parameter values can be predicted. The truth control value data of observation and prediction are brought into the network to learn temporal relationships between them. The LSTM network, with a size of [ 3 , 128 , 2 ] , and the fully connected network with a size of [ 128 , 6 ] , are used for training to obtain the predicted control parameter values K D p , β p , K L p . The network is shown in Figure 2b.
Based on the common guidance logic of reentry glide target with the purpose of attacking strategic places, it can be usually divided into two parts of longitudinal and lateral guidance. As can be seen from Equation (2), the control parameters K D and K L are related to the attack angle of the target, the variation of which are usually smooth, similar to the variation of bank angle β value. Therefore, taking the control parameter values K D , K L and β , the longitudinal guidance logic of the target can be obtained. On the other hand, the lateral guidance logic decided by the sign of bank angle s g n ( β ) varies with the design, which is difficult to effectively predict. Aimed at this problem, inferring the attack intention of target can be a valid method to obtain a more accurate trajectory. To realize the intention inference, the characteristic of strategic places and the functional relationship between strategic places and trajectories should be analyzed.

4. Importance Map of Strategic Places and the Association Model between Strategic Places and Trajectories

According to the analysis of the guidance mechanism of the target [27], there are strategic places to be attacked. The effective analysis of the situation relationship between target and strategic places and inferring the intention of target can provide more prior information for the prediction of target trajectory. To analyze the attack intention of the reentry glide target, the importance map of strategic places is firstly modeled.

4.1. Importance Map of Strategic Places

Usually, strategic places occupy an area. To accurately describe this area, it is assumed that the mapping area of a strategic place is elliptic in several directions, and its probability distribution conforms to the joint two-dimensional Gaussian distribution, which can be expressed as
f k x , y ~ N ( x c k , δ 1 k 2 , y c k , δ 2 k 2 , ρ )
where f k x , y represents the probability density of position ( x , y ) for the k t h strategic place, x c k , y c k is the central position of the k t h strategic place’s ellipse, δ 1 , δ 2 represent the variance of the distribution, and ρ is the correlation coefficient between x , y .
According to the theory of two-dimensional normal distribution, assuming that the central position of the distribution is x c , y c , the rotation angle of mapping ellipse is δ , and the radius of the major and minor axis of the ellipse’s mapping standard deviation are t 1 , t 2 , respectively. Then, the distribution density can be expressed as
f ( x , y ) N x c , σ 1 , y c , σ 2 , ρ x y = exp 1 2 ( 1 ρ x y 2 ) t x y / 2 π σ 1 σ 2 1 ρ x y 2
where, ρ x y = ( t 2 2 t 1 2 ) cos δ sin δ / σ 1 σ 2   σ 1 = t 1 2 cos 2 δ + t 2 2 sin 2 δ , σ 2 = t 2 2 cos 2 δ + t 1 2 sin 2 δ ,. t x y = x x c 2 / σ 1 2 2 ρ x y x x c y y c / σ 1 σ 2 + y y c 2 / σ 2 2 .
According to the absolute importance of each strategic place π k , considering the combined effect for the location’s importance in the map, the importance of each position in the map is calculated based on the Gaussian mixture model (GMM),
p ( x , y ) = i = 1 K π i f i ( x , y )
The extreme points of mixing probability are considered the key points attacked by the target. The distribution of probability density can be shown through the heat map, which means the absolute importance of each position and is named as importance map. Compared with the representation by simple points, the importance map can describe the importance of strategic places in more detail and rationality. What is more, based on the proposed model, the comprehensive influence of all strategic places on each position can be obtained that may generate a new key point. As shown in the following three examples, the importance distributions of the strategic places calculated by the importance map are shown in Figure 3.
As can be seen from Figure 3, for the importance map with three strategic places, there are three kinds of cases. The first is that no new key points are generated and the attack positions are the centre of each strategic place, as shown in Figure 3a. The second is that a new key point is generated due to the influence of the two strategic places, as shown in Figure 3b. What is more, the new generated key point should also be considered when inferring the intention of the target. The third is that a new key point is generated by the joint influence of all the strategic places, as shown in Figure 3c.

4.2. Association Models between Strategic Places and Trajectory

4.2.1. Model Setting

In general, the guidance methods of the reentry glide target can be divided into nominal ballistic guidance and predictor–corrector guidance. The nominal trajectory is usually designed by several optimization algorithms when nominal ballistic guidance is used, so that the target could choose the fastest and safest trajectory to attack the key point. When predictor–corrector guidance is adopted, the guidance trajectory can be obtained based on avoid logic for no-fly zones and guidance logic. Therefore, the analysis of the possible trajectories of targets based on strategic places’ distribution and no-fly zone information is of great significance for trajectory prediction.
According to the analysis in Section 3, the lateral guidance is mainly decided by bank angle. Thus, based on the parameter value prediction network in Section 3, the future control parameters K L and K D can be obtained. Subsequently, bank angle selects a constants value within π / 2 , π / 2 according to a certain step, based on the control parameter model, and several predicted trajectories can be obtained when the setting terminal height h f is reached. Then, the reach region of target and the association trajectories of each key point can be obtained. The model is shown as Figure 4.
As shown in the Figure 4, analyzing the key points within the reach region, the relationship between the position of the target, no-fly zones and key points should be discussed. It is assumed that the radius of no-fly zones is R b . The mapping area of no-fly zone is named no-fly zone mapping corridor, which is between the trajectories generated with a constant bank angle and tangent to the no-fly zone circle. If the key point is within the mapping corridor and sheltered by the no-fly zone, the bank angle needs to be adjusted to avoid the no-fly zone. Otherwise, the trajectory can join the target and key point directly keeping the constant bank angle, such as key point a. For the key points located in the mapping corridor, such as key points b and c, it is necessary to obtain the trajectory and position tangent to the no-fly zone circle. It is generally thought that the less maneuvering operations the target performs, the more energy it can save, so the tangent trajectories can be seen as the approximate trajectory. If the lift of the target is sufficient, based on the Dubbins circle, the turning circle radius of the target is r t = R b , and the acceleration of tuning satisfies
a t = K L ρ V 2 sin β = V 2 cos 2 θ R b
In general, the flight path angle is a small value; if the target can fly-around the no-fly zones, it satisfies ( R b ρ K L ) 1 1 .
After flying-around, the target flies directly to the key point b. If Equation (7) is not satisfied, the minimal radius of flying-around circle will be r t = 1 / ρ K L . Based on the tangent point position, the new flying-around trajectory is obtained, and the whole trajectory is completed. Through the association model, the simple association trajectory between key points and target can be generated, and the time-to-go can be approximately estimated as a key factor to analyze the intention of the target.

4.2.2. Realization Method

(1)
Calculation of reach region.
In order to calculate the reach region, the modified last state in Section 3 is taken as the initial state of integration of trajectories. According to the prediction control parameter K D p , K L p based on the parameter value prediction network, the constant bank angle is combined, which selects a value uniformly within π / 2 , π / 2 at a fixed step size. Let the setting height as the terminal condition, then a bunch of trajectories is obtained when the lateral position and reaching time of terminal state are recorded. The projection position of the reachable region is shown in Figure 5a.
In order to determine whether the target is within the reachable region, the lateral position is fitted with ellipse function A ϕ 2 + B ϕ φ + C φ 2 + D ϕ + E φ + F = 0 when A > 0 . Assuming that the position of i t h key point is [ ϕ i , φ i ] , if A ϕ i 2 + B ϕ i φ i + C φ i 2 + D ϕ i + E φ i + F < 0 , it means that the key point is within reachable region, and the time-to-go needs to be estimated, while if A ϕ i 2 + B ϕ i φ i + C φ i 2 + D ϕ i + E φ i + F < 0 , the time-to-go is setting to infinity.
Moreover, as can be seen from Figure 5b, by connecting the lateral position of different trajectories at the same time, the bank angle-time grid can be obtained, which is useful to calculate the bank angle for the key points β k and mapping corridor of no-fly zones.
(2)
Calculation of the bank angle and time-to-go for key points.
Obtain the nearest grid position to the key point within the reachable region [ ϕ b , t , φ b , t ] , and compare the distance between [ ϕ b , t , φ b , t ] and key point position with [ ϕ b 1 , t , φ b 1 , t ] , [ ϕ b + 1 , t , φ b + 1 , t ] , [ ϕ b , t + 1 , φ b , t + 1 ] and [ ϕ b , t 1 , φ b , t 1 ] , by which the grid position key point location can be determined. Then, through interpolation, the bank angle of key point can be obtained, and the time of nearest grid position t can be seen as the time-to-go of key point t t .
(3)
Calculation of mapping corridor of no-fly zones.
The influence of no-fly zones should be considered when the centre of no-fly zones is within the reachable region. Calculate the minimum distance d β i and the corresponding time t β i between the trajectories of each bank angle X β i and the centre of no-fly zones, where i = 1 : N , and N is the number of setting bank angle. Then, assuming that the distance between trajectories and no-fly zones is Δ d , Δ d i = R b d β i . The p 1 t h and p t h trajectories that satisfy Δ d p 1 Δ d p < 0 are selected to estimate the bank angle of tangent trajectory for no-fly zones β b .
β b = Δ d p 1 β p + Δ d p β p 1 Δ d p + Δ d p 1
The estimated tangent time is t β b , which represents the time when the trajectory of β b is closest to the no-fly zones.
The relationship between the no-fly zone and the reachable region can be divided into full inclusion and partial inclusion. When one boundary of the no-fly zone is out of the reachable zone, as shown in Figure 6a,c, the tangent point on one side should be discussed. When the no-fly zone and the reachable zone are shown in Figure 6b, the positions of tangential points on both sides of the no-fly zone need to be determined. The corridor condition can be expressed as
β k β b r ,                       i f   t t t β r β l β k β r ,         i f   t t min ( t β l , t β r ) β k β l ,                           i f   t t min ( t β l , t β r )
where β r is the bank angle of a trajectory that is tangent to the no-fly zones from the right, and β l is the bank angle of a trajectory which is tangent to the no-fly zones from the left. The parameters t β l , t β r represent the tangent time from the right and left, respectively.
(4)
Estimation of time-to-go for key points within mapping corridor.
If the key points are within the mapping corridor, the time-to-go of key points should be refreshed. According to step (3), the trajectory of bank angle β b that integrates to time t β b can be obtained. If the heading deviation angle Δ ψ k between the target at this time and key point k is less than the setting threshold value ε ψ , setting the bank angle as β = 0 , let the target fly to the key point. Otherwise, Δ ψ ε ψ , the change law of bank angle is according to the following flying around rule,
β t = sgn ( Δ ψ k ) arcsin r b ρ K L t 1 , i f   arcsin r b ρ K L t 1 1 π sgn ( Δ ψ k ) / 2 ,                                                             i f   arcsin r b ρ K L t 1 > 1
Stop flying around until Δ ψ k < ε ψ , and record the cost time of flying around t c . Then, set the bank angle equal to 0 l, let the target fly to the key point until the distance between the target and key point d < ε d , and record the cost time t d . Therefore, the time-to-go of the target for key points with the mapping corridor of no-fly zones is refreshed as t t = t β b + t c + t d .
On the other hand, when the key point is out of the reachable region, the time-to-go for the key point will be t f = .
The dynamic effects are shown in Figure 7, where (a), (b), (c) and (d) represent the change process of dynamic association trajectories for different key points. The blue shaded area represents the no-fly zone mapping corridor, the gray shaded area represents the no-fly zones, and the blue dotted line represents the associated trajectory between the target and the key points.
It can be seen that, based on the proposed model, the approximate lateral trajectories for key points can be obtained quickly, which can be used for the simple calculation of the time-to-go of the target. Some key points will gradually leave the target’s reachable region, and their time-to-go reaches infinity. The proposed model can provide more auxiliary information for the later analysis of the attack intention of the target.

5. Intelligent Trajectory Prediction Algorithm Based on Intention Inference

According to the importance map and association trajectories model in Section 4, the intention information of the target could be obtained effectively. The method to predict trajectories based on intention inference is proposed in this section.

5.1. Factors Influencing the Target Threat Value

Since the target may adopt different lateral guidance logic and avoid methods, the lateral guidance law of the target does not change completely as the threat value increases. The trajectory of the target may not meet the Markov process, such as the predictor–corrector guidance algorithm. Aimed at this problem, several influencing factors related to the threat value should be analyzed according to the observation data, and it should be determined which key point is the attack position of the target. What is more, the attack process is a guidance process of reentry glide targets. Referring to the common guidance methods of reentry targets [23], the prediction of target attack intention is realized from the guidance theory. In this paper, the cross-range, longitudinal range, time-to-go and relative importance of different strategic places are selected as influencing factors to evaluate the threat value of targets.
(1)
Analysis of the influence of cross-range.
According to the analysis of lateral guidance logic, the cross-range between the target and key points [28] can effectively reflect the lateral guidance effect of the target. The formula of cross-range is as follows:
χ i = arc sin sin S f i sin ( Δ ψ i )
where χ i , S f i , Δ ψ i respectively represent the cross-range, range-to-go and flight heading deviation angle of i t h key point. Furthermore, S f t = arccos cos φ f cos φ cos ( ϕ f ϕ ) + sin φ f sin φ , ψ f = arc sin sin ( ϕ f ϕ ) cos φ / sin S t o g o _ f , Δ ψ f = ψ ψ f . In general, the cross-range is smaller, the threat value of the target for the key point is higher, and the threat value is inversely proportional to the cross-range.
(2)
Analysis of the influence of longitudinal range
In order to analyze the longitudinal guidance of the target, the flight height should decrease as the range-to-go decreases. To reflect the longitudinal effect, the longitudinal range of i t h key point at time t is defined as
Z i , t = H t / sin S f i , t , i f   0 < Z i , 1 , t 1 < 1 0 , i f   Z i , 1 t 1 1   or   Z i , 1 t 1 = 0
Generally, if the target intends to attack the key point, the longitudinal range should increase gradually to close to 1. When the range-to-go is less than the flight height in the observation flight trajectory, it means that the target has crossed the center of strategic places, and the threat value of this key point decreases to 0 immediately. Therefore, when Z < 1 , the longitudinal range is higher, the threat value is higher, and it is proportional to the longitudinal range.
(3)
Analysis of time-to-go.
For the convenience of analysis, the time-to-go calculated through the trajectories association model in Section 4 is nondimensionalized; τ f i = t f i g 0 / R e . The time-to-go is smaller, the threat value is higher and it is inversely proportional to the time-to-go.
(4)
Analysis of relative importance.
According to the analysis of the importance map of the target in Section 4.1, when the reachable region of the target changes, the relative importance of each strategic place is calculated as follows:
I i = Ω π i f i ( ϕ , φ ) d ϕ d φ / i = 1 n Ω π i f i ( ϕ , φ ) d ϕ d φ , i f   key   point   is   the   center   of   strategic   place i = 1 q Ω π i f i ( ϕ , φ ) d ϕ d φ / q i = 1 n Ω π i f i ( ϕ , φ ) d ϕ d φ , i f   key   point   is   generated   newly
I i = I i / i n I i
where Ω represents the predicted reachable region.
According to Equation (13), if the key point is newly generated, its relative importance is the average of the mixture distribution that produces it. The relative importance is higher when the threat value is higher, and the threat value is proportional to the relative importance. The effect is shown in Figure 8. As shown in (a) and (b), the major mapping area of strategic places 1, 2 are within the reachable region, which means that the threat value for key points 1, 2 is higher. Moreover, as shown in (c), the major mapping area of strategic place 3 is not within the reachable region, hence the threat value for key point 3 is low.
According to the above analysis, the threat value function of target for the i t h key point can be defined as
G i x t = I i x t f Z Z i x t f χ 1 / χ i x t f τ f 1 / τ f i x t i = 1 n I i x t f Z Z i x t f χ 1 / χ i x t f τ f 1 / τ f i x t
where f Z , f χ and f τ f represent the function between threat value G and longitudinal range Z , cross-range χ , and nondimensional time-to-go τ f , respectively.
Because there is no certain functional form of f Z , f χ and f τ f , by combining the nonlinear fully-connected network with LSTM, the intention inference network is designed in this paper.

5.2. Design of Intention Inference Network

Since the functional form of f Z , f χ and f τ f cannot be determined, it is designed as a combination of the linear and nonlinear functions. The intention inference is designed as a temporal function related to the threat value
p Y = f G ( G i 1 : i t )
The network structure is shown in Figure 9. Based on the network shown in Figure 9, the nonlinear term can be added when the original linear relationship is kept. What is more, the function form and weight of influencing factors do not need to be set in advance. The intended key point can be inferred end to end. After training, the threat value can also be calculated and an accurate functional formula can be obtained to calculate the threat value.

5.3. Signal Change Commonly Used in Predictor–Corrector Guidance

(1)
The reentry glide target will fly towards the key point;
(2)
The reentry glide target will avoid the no-fly zone.
Based on these principles, the change logic of bank angle is shown in Figure 10. When the trajectory of the target is extrapolated and the direction of flight heading angle does not pass through the no-fly zone, as shown in Figure 10a, the change rule of the target will be as follows:
sgn ( β ) = sgn ( Δ ψ ) = sgn ( ψ t ψ )
According to Equation (17), the sign of bank angle is predicted to fly toward the key point. If the direction of the flight heading angle passes through the no-fly zone as shown in Figure 10b, the variation rule is
sgn ( β ) = sgn ( Δ ψ b ) = sgn ( ψ b ψ )
According to Equation (18), the sign of bank angle is predicted to change towards the direction avoiding the no-fly zones the fastest.

5.4. Process of Intelligent Trajectory Prediction Based on Intention Inference

The process of trajectory prediction based on intention inference is shown in Figure 11.
(1)
In order to improve the efficiency of network learning, the observed data are normalized first and then input into the initial and last state modification network to obtain modified initial and last state of observation, which can improve the accuracy of predicted trajectory and modified filtering trajectory;
(2)
Obtain the filtering data p f = [ K D f , β f , K L f ] by the trajectory tracking algorithm;
(3)
Input the filter control parameters into the parameter modification network to obtain more accurate filtering control parameters [ K D m , β m , K L m ] ;
(4)
Input the value of modified filtering control parameters into the parameter value prediction network, and obtain the predicted control parameter values [ K D p , β p , K L p ] according to the temporal law of [ K D m , β m , K L m ] ;
(5)
Based on the importance map, trajectories association models and others, obtain the influence factors such as cross-range, longitudinal range, time-to-go, and relative importance, then input these factors into the intention inference network, identify the intention of target, and obtain the threat value;
(6)
According to the intention of the target, combine the sign change rule of bank angle with the predicted control parameter value, and extrapolate the predicted trajectory by the integral-iteration method.

5.5. Loss Function of Whole Network

The losses of the whole network include the loss of initial and last state network l i l , the loss of parameter modification network l m , the loss of parameter value prediction network l v p and the loss of intention inference network l i p . The loss function of each network can be expressed as
l i l = i N S m l l i S o l l i 2 / N + i N S m i l i S o i l i 2 / N
l m = i N K m i K f i 2 / N
l p = i N K p i K d i 2 / N
l i p = [ l i p log p i p + ( 1 l i p ) log p i p ]
where S m i l i and S m l l i represent the position of the i t h modified start and last state, respectively, in a batch, S o i l i , S o l l i represent the position of the i t h observed initial and last state, respectively, in a batch; N represents the number of batches in Equation (19); K m i represents the i t h modified control parameters sequence in a batch; K f i represents the i t h filtering control parameters sequence in a batch in Equation (20); K p i represents the i t h modified parameter value sequence in a batch; K d i represents the i t h truth parameter value sequence in a batch in Equation (21); l i p , p i p represent the one-hot value of intention label and predicted intention, respectively, in Equation (22).

6. Simulation

6.1. Simulation Environment and Related Settings

(1)
Setting of simulation
In this paper, CAV-H [29] is taken as the non-cooperative reentry glide target, and 6825 trajectories are generated according to the lateral guidance logic and no-fly zone avoidance logic in the literature [30]. The IMM-UKF [31] filtering method is used to track the trajectory. The truth trajectories and filtered trajectories are set as training set and testing set, respectively, with the ratio of 4:1. A total of 1403 trajectories are used to test the prediction method. The network training environment is Pytorch-GPU framework, and Matlab software is employed to draw the final results.
(2)
Training conditions
Each network took 100 trajectories as a batch and trained 1000 epochs in total. The optimizer uses the ADAM optimizer, and the training learning rate is 0.001 for the first 10 epochs, which is then adjusted to 0.0001.
(3)
Definition of errors
In this paper, two types of errors commonly used in trajectory prediction are selected: average error of spatial distance (AESD) and maximum error of spatial distance (MESD). The corresponding definitions are expressed as follows:
AESD is the average spatial distance between truth trajectories and predicted trajectories, such as
M E S D = i N k L p ( X p k i X t k i ) 2 + ( Y p k i Y t k i ) 2 + ( Z p k i Z t k i ) 2 / N
MESD is the maximum spatial distance between truth trajectories and predicted trajectories, such as
M E S D = i N max k L p ( X p k i X t k i ) 2 + ( Y p k i Y t k i ) 2 + ( Z p k i Z t k i ) 2 / N
where N represents the number of the testing dataset trajectories; L p represents the length of the predicted temporal sequence; X p k i , Y p k i , Z p k i represents the predicted position at the time k of the i th test trajectory, and X t k i , Y t k i , Z t k i represents the true position.

6.2. Prediction Effect of Parameter Value Prediction Network

The modification effect of the parameter modification network is shown in Figure 12a. After the filtering of parameters, the control parameters still have great fluctuations and may lead to large errors in parameter fitting and prediction. As shown in Figure 12b, after the parameter modification network, the modified control parameters are relatively close to the truth value. It can be seen from Figure 12c that, based on the modified control parameters, the prediction effect of the control parameter value is close to the truth value, and it can help to more accurately integrate trajectories by iteration.
The modification effect of lateral and longitudinal filter trajectories is shown in Figure 13. As can be seen from Figure 13a,b, before modification, both the lateral and longitudinal tracking trajectories of the target have large tracking errors. However, after parameter correction, the modified trajectory of the observation is closer to the truth trajectory than the tracking trajectory. Since the initial state and filtering control parameters are modified by the initial and last state modification network and parameter modification network, it makes the modified filtering trajectory generated by the integration more accurate, which is of great significance for the accurate analysis of influence factors. This method improves the precision of the intention inference and the accuracy of trajectory prediction.

6.3. Influence Factors of Intention and Inference Effects

Based on the intention inference network in Section 5, the change of influence factors and threat value case 1 are as shown in Figure 14, in which the intent key point is key point 1. The relationship among the modified filtering trajectory, the key points, and the no-fly zones are shown in Figure 14a. As can be seen from Figure 14c–f, the time-to-go of the intent key point is relatively small, the cross-range is close to 0, while the longitudinal range gradually rises. The relative influence also changes as time goes on. The importance of the key point c decreases rapidly as it leaves the reachable region of the target, and its threat value also decreases rapidly, as shown in (f). As can be seen in (b), the threat value can be calculated through the intention inference network. The threat value of key point 1 rises over time and is higher than other key points, which finally leads to the accurate prediction of intention inference.
When evaluating the intention inference network on the testing set, the accuracy of intention inference can reach 98.7%, and it can only reach 87.3% referring to the design function in the literature [15].

6.4. Validity Analysis of Trajectory Prediction

In order to illustrate the effectiveness of the proposed method, two cases of trajectory prediction with different no-fly zone situations are selected in this paper. The first is the target flying around the no-fly zones, while the second is the target flying through between the no-fly zones. With an observation time of 150 s, the predicted trajectories are obtained with 100 s, 200 s and 300 s prediction time. Cases 1 and 2 represent the truth trajectories of flying around and passing through, respectively. The prediction effect of case 1 is shown in Figure 15 and Figure 16, while the prediction effect of case 2 is shown in Figure 17 and Figure 18.
As can be seen from Figure 15, when the prediction time is short, the prediction accuracy is very high. Meanwhile, when the prediction time is longer, the accuracy gradually decreases, which is caused by the accumulation of longitudinal trajectory errors generated by integration. As can be seen from Figure 16, according to the case that the target flies around the no-fly zones, the predicted trajectories based on intention inference in the early stage are more accurate. Because the proposed sign change rule is different from truth guidance logic, as the prediction time increases, the lateral prediction effect may become poor. However, for the long-term trajectory prediction, based on the correct intention inference, lateral prediction error will not spread rapidly, and the prediction effect may become better.
As can be seen from Figure 17, the variation of longitudinal guidance precision in case 2 is similar to that in case 1, which agrees with the longitudinal guidance variation law of the reentry glide target, that is, longitudinal range is mainly related to the control parameter value. However, as can be seen from Figure 19, the flying through predicted trajectory using the intention inference method has a good effect on short-term and long-term prediction. What is more, for long-term prediction, when intentions are accurately judged, lateral prediction errors do not diverge rapidly, and the prediction error increases slowly. Compared with case 1, the lateral predicted trajectory in case 2 is more accurate. On the other hand, it can be seen from Figure 15 and Figure 17 that, after using the parameter value prediction network, the long-term longitudinal integration error of the target still has a high accuracy for the skip trajectory, and the error can be controlled within 500 m. To further demonstrate the accuracy of the prediction method, the overall test results are analyzed in Section 6.5.

6.5. Error Analysis of the Proposed Method

The longitudinal prediction error, lateral prediction error and total error within 100 s, 200 s and 300 s are shown in Figure 19. It can be seen that, in the early period of prediction, the error of the target is very small while the time is less than 80 s. However, due to the difference between the sign change rules and the real guidance logic, the lateral error of the target gradually increases. Since the intention of the target could be correctly predicted by the intention inference network, the lateral error increases slowly within 200 s and 300 s. The longitudinal error increases with time due to the accumulation of the error. The error results are shown in Table 1. Our method obtains the result that the whole error is less than 9 km with a 100 s prediction time and it is less than 32 km with a 300 s prediction time, which shows a good effect on both short and long-term prediction accuracy.

6.6. Comparison with Other Prediction Methods

In order to demonstrate the effectiveness of the proposed method further, the proposed method was compared with prediction methods in literature [5,6] with the same condition as in case 1, and the prediction results less than 100 s are shown in Figure 20. The prediction method of literature [5] is named the VTC prediction method, and the prediction method of literature [6] is named the DBL prediction method in this paper.
As can be seen from Figure 20, for the short-term trajectory prediction, the prediction errors of methods do not diverge. The accuracy of the proposed method is the highest, which is caused by the accurate prediction of the control parameter and utilization of intention information. The prediction method based on control parameter K D , β , K L is more accurate than the method based on control parameters ξ v , ξ t , ξ c , which means that the control parameters K D , β , K L better reflect the guidance mechanism of the target.
The above two prediction methods for comparison rely on parameter fitting; when the extrapolation time by integration is longer than 100 s, the prediction errors of the two methods begin to diverge rapidly, and the divergence effect is shown in Figure 21 and Figure 22. As can be seen from Figure 21a,b due to the imprecise prediction for nonlinear changes of control parameters with the pure fitting of parameters, the prediction error diverges rapidly, especially in the longitudinal direction. For the lateral direction prediction, since pure parameter fitting cannot change the sign of bank angle, the direction of the target’s velocity and the direction of the key point may be reversed, as shown in Figure 22a,c. From long-term trajectory prediction, as shown in Figure 21c and Figure 22c, the proposed method obtains longitudinal prediction results within 300 s without the divergence of error. On the other hand, for the lateral prediction, because of a correct intention inference and sign variation rule of bank angle logic, the lateral long-term trajectory prediction can still maintain high precision. The specific prediction results for 100 s, 150 s and 200 s are shown in Table 2. Here, the reference method is the prediction method in the literature [18].
Analysis of the prediction results, the proposed method realizes the best results within 100 s, 150 s and 200 s. In particular, because of the valid intention inference, prediction error does not diverge rapidly in the long-term prediction, and it may modify the prediction error. Compared with the method in this paper, the intended method of reference method has a larger fluctuation in the prediction of control parameters, resulting in a larger prediction error. On the other hand, due to the possible non-Markov characteristics of the target’s guidance law, the method in this paper can improve the accuracy of long-term trajectory prediction by slowing down the rapid divergence of prediction error when the sign-changing method is adopted.
In the future work, the key to improve the prediction accuracy of intention trajectory is establish an effective correlation relationship between the target’s intention and the sign variation of bank angle, which is the focus of our future research.

7. Conclusions

In this paper, aimed at the problem of maneuvering mode mutation and insufficient utilization of intention information in trajectory prediction for reentry glide target, an intelligent trajectory prediction algorithm based on intention inference is proposed. According to the guidance method of the target, the prediction process is divided into longitudinal prediction process and lateral prediction process. Firstly, based on the suitable control parameter model and sequential neural network, the initial and last state modification network, parameter modification network and parameter value prediction network are established to realize the prediction of the control parameter value. Secondly, the importance map model is developed based on the Gaussian mixture model. On this basis, the association model between strategic places and trajectories is presented to calculate the related factors of intention. Then, to adaptively calculate the threat value and infer attack intention, the intention inference network is introduced. Combined with the sign variation rule of bank angle, the lateral prediction is realized. Finally, according to the simulation results, the parameter prediction network of this paper has an excellent longitudinal prediction effect, the proposed intention parameters reflect good intention characteristics, and the intention network can accurately infer the intention of the target. It is proved that the proposed method can realize accurate and long-term trajectory prediction under different conditions. Compared with other mainstream methods, the prediction accuracy and long-term prediction effect of our method produces the best prediction result

Author Contributions

Conceptualization, M.L. and C.Z.; methodology, M.L. and C.Z.; software, M.L.; validation, M.L., C.L.; writing—original draft preparation. M.L., C.Z.; writing—review and editing, L.S., H.L.; supervision, H.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (Grant no. 62173339 and no. 61873278).

Institutional Review Board Statement

No applicable.

Informed Consent Statement

No applicable.

Data Availability Statement

All data generated or analysed during this study are included in this published article.

Conflicts of Interest

The authors declare no conflict of interest.

Nomenclature

MagnitudeMeaningUnits
h Flight height of HGVm
R e Radius of earthm
ϕ , φ Longitude and Latitude of HGVrad
θ Flight path angle of HGVrad
ψ Flight heading angle of HGVrad
L , D Lift and Drag force of HGVN
ρ Atmospheric DensityKg/m3
ρ 0 Atmospheric density constantKg/m3
H 0 Atmospheric altitude constantm
K L , K D Control Parameterm2/s
β Bank angle of HGVrad
p ( x , y ) Importance   of   position   x , y
a t Turing acceleration in Association Modelm/s2
β b Bank angle making trajetories the trajectory tangent to the no-fly zonerad
t t Time to go calcaulated in Association Models
χ Cross-rangerad
S Range-to-gorad
Δ ψ Flight heading deviation anglerad
Z Longitudinal range difination in Section 5.1
τ Dimensionless time-to-go
I Relative importance
GThreat value
PThe intention inference
l Loss of neural network
AESDAverage spatial distance between truth trajectories and predicted trajectoriesm
MESDMaximum spatial distance between truth trajectories and predicted trajectoriesm

References

  1. Xie, Y.; Liu, L.; Tang, G.; Zheng, W. A reentry trajectory planning approach satisfying waypoint and no-fly zone constraints. In Proceedings of the 5th International Conference on Recent Advances in Space Technologies-RAST2011, Istanbul, Turkey, 9–11 June 2011; pp. 241–246. [Google Scholar]
  2. Luo, C.; Lei, H.; Li, J.; Zhou, C. A new adaptive neural control scheme for hypersonic vehicle with actuators multiple constraints. Nonlinear Dyn. 2020, 100, 3529–3553. [Google Scholar] [CrossRef]
  3. Bu, X.; Qi, Q.; Jiang, B. A Simplified Finite-Time Fuzzy Neural Controller with Prescribed Performance Applied to Waverider Aircraft. IEEE Trans. Fuzzy Syst. 2021, 30, 2529–2537. [Google Scholar] [CrossRef]
  4. Bu, X.; Jiang, B.; Lei, H. Non-fragile Quantitative Prescribed Performance Control of Waverider Vehicles with Actuator Saturation. IEEE Trans. Aerosp. Electron. Syst. 2022, 58, 3538–3548. [Google Scholar] [CrossRef]
  5. Zhai, D.L.; Lei, H.M.; Li, J.; Liu, T. Trajectory prediction of hypersonic vehicle based on adaptive IMM. Acta Aeronaut. Et Astronaut. Sin. 2016, 37, 3466–3475. [Google Scholar]
  6. Li, S.; Lei, H.; Zhou, C. Trajectory Prediction Algorithm for Hypersonic Reentry Glide Target Based on Control Variables Estimation. Syst. Eng. Electron. 2020, 42, 2320–2327. [Google Scholar]
  7. Han, C.; Xiong, J.; Zhang, K. Method of Trajectory Prediction for Unpowered Gliding Hypersonic Vehicle. Mod. Def. Technol. 2018, 46, 146–151. [Google Scholar]
  8. Ferreira, L.O. Nonlinear Dynamics and Stability of Hypersonic Reentry Vehicles; University of Michigan: Ann Arbor, MI, USA, 1995. [Google Scholar]
  9. Chen, X.; Hou, Z.; Liu, J.; Chen, X. Phugoid Dynamic Characteristic of Hypersonic Gliding Vehicles. Sci. China Inf. Sci. 2011, 54, 542–550. [Google Scholar] [CrossRef] [Green Version]
  10. Vinh, N.X.; Kim, E.K.; Greenwood, D.T. Second-Order Analytical Solutions for Re-entry Trajectories. In Proceedings of the AIAA Atmospheric Flight Mechanic Conference, Monterey, CA, USA, 9–11 August 1993. [Google Scholar]
  11. Vinh, N.X.; Kuo, Z.S. Improved Matched Asymptotic Solutions for Three-Dimensional Atmospheric Skip Trajectories. In Proceedings of the AIAA/AAS Astrodynamic Conference, San Diego, CA, USA, 29–31 July 1996. [Google Scholar]
  12. Lu, P. Asymptotic Analysis of Quasi-Equilibrium Glide in Lifting Entry Flight. J. Guid. Control Dyn. 2006, 29, 662–670. [Google Scholar] [CrossRef]
  13. Zhang, J.; Xiong, J.; Lan, X.; Shen, Y.; Chen, X.; Xi, Q. Trajectory prediction of hypersonic glide vehicle based on SVM and EKF. IEEE Sens. J. 2020, 46, 2094–2105. [Google Scholar]
  14. Liu, Y.; Li, X.R. Intent Based Trajectory Prediction by Multiple Model Prediction and Smoothing. In Proceedings of the AIAA Guidance, Navigation, and Control Conference, Kissimmee, FL, USA, 5–9 January 2015. [Google Scholar]
  15. Frontera, G.; Besada, J.A.; López-Leonés, J. Generation of Aircraft Intent Based on a Microstrategy Search Tree. IEEE Trans. Intell. Transp. Syst. 2017, 18, 1405–1421. [Google Scholar] [CrossRef]
  16. Kai, Z.; Xiong, J. Discussion on Long-Term Trajectory Prediction of Hypersonic Gliding Reentry Vehicle. Tactical Missile Technol. 2018, 4, 13–17. [Google Scholar]
  17. Kai, Z.; Jiajun, X.; Fan, L.; Ting-Ting, F.U. Bayesian Trajectory Prediction for a Hypersonic Gliding Reentry Vehicle Based on Intent Inference. Yuhang Xuebao/J. Astronaut. 2018, 39, 1258–1265. [Google Scholar]
  18. Hu, Y.; Gao, C.; Li, J.; Jing, W.; Li, Z. Novel trajectory prediction algorithms for hypersonic gliding vehicles based on maneuver mode on-line identification and intent inference. Meas. Sci. Technol. 2021, 32, 115012. [Google Scholar] [CrossRef]
  19. Gers, F.A.; Schmidhuber, J.; Cummins, F. Learning to Forget: Continual Prediction with LSTM. Neural Comput. 2000, 12, 2451–2471. [Google Scholar] [CrossRef] [PubMed]
  20. Zou, Z.; Shi, Z.; Guo, Y.; Ye, J. Object Detection in 20 Years: A Survey. arXiv 2019, arXiv:1905.05055. [Google Scholar]
  21. Guoqiang, Z.; Lingfang, S.; Xiuyu, Z. Neural Networks Approximator Based Robust Adaptive Controller Design of Hypersonic Flight Vehicles Systems Coupled with Stochastic Disturbance and Dynamic Uncertainties. Math. Probl. Eng. 2017, 2017, 7864375. [Google Scholar]
  22. Wang, S.; Zhao, P.; Yu, B.; Huang, W.; Liang, H. Vehicle Trajectory Prediction by Knowledge-Driven LSTM Network in Urban Environments. J. Adv. Transp. 2020, 2020, 8894060. [Google Scholar] [CrossRef]
  23. Cai, Y.; Deng, Y.; Su, Y. LSTM based Trajectory Classification and Prediciton for Hypersonic Vehicle. In Proceedings of the 21st Chinese Coference on System Simulation Technology and Application (CCSSTA21st), Kunming city, China, 26–28 August 2020; Volume 5. [Google Scholar]
  24. Xie, Y.; Zhuang, X.; Xi, Z.; Chen, H. Dual-Channel and Bidirectional Neural Network for Hypersonic Glide Vehicle Trajectory Prediction. IEEE Access 2021, 9, 92913–92924. [Google Scholar] [CrossRef]
  25. Zhang, J.; Xiong, J.; Li, L.; Xi, Q.; Chen, X.; Li, F. Motion State Recognition and Trajectory Prediction of Hypersonic Glide Vehicle Based on Deep Learning. IEEE Access 2022, 10, 21095–21108. [Google Scholar] [CrossRef]
  26. Bartusiak, E.R.; Hao, H.; Jacobs, M.A.; Nguyen, N.X.; Chan, M.W.; Comer, M.L.; Delp, E.J. A Stochastic Grammar Approach to Predict Flight Phases of a Hypersonic Glide Vehicle. In Proceedings of the 2022 IEEE Aerospace Conference (AERO), Big Sky, MT, USA, 5–12 March 2022; pp. 1–15. [Google Scholar] [CrossRef]
  27. Tian, B.L.; Li, Z.Y.; Wu, S.Y. Reentry trajectory optimization, guidance and control methods for reusable launch vehicles: Review. Acta Aeronaut. Et Astronaut. Sin. 2020, 41, 6–30. [Google Scholar]
  28. Zhang, K.; Shi, G.X.; Wang, P. Predictor-Corrector Reentry Guidance with Crossrange Dynamic Constraint. J. Astronaut. 2020, 41, 9. [Google Scholar]
  29. Phillips, T.H. A Common Aero Vehicle (CAV) Model, Description, and Employment Guide. Schafer Corp. AFRL AFSPC 2003, 27, 1–12. [Google Scholar]
  30. Lin, H.; Du, Y.; Mooij, E.; Liu, W. Improved Predictor-Corrector Guidance with Hybrid Lateral Logic for No-fly Zone Avoidance. In Proceedings of the 2019 International Conference on Control, Automation and Information Sciences (ICCAIS), Chengdu, China, 23–26 October 2019. [Google Scholar]
  31. Li, S.; Lei, H.; Shao, L.; Xiao, C. Multiple Model Tracking for Hypersonic Gliding Vehicles with Aerodynamic is Modeling and Analysis. IEEE Access 2019, 7, 28011–28018. [Google Scholar] [CrossRef]
Figure 1. Initial and last modification network.
Figure 1. Initial and last modification network.
Applsci 12 10796 g001
Figure 2. The structure of Network: (a) parameter modification network; and (b) parameter value prediction network.
Figure 2. The structure of Network: (a) parameter modification network; and (b) parameter value prediction network.
Applsci 12 10796 g002
Figure 3. Effect of Importance map: (a) represents no generated key point; (b) means one key point is generated by two strategic places; and (c) means one key point is generated by all strategic places.
Figure 3. Effect of Importance map: (a) represents no generated key point; (b) means one key point is generated by two strategic places; and (c) means one key point is generated by all strategic places.
Applsci 12 10796 g003
Figure 4. Association Model between strategic places and trajectories.
Figure 4. Association Model between strategic places and trajectories.
Applsci 12 10796 g004
Figure 5. Reachable region and bank angle-time grid: (a) represents the reachable region; (b) represents the bank angle-time grid.
Figure 5. Reachable region and bank angle-time grid: (a) represents the reachable region; (b) represents the bank angle-time grid.
Applsci 12 10796 g005
Figure 6. The relationship between No-fly zones and Reachable region: (a) represents the left boundary of the no-fly zone intersects the reachable region; (b) represents the reachable region fully includes the no-fly zone; (c) represents the right boundary of the no-fly zone intersects the reachable region.
Figure 6. The relationship between No-fly zones and Reachable region: (a) represents the left boundary of the no-fly zone intersects the reachable region; (b) represents the reachable region fully includes the no-fly zone; (c) represents the right boundary of the no-fly zone intersects the reachable region.
Applsci 12 10796 g006
Figure 7. Association model between key points and trajectories:(ad) represent the association models at 0 s, 40 s, 90 s and 120 s respectively.
Figure 7. Association model between key points and trajectories:(ad) represent the association models at 0 s, 40 s, 90 s and 120 s respectively.
Applsci 12 10796 g007
Figure 8. Relative Importance calculation: (a) is the mapping area key point 1; (b) is the mapping area of key point 2; and (c) is the mapping area of key point 3.
Figure 8. Relative Importance calculation: (a) is the mapping area key point 1; (b) is the mapping area of key point 2; and (c) is the mapping area of key point 3.
Applsci 12 10796 g008
Figure 9. Design of intention inference network.
Figure 9. Design of intention inference network.
Applsci 12 10796 g009
Figure 10. Sign variation rule of bank angle: (a) is the case the no-fly zone has no influence on the target; (b) is the case the no-fly zone has influence on the target.
Figure 10. Sign variation rule of bank angle: (a) is the case the no-fly zone has no influence on the target; (b) is the case the no-fly zone has influence on the target.
Applsci 12 10796 g010
Figure 11. Intelligent trajectory prediction structure based on intention inference.
Figure 11. Intelligent trajectory prediction structure based on intention inference.
Applsci 12 10796 g011
Figure 12. Effect of parameter modification network: (a) is the filtering result of the observed control parameters; (b) is the modification result of the filtering control parameters; (c) is the prediction result of the control parameters values.
Figure 12. Effect of parameter modification network: (a) is the filtering result of the observed control parameters; (b) is the modification result of the filtering control parameters; (c) is the prediction result of the control parameters values.
Applsci 12 10796 g012
Figure 13. Effect of parameter value network: (a) is the lateral modified filtering trajectory; and (b) is the longitudinal modified filtering trajectory.
Figure 13. Effect of parameter value network: (a) is the lateral modified filtering trajectory; and (b) is the longitudinal modified filtering trajectory.
Applsci 12 10796 g013
Figure 14. Effect of intention inference network: (a) represent the modified filtering trajectories; (b) is the variation of threat value; (c) is the variation of time-to-go; (d) is the variation of cross-range; (e) is the variation of longitudinal range; (f) is the variation of importance.
Figure 14. Effect of intention inference network: (a) represent the modified filtering trajectories; (b) is the variation of threat value; (c) is the variation of time-to-go; (d) is the variation of cross-range; (e) is the variation of longitudinal range; (f) is the variation of importance.
Applsci 12 10796 g014
Figure 15. Longitudinal prediction effect of case 1: (a) is the longitudinal prediction effect within 100 s; (b) is the longitudinal prediction effect within 200 s; and (c) is the longitudinal prediction effect within 300 s.
Figure 15. Longitudinal prediction effect of case 1: (a) is the longitudinal prediction effect within 100 s; (b) is the longitudinal prediction effect within 200 s; and (c) is the longitudinal prediction effect within 300 s.
Applsci 12 10796 g015
Figure 16. Lateral prediction effect of case 1. (a) is the lateral prediction effect within 100 s; (b) is the lateral prediction effect within 200 s; and (c) is the lateral prediction effect within 300 s.
Figure 16. Lateral prediction effect of case 1. (a) is the lateral prediction effect within 100 s; (b) is the lateral prediction effect within 200 s; and (c) is the lateral prediction effect within 300 s.
Applsci 12 10796 g016
Figure 17. Longitudinal prediction effect of case 2: (a) is the longitudinal prediction effect within 100 s; (b) is the longitudinal prediction effect within 200 s; and (c) is the longitudinal prediction effect within 300 s.
Figure 17. Longitudinal prediction effect of case 2: (a) is the longitudinal prediction effect within 100 s; (b) is the longitudinal prediction effect within 200 s; and (c) is the longitudinal prediction effect within 300 s.
Applsci 12 10796 g017
Figure 18. Lateral prediction effect of case 2: (a) is the lateral prediction effect within 100 s; (b) is the lateral prediction effect within 200 s; (c) is the lateral prediction effect within 300 s.
Figure 18. Lateral prediction effect of case 2: (a) is the lateral prediction effect within 100 s; (b) is the lateral prediction effect within 200 s; (c) is the lateral prediction effect within 300 s.
Applsci 12 10796 g018
Figure 19. Variation of prediction error: (a) represents the longitudinal prediction error; (b) represents lateral prediction error; and (c) represents the whole prediction error.
Figure 19. Variation of prediction error: (a) represents the longitudinal prediction error; (b) represents lateral prediction error; and (c) represents the whole prediction error.
Applsci 12 10796 g019
Figure 20. Prediction effect comparison among different methods: (a) represents the short-term longitudinal prediction trajectory; and (b) represents the short-term lateral prediction trajectory.
Figure 20. Prediction effect comparison among different methods: (a) represents the short-term longitudinal prediction trajectory; and (b) represents the short-term lateral prediction trajectory.
Applsci 12 10796 g020
Figure 21. Comparison of longitudinal prediction effect among different methods: (a) is the longitudinal prediction effect of VTC method; (b) is the longitudinal prediction effect of DBL method; and (c) is the long-term longitudinal prediction effect.
Figure 21. Comparison of longitudinal prediction effect among different methods: (a) is the longitudinal prediction effect of VTC method; (b) is the longitudinal prediction effect of DBL method; and (c) is the long-term longitudinal prediction effect.
Applsci 12 10796 g021
Figure 22. Comparison of lateral prediction effect among different methods: (a) is the lateral prediction effect of VTC method; (b) is the lateral prediction effect of DBL method; and (c) is the long-term lateral prediction effect.
Figure 22. Comparison of lateral prediction effect among different methods: (a) is the lateral prediction effect of VTC method; (b) is the lateral prediction effect of DBL method; and (c) is the long-term lateral prediction effect.
Applsci 12 10796 g022
Table 1. Prediction effect within different prediction times.
Table 1. Prediction effect within different prediction times.
Prediction TimeIndexLongitudinal ErrorLateral ErrorWhole Error
100 sAESD(m)197.531608.501647.70
MESD(m)424.528889.498918.06
200 sAESD(m)554.756503.506584.09
MESD(m)2081.7218,374.2518,416.55
300 sAESD(m)1296.7510,505.7910,662.39
MESD(m)3401.0031,747.0631,907.31
Table 2. Prediction error between different prediction.
Table 2. Prediction error between different prediction.
MethodsIndex100 s150 s200 s
Proposed methodAESD(m)1647.705522.776584.09
MESD(m)8918.0617,103.6218,416.55
VTC prediction methodAESD(m)23,001.35
MESD(m)101,632.79
DBL prediction methodAESD(m)24,620.28
MESD(m)200,958.71
Reference methodAESD(m)4231.366862.2310,446.81
MESD(m)17,213.4426,843.1152,487.36
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Li, M.; Zhou, C.; Shao, L.; Lei, H.; Luo, C. Intelligent Trajectory Prediction Algorithm for Reentry Glide Target Based on Intention Inference. Appl. Sci. 2022, 12, 10796. https://0-doi-org.brum.beds.ac.uk/10.3390/app122110796

AMA Style

Li M, Zhou C, Shao L, Lei H, Luo C. Intelligent Trajectory Prediction Algorithm for Reentry Glide Target Based on Intention Inference. Applied Sciences. 2022; 12(21):10796. https://0-doi-org.brum.beds.ac.uk/10.3390/app122110796

Chicago/Turabian Style

Li, Mingjie, Chijun Zhou, Lei Shao, Humin Lei, and Changxin Luo. 2022. "Intelligent Trajectory Prediction Algorithm for Reentry Glide Target Based on Intention Inference" Applied Sciences 12, no. 21: 10796. https://0-doi-org.brum.beds.ac.uk/10.3390/app122110796

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop