Skip to content
BY 4.0 license Open Access Published by De Gruyter Open Access June 7, 2022

Research on real-time reachability evaluation for reentry vehicles based on fuzzy learning

  • Hong Ma EMAIL logo , Ke Xu , Shouming Sun , Wei Zhang and Tao Xi
From the journal Open Astronomy

Abstract

Accurate and rapid prediction of reentry trajectory and landing point is the basis to ensure the reentry vehicle recovery and rescue, but it has high requirements for the continuity and stability of real-time monitoring and positioning data and the fidelity of the reentry prediction model. In order to solve the above contradiction, based on the theory of relative entropy and closeness in fuzzy learning, research on real-time evaluation of reentry reachability is presented in this article. With the Monte Carlo analysis data during the design and evaluation of the reentry vehicle control system, the reentry trajectory feature information base is designed. With the matching identification decision strategy between the identified trajectory and trajectory feature base, the reachability of the reentry vehicle, reachable trajectory, and landing point can be predicted. The simulation results show that by reasonably selecting the time window and using the evaluation method designed in this article, making statistics of the trajectory sequence number and frequency identified based on relative entropy and closeness method, the reachability evaluation results can be given stably, which is suitable for the real-time task evaluation of TT&C system.

1 Introduction

For the real reentry vehicle and reentry environment, the mathematical simulation model and its corresponding real system (reentry vehicle aerodynamic model, sensor model, actuator model, atmospheric environment model, aerodynamic ablation model, etc.) generally have high nonlinearity and strong coupling, it also has many uncertain influencing factors, and then, the reentry trajectory envelope is large (Hale et al. 2002, Phillips 2003, Richie 1999, Vinh et al. 1980, Peña-Asensio et al. 2021). At the same time, restricted by the tracking ability of TT&C equipment, complete and continuous telemetry data of the reentry vehicle with preset trajectory cannot be obtained in the real reentry process, and then based on the state of its attitude, navigation and positioning, guidance and control systems to predict and judge the reachability of reentry vehicle will be difficult (Vinh 1981, Tang et al. 2019). However, for the TT&C equipment, search and rescue system, it is necessary to realize the guidance of tracking equipment, recover and search the reentry vehicles by evaluating the impact point dispersion and predicting reachability of the reentry vehicle, according to the real-time measured positioning data, high fidelity reentry trajectory prediction model and guidance algorithm (Ono et al. 2020, Du and Liu 2017, Jiang et al. 2020, Dong et al. 2022, Mehta et al. 2017).

The above contradiction has a strong dependence on the stability of real-time measurement data, the accuracy of reentry trajectory high fidelity model and the robustness of the guidance module. The real-time trajectory data of high-speed reentry vehicles can be smoothed by filtering algorithm (Wei et al. 2022, Huang et al. 2020, Wang et al. 2014), but the high-fidelity model of reentry trajectory prediction and guidance calculation module is generally a “black box” for the TT&C equipment, search and rescue system. High computer performance and quantitative evaluation results should be required if using the Monte Carlo analysis method to predict the impact distribution in real time. Then, the Monte Carlo analysis method can only be used as the impact analysis of uncertain factors for the control system, but not suitable for the real-time reachability capability evaluation of reentry vehicles for TT&C dependent itself.

The research on the reachability of reentry vehicle mainly focuses on such as the optimal design of reentry orbit (De Grossi et al. 2021, Fieee et al. 2005, Chen et al. 2021, Meng et al. 2015, Wang et al. 2019, Roh et al. 2020), reentry trajectory and TT&C station determination method (Mansell and Grant 2018, Haitao et al. 2021), through error transfer analysis (Wu et al. 2021, Wang and Grant 2017), aerodynamic shape (Li et al. 2020) and reentry trajectory comprehensive optimization method (Taheri et al. 2021, Vivani and Pezzella 2015, Graves and Harpold 1972), guidance method comparison (Terui et al. 2020,  Gamble et al. 1988, Lu 2008, Rea and Putnam 2007, Bairstow 2007, 2006, Putnam et al. 2008, Wang et al. 2021, Guo et al. 2021, You et al. 2021, Succa et al. 2016, Fang et al. 2018). Considering constraints of specific models and guidance algorithms such as no-fly zone, heating and overload, it consumes a lot of computing time with analysis reachable domain, and the real-time performance is not good. Some scholars hope to build a model through the neural network artificial intelligence theory to realize reentry trajectory prediction (You et al. 2020; Sánchez-Sánchez and Izzo 2018, Ma et al. 2021, Yang and Wang 2020), but it also needs to consume a lot of training time and calculation energy consumption in advance, so the flexibility is limited.

As a theory of processing small sample data, fuzzy learning theory is more and more favored by researchers and engineers in the fields of machine learning, artificial intelligence and so on. It is an important basis for analyzing the performance of learning machines and developing new learning algorithms. Fuzzy relative entropy (Lin 1991) and closeness theory (De Luca and Termini 1972) are two important theories in fuzzy clustering evaluation. Fuzzy relative entropy, also known as K–L divergence, describes the degree of similarity between samples with a probability distribution. The smaller the relative entropy is, the more similar the probability distribution is. The closeness degree describes the similarity degree by describing the ratio of overlapping area to non-overlapping area after the transformation of the sample vector membership function. The greater the closeness degree is, the greater the similarity degree is. Therefore, these two theories can be used to measure and identify the coincidence degree between systems. At present, relative entropy theory and closeness theory are mainly used to solve multi-attribute decision-making problems (Bi et al. 2015, Ning et al. 2019, Li et al. 2022), such as emergency decision-making, customer credit evaluation and competence strength and satisfaction evaluation.

Considering the inevitable correlation between the current flight path state of the reentry vehicle and the reachable area (Qiao et al. 2017), based on the fuzzy learning theory, a reachability evaluation strategy for the reentry vehicle is presented in this article. Establishing the fuzzy set by trajectory flight envelope information generated as the basic feature library, the trajectory data are generated based on the high fidelity reentry trajectory prediction model and guidance model with Monte Carlo trajectory analysis. Constructing the trajectory fuzzy vector to be identified based on the real-time measured reentry flight path feature information of the reentry vehicle, the matching identification strategy and reentry reachability evaluation method are designed in this article. The maximum possibility of the reachable path and landing point for the real reentry vehicle are calculated, so as to evaluate the reachability and provide guidance for trajectory and landing point prediction. It provides a new method for real-time reachability evaluation with TT&C equipment tracking and guidance with abnormal tracking conditions.

2 Relative entropy and closeness in fuzzy learning

2.1 Definition of fuzzy relative entropy

Defining the probability distribution as

(1) p = ( p 1 , p 2 , , p n ) , q = ( q 1 , q 2 , , q n ) ,

where n is the number of fuzzy vectors, p i , q i 0 ,and

i = 1 n p i = 1 , i = 1 n q i = 1 , i = 1 , 2 , , n .

The relative entropy of known probability distribution Q to distribution P is defined as:

(2) H ( P , Q ) = i = 1 n p i ln p i q i ,

where p is the Lagrange multiplier, and H(P,Q) reflects the difference between distribution P and Q.

For n = 2 , assuming p 1 = p , p 2 = 1 p , q 1 = q , q 2 = 1 q , then:

(3) H ( P , Q ) = p ln p q + ( 1 p ) ln 1 p 1 q .

As it is similar to relative entropy, fuzzy relative entropy could be defined to reflect and measure the difference between two fuzzy vectors based on probability distribution accordingly.

Assuming that A = ( μ A ( x 1 ) , μ A ( x 2 ) , , μ A ( x n ) ) and B = ( μ B ( x 1 ) , μ B ( x 2 ) , , μ B ( x n ) ) are two given distributions and are called two fuzzy vectors. μ A ( x i ) represents the degree to which x i belongs to set A , μ B ( x i ) represents the degree to which x i belongs to set B , and μ A ( x i ) , μ B ( x i ) [ 0 , 1 ] . Defining the fuzzy relative entropy of μ A ( x i ) and μ B ( x i ) as follows (Lin 1991):

(4) S ( μ A ( x i ) , μ B ( x i ) ) = μ A ( x i ) ln μ A ( x i ) μ B ( x i ) + ( 1 μ A ( x i ) ) ln 1 μ A ( x i ) 1 μ B ( x i ) .

Therefore, the relative entropy of fuzzy vector B A can be defined as:

(5) S ( A , B ) = i = 1 n μ A ( x i ) ln μ A ( x i ) μ B ( x i ) + ( 1 μ A ( x i ) ) ln 1 μ A ( x i ) 1 μ B ( x i ) .

This reflects the difference between two fuzzy vectors. However, the above formula has a disadvantage, that is, when μ A ( x i ) 0 , 1 or μ B ( x i ) 0 , 1 , S ( A , B ) . Therefore, we ought to revise it.

In fact, H ( P , Q ) also has the same disadvantage, which is modified as:

(6) K ( P , Q ) = i = 1 n p i ln p i p i / 2 + q i / 2 .

Similarly, S ( A , B ) could also be modified as follows:

(7) E ( A , B ) = i = 1 n μ A ( x i ) ln μ A ( x i ) μ A ( x i ) / 2 + μ B ( x i ) / 2 + ( 1 μ A ( x i ) ) ln 1 μ A ( x i ) 1 ( μ A ( x i ) + μ B ( x i ) ) / 2 .

It has complete significance and practicability, which is called fuzzy relative entropy. It could characterize the difference between set A and set B. That is, the smaller the fuzzy relative entropy, the smaller difference between them.

It is easy to prove that E ( A , B ) does not satisfy symmetry, and E ( A , B ) 0 , if and only if A = B , E ( A , B ) = 0 .

2.2 Closeness of fuzzy set

Fuzzy recognition mainly focuses on which fuzzy set is closest to a known one. The given fuzzy subset is defined as:

(8) A ˜ 1 , A ˜ 2 , A ˜ n , A ˜ i F ( X ) .

Represent F ( X ) as the set of all fuzzy subsets, B ˜ F ( X ) is defined as a subset to be recognized. For fuzzy recognition of set B ˜ , it is necessary to estimate which set is closest to subset A ˜ i . Such problems could also be recognized by the proximity selection principle. The closeness degree is defined as (De Luca and Termini 1972):

Defining A ˜ and B ˜ are fuzzy subsets of universe X , and take the target membership function as

(9) μ ( B ˜ ( x i ) ) = 0 , B ˜ ( x i ) max A ˜ ( x i ) , max A ˜ ( x i ) B ˜ ( x i ) max A ˜ ( x i ) min A ˜ ( x i ) , min A ˜ ( x i ) B ˜ ( x i ) max A ˜ ( x i ) , 1 , B ˜ ( x i ) min A ˜ ( x i ) ,

where max A ˜ ( x i ) and min A ˜ ( x i ) represent the set of maximum and minimum values in set A ˜ i , respectively.

Definition 1

μ max ( B ˜ ( x i ) ) = A ˜ ( x i ) B ˜ ( x i ) represents the maximum value of the subset membership μ ( B ˜ ( x i ) ) at point x i , and μ min ( B ˜ ( x i ) ) = A ˜ ( x ) i B ˜ ( x ) i represents the minimum value of the subset membership μ ( B ˜ ( x i ) ) at point x i .

Definition 2

Closeness – A finite universe is defined as X = { x 1 , x 2 , , x n } . According to Definition 1 and the definitions of inner product and outer product in number theory:

(10) N ( A ˜ , B ˜ ) = i = 1 n μ min ( B ˜ ( x i ) ) i = 1 n μ max ( B ˜ ( x i ) ) , 0 N ( A ˜ , B ˜ ) 1 .

N ( A ˜ , B ˜ ) is the closeness of fuzzy vectors A ˜ ( x ) and B ˜ ( x ) , which represents the ratio of overlapping area to non-overlapping area of two fuzzy vectors. It indicates that A ˜ and B ˜ is closer when N ( A ˜ , B ˜ ) 1 .

3 Evaluation strategy of reachability for reentry vehicle based on fuzzy learning

3.1 Establishing the fuzzy vector of reentry trajectory

3.1.1 The information feature database of reentry reachable trajectory

Monte Carlo analysis is carried out based on the high fidelity dynamic model and uncertainty error term, and the sub-satellite point trajectories are calculated. Set the sub-satellite point of i in the reentry reachable trajectory information database as ( t i , B i , L i , H i ) , so as to define the feature information database as:

(11) i = 1 N ( t i , B i , L i , H i ) .

The feature reflects the attribute values of fuzzy features, and each feature trajectory is a set of vectors related to time, latitude, longitude and height of sub-satellite points.

Set the latitude, longitude and altitude of the sub-satellite point of the trajectory to be identified as ( t 0 , B 0 , L 0 , H 0 ) , respectively, which is the characteristic attribute vector of the trajectory to be identified.

3.1.2 Standardizing the fuzzy vector

Setting x max and x min to be the maximum and minimum values of the original data, which of the index parameters to be standardized, and x ¯ to be the average values, respectively. Standardizing the latitude, longitude and altitude information in the reachable trajectory information base according to the range processing method as follows:

(12) r i = ( x i x ¯ ) / ( x max x min ) .

That is, normalizing each element in the fuzzy vector to (0,1). Recording that the normalized trajectory modulus vector to be identified as A 0 = ( B ¯ 0 , L ¯ 0 , H ¯ 0 ) = ( A 01 , A 02 , A 03 ) , the fuzzy vector of target number j is A j = ( B ¯ j , L ¯ j , H ¯ j ) = ( A j 1 , A j 2 , A j 3 ) .

3.2 Calculating the relative entropy and closeness of reentry trajectory

According to formula (7), calculating the fuzzy relative entropy between the trajectory information to be identified and the feature database vector, then generating the relative entropy matrix

(13) E ( A 0 , A j ) = i = 1 3 A 0 i ln A 0 i A 0 i / 2 + A j i / 2 + ( 1 A 0 i ) ln 1 A 0 i 1 ( A 0 i + A j i ) / 2 .

According to formulas (8) and (9), calculating the closeness of the specially identified trajectory information as follows and generating the closeness matrix:

(14) N ( A ˜ 0 , A ˜ j ) = i = 1 3 [ A ˜ 0 i A ˜ j i ] i = 1 3 [ A ˜ 0 i A ˜ j i ] ,

where i = 1 , 2 , 3 , indicating the sub-satellite feature trajectory information with latitude, longitude and altitude.

3.3 Strategy of matching identification

Considering the relative entropy can not only reflect the distribution characteristics of the target feature attributes to be identified, but also obtain more accurate target similarity by weighting, and finally improve the accuracy of target recognition. When calculating the closeness, the accuracy of target recognition will be reduced when the identified vector is not in the feature base or there is noise interference. Therefore, the following recognition decision-making strategy is formulated:

  1. When E min ( A 0 , A j ) N max ( A ˜ 0 , A ˜ j ) is satisfied, it is matching successful, that is, when the fuzzy relative entropy of the trajectory to be identified and the trajectory information feature base is the smallest, and the closeness is the largest, it is estimated that matching is successful;

  2. When E min ( A 0 , A j ) or N max ( A ˜ 0 , A ˜ j ) is satisfied, the one with the smallest relative entropy is taken as the optimal “matching” result.

3.4 The reachability evaluation method for reentry vehicles

The specific steps of evaluating the reentry reachability for reentry vehicles based on fuzzy theory are as follows. Figure 1 is the flowchart of the evaluation method of reachability for reentry vehicles.

  1. Carrying out Monte Carlo analysis, based on the high fidelity dynamic model, the identified system uncertainty factors and error interference terms; calculating characteristic information of sub-satellite points to generate the reentry trajectory characteristic information database.

  2. Filtering and smoothing the real-time positioning data in the process of real reentry flight as the trajectory to be identified, and calculating sub-satellite points to generate the characteristic information of the trajectory to be identified.

  3. Processing the trajectory feature information calculated in steps (1) and (2) by fuzzy vector standardization.

  4. Calculating and sorting the calculation results of fuzzy relative entropy and closeness, which of the trajectory to be identified relative to the reentry trajectory feature database, according to the specified real-time data accumulation evaluation time window Δ t .

  5. Finding the most matching trajectory in the current real-time data window and trajectory feature database according to the matching identification standard. Setting the trajectory matching serial number as K, taking the landing point and landing time corresponding to this trajectory as the currently identified reachability evaluation result.

  6. Repeating steps (2) to (5), counting the trajectory matching sequence number as k , and calculating the number of occurrences of the matched trajectory sequence number by sliding the accumulated real-time data time Δ t . Taking the trajectory with the most occurrences as the final result of the reentry reachability evaluation, and its corresponding landing point and landing time as the final landing point prediction result.

Figure 1 
                  Flowchart of reentry reachability evaluation method for reentry vehicles.
Figure 1

Flowchart of reentry reachability evaluation method for reentry vehicles.

4 Simulation and result

Taking the Skip Entry with the characteristics of secondary reentry trajectory as the simulation verification object, the feasibility of the reentry reachability evaluation method based on fuzzy learning is verified.

4.1 Simulation settings

  1. Considering the separation point of 5,000 km module and vehicle (Huang et al. 2020, Li et al. 2020), set the initial deviation term according to the random normal distribution, as shown in Table 1. Generate 300 groups of deviation trajectories based on the Monte Carlo method as the reentry trajectory characteristic information base of the reentry vehicle.

Table 1

Error source setting (for module separation point)

Serial number Category Error term Range
1 Initial condition deviation Height (km) ±5%
2 Speed (M/s) ±1%
3 Reentry angle ±0.2
4 Longitude (°) ±0.2
5 Latitude (°) ±0.2
6 Velocity Azimuth (°) 0.2
7 Mass (kg) ±10.0
8 Deviation of atmospheric density, sound velocity and dynamic model Atmospheric density, sound velocity ±20%
9 Lift coefficient, Cl ±20%
10 Drag coefficient, Cd ±20%

Figures 2 and 3 show the altitude and sub-satellite point dispersion diagram of 300 groups of trajectories in the trajectory feature information database. The GNC system guidance capability of the simulation object reentry vehicles can ensure that the altitude dispersion range of first skipping out is about 40 km and the landing point dispersion range is ±50 km.

  1. Taking the first of the 300 characteristic trajectories generated by the Monte Carlo analysis method as the reference nominal trajectory, and the total time of the trajectory is 2,000 s.

Figure 2 
                  The height dispersion diagram in trajectory feature information base.
Figure 2

The height dispersion diagram in trajectory feature information base.

Figure 3 
                  The distribution diagram of sub-satellite points in trajectory feature information base.
Figure 3

The distribution diagram of sub-satellite points in trajectory feature information base.

Considering the distance ρ , azimuth angle A , and angle of elevation E with the capabilities of the tracking equipment, and converting them into the deviation range of the sub-satellite point parameters, and setting the deviation term according to the random normal distribution, as shown in Table 2. It is used as the trajectory to be identified after the smooth processing of real-time positioning data in the real reentry process for the reentry vehicle. Refer to Table 2 for the deviation range of trajectory parameters.

  1. In order to test the calculated energy consumption, the sliding recognition time window is set in two ways, once per second and once every accumulated 10 s data, so as to evaluate the recognition window setting and results in this article. For the skip reentry spacecraft, the recognition window is set reasonably, and the recognition results of the two windows are evaluated at the same time.

  2. The trajectory number in the trajectory feature database starts from serial number 1.

  3. Programing language and computer configuration: Visual Studio C++ 2010, Intel Core i5-4570pentium (R), CPU 3, 20 GHz, 4-GB memory.

Table 2

Error source setting of trajectory to be identified

Serial number Category Error term Range
1 Trajectory deviation Longitude (°) ±0.04
2 Latitude (°) ±0.04
3 Height (m) ±50

4.2 Simulation results

4.2.1 Identifying once per second

In the current test environment, the total calculation takes 10.72 s to complete 2,000 evaluations. Table 3 gives the calculation results of fuzzy relative entropy and closeness calculated with 300 groups of data in the feature database every 1 s with the trajectory to be identified.

Table 3

Data matching results per second

Serial number 1st second 2nd second 3rd second 2,000th second
Fuzzy relative entropy 0.57743 × 10−6 0.01847 × 10−6 0.16495 × 10−6 0.00846 × 10−6
Match result Group 1 Group 1 Group 1 Group 1
Maximum and minimum closeness 0.99992 0.99997 0.99994 0.999828
Match result Group 1 Group 1 Group 1 Group 4

Figure 4 shows the recognition result based on the relative entropy between the data per second and the feature database, that is, the matching sequence number. Figure 5 makes frequency statistics of the recognized sequence number. As can be seen from Figures 4 and 5, the four serial numbers that appear more frequently are as follows: 389 times for serial number 1,357 times for serial number 106, 284 times for serial number 36 and 187 times for serial number 141.

Figure 4 
                     Identification results of trajectory matching sequence number based on fuzzy relative entropy.
Figure 4

Identification results of trajectory matching sequence number based on fuzzy relative entropy.

Figure 5 
                     Identification results of matching sequence number frequency statistics based on fuzzy relative entropy.
Figure 5

Identification results of matching sequence number frequency statistics based on fuzzy relative entropy.

Figure 6 shows the recognition result based on the closeness between the data and the feature database per second, that is, the matching sequence number. Figure 7 makes frequency statistics of the recognized sequence number. It can be seen from Figures 6 and 7 that the four sequence numbers that appear more frequently are 309 times for serial number 262, 248 times for serial number 36, 206 times for serial number 171 and 198 times for serial number 1.

Figure 6 
                     Identification results of trajectory matching sequence number based on fuzzy closeness.
Figure 6

Identification results of trajectory matching sequence number based on fuzzy closeness.

Figure 7 
                     Identification results of matching sequence number frequency statistics based on fuzzy closeness.
Figure 7

Identification results of matching sequence number frequency statistics based on fuzzy closeness.

Based on the aforementioned calculation results, taking the separation point of 5,000 km capsule as the time zero, it is matched with the feature database every second. A total of about 2,000 calculations can be seen:

  1. When t <1,200 s, the reentry vehicle is located before the first reentry phase, and the “matching” recognition results are relatively concentrated, and the recognition frequency is about 200 times. This shows that the reentry vehicle is less affected by the atmosphere at this stage, and the trajectory to be identified is a high similarity to the trajectory feature database. The evaluation results of reachability are mainly concentrated in five trajectories.

  2. When 1,200 s < t <1,300 s, the reentry vehicle is located before the first skip and after the first reentry phase and the “matching” recognition result is divergent. This indicates that the reentry vehicle is seriously affected by the atmosphere and the GNC system needs to start guidance planning, the probability of following any trajectory increases. At this time, it is difficult to evaluate the reachability.

  3. When 1,300 s < t < 1,700 s, the reentry vehicle is before the second reentry and after the first skip phase, although the “matching” recognition result diverges, the number 1 appears the most times, and the reachability of the reentry vehicle evaluation result can converge in the only one trajectory. The divergence of the recognition result indicates that the GNC system of the reentry vehicle needs to conduct guidance planning again. Although the probability of following any trajectory increases, it does not affect the position of the final landing point.

  4. When t < 1,700 s, the reentry vehicle is in the second reentry phase, and the “matching” recognition result is number 1. The known trajectory to be identified is generated by adding deviation disturbance to the data of No. 1. The reentry reachability evaluation algorithm designed in this article identifies itself with disturbance, and the correctness of the algorithm has been verified.

  5. Determining the strategy of matching identification. Identifying once every second, mainly according to the second strategy of Section 2.3.

  6. The evaluation results of reentry vehicle reachability are as follows: before the first reentry phase, take the trajectory number 36 as the prediction result, and take the last point of the trajectory as the landing time and landing point prediction; after the first reentry phase, take the trajectory number 1 as the prediction result, and take the last point of the trajectory as the landing time and landing point of the landing point prediction.

4.2.2 Identifying once every accumulated 10 s data

In the current test environment, the total calculation takes 22.36 s and is evaluated 200 times. Table 4 gives the calculation results of fuzzy relative entropy and closeness calculated with 300 groups of data in the feature database every 10 s of the trajectory to be identified.

Table 4

Results of recognition once every 10 s

Serial number 1–10 s 1–20 s 1–30 s 1–2,000 s
Fuzzy relative entropy 0.04306 × 10−4 0.10183 × 10−4 0.40296 × 10−4 0.79562 × 10−4
Match result Group 180 Group 180 Group 36 Group 1
Maximum and minimum closeness 0.99993 0.99993 0.99992 0.99978
Match Result Group 153 Group 15 Group 153 Group 1

Figure 8 shows the recognition result based on the relative entropy between the data per 10 s and the feature database, that is, the matching sequence number. Figure 9 makes frequency statistics of the recognized sequence number. As shown in Figures 8 and 9, the two serial numbers that appear more frequently are 117 times for serial number 36 and 73 times for serial number 1.

Figure 8 
                     Identification results of trajectory matching sequence number based on fuzzy relative entropy.
Figure 8

Identification results of trajectory matching sequence number based on fuzzy relative entropy.

Figure 9 
                     Identification results of matching sequence number frequency statistics based on fuzzy relative entropy.
Figure 9

Identification results of matching sequence number frequency statistics based on fuzzy relative entropy.

Figure 10 shows the recognition result based on the closeness between the data and the feature database per 10 s, that is, the matching sequence number. Figure 11 makes frequency statistics of the recognized sequence number. Figures 10 and 11 show the two sequence numbers that appear more frequently are 73 times for serial number 1 and 71 times for serial number 36.

Figure 10 
                     Identification results of trajectory matching sequence number based on fuzzy closeness.
Figure 10

Identification results of trajectory matching sequence number based on fuzzy closeness.

Figure 11 
                     Identification results of matching sequence number frequency statistics based on fuzzy closeness.
Figure 11

Identification results of matching sequence number frequency statistics based on fuzzy closeness.

Based on the aforementioned calculation results, taking the separation point of 5,000 km capsule as the time zero, the data accumulated every 10 s are matched with the feature database, and a total of about 200 calculations are made. It can be seen that:

  1. When t < 1,200 s, the reentry vehicle is located before the first reentry phase, and the “match” recognition result is serial number 36.

  2. When t > 1,200 s, the reentry vehicle is located after the first reentry phase, and the “match” recognition result is serial number 1.

  3. Determining the strategy of matching identification. Identify once every 10 s, mainly according to the first strategy of Section 2.3.

  4. The reachability evaluation result of the reentry vehicle is the same as that in Section 3.2.1. The result shows that when there are enough members in the special identification data set, it can better reflect its essential characteristics. According to the demand, the identification data window can be reasonably selected to reduce the calculation energy consumption and improve the identification probability and evaluation rate at the same time.

4.2.3 Trajectory deviation between to be identified and identification results

Figures 12 and 13 show the trajectory deviation relationship between four groups of data of serial numbers 1, 36, 106, and the trajectory to be identified. It also shows that the matching degree value between the reentry vehicle and number 36 trajectory is high before the first reentry phase, and the matching degree value between the reentry vehicle and number 1 trajectory is high after the first reentry phase. The simulation recognition result is correct.

Figure 12 
                     Height deviation.
Figure 12

Height deviation.

Figure 13 
                     Sub-satellite point deviation.
Figure 13

Sub-satellite point deviation.

5 Conclusion

The real-time reachability evaluation method of reentry vehicles based on fuzzy learning is presented in this article. Compared with the traditional real-time trajectory and landing point prediction method of reentry vehicles based on high fidelity reentry and guidance model, this method only needs the sample trajectory data, which is generated by the Monte Carlo method, and based on the calculation of fuzzy relative entropy and closeness, then it can realize the real-time reachability evaluation of reentry vehicle. The accuracy and evaluation speed can adapt to the needs for the rapid response to real-time tasks. It provides a new idea and way for reentry trajectory prediction, landing point prediction and reachability evaluation of non-cooperative reentry vehicles. It is suitable for the TT&C equipment tracking and guidance with abnormal tracking conditions.

In order to test the calculation of energy consumption and the accuracy of analysis and evaluation, the sliding recognition time window is set in two ways, once per second and once every accumulated 10 s data in this article. For the skip reentry spacecraft, the recognition window is set reasonably, and the recognition results of the two windows are evaluated. After analysis, the recognition of the two time windows requires 10.72 s (2,000 evaluations in total) and 22.36 s (200 evaluations in total), respectively. Obviously, the calculation speed is faster with evaluating once per second. However, through the comparison between Figures 7 and 9, it can be found that there are more similar tracks identified in the tracking database with the evaluation result of once per second. Accumulating 10 s data, with the increase of feature information, that is, when there are many members in the data set to be identified, the most similar tracks can be better identified, and the accuracy is also improved. Of course, the recognition window can also be longer, but we will be anxious to know which reentry track the vehicle will take in real time. Increasing the measurement data accumulation time will not improve the recognition accuracy qualitatively. However, the accuracy and calculation energy consumption of 10 s recognition can suit the requirements of real-time tasks. Therefore, it is suggested to select it reasonably according to the display requirements of real-time monitoring system in practical application.

Moreover, the entry phase when the reentry vehicle enters the black barrier and cannot obtain the measurement data is not simulated during the simulation, but when the recognition window is selected once for 10 s, Figures 8 and 10 show that the recognition and evaluation result has already converged to one track, which does not affect the presentation of the evaluation result.

Of course, in order to improve the accuracy of this method for reachability evaluation and landing point prediction, we need to rely on a large number of trajectory feature samples as the basic identification database. Subsequently, the intelligent machine learning method can be used to analyze and learn the trajectory information of Monte Carlo analysis in time domain and frequency domain, so as to improve its trajectory and landing point prediction ability.

Acknowledgments

The author would like to thank Ke Xu of the State Key Laboratory of Astronautic Dynamics and Wei Zhang of the State Key Laboratory of Spacecraft In-Orbit Fault Diagnosis and Maintenance for their support and interest in this research.

  1. Funding information: This research was funded by the National Natural Science Foundation of China (Grant No. 11772356, No. U21B2050).

  2. Author contributions: All authors have accepted responsibility for the entire content of this manuscript and approved its submission.

  3. Conflict of interest: Authors state no conflict of interest.

References

Bairstow SH. 2006. Reentry guidance with extended range capability for low L/D spacecraft. Dissertation. Boston: Massachusetts Institute of Technology (MIT).10.2514/6.2007-6427Search in Google Scholar

Bairstow SH. 2007. Orion reentry guidance with extended range capability using PredGuid. In: AIAA Guidance, Navigation and Control Conference and Exhibit; 2007 Aug 20–23. Hilton Head, SC: AIAA. p. 2007–6427.10.2514/6.2007-6427Search in Google Scholar

Bi K, Wang X, Xing Y. 2015. Fuzzy clustering ensemble based on fuzzy measure and DS evidence theory. Control Decision. 30(5):823–830.Search in Google Scholar

Chen C, Zhang Z, Sheng R, Yang M. 2021. Mission analysis and design of half-ballistic reentry for deep space exploration. J Deep Space Explor. 8(3):269–275.Search in Google Scholar

De Grossi F, Marzioli P, Cho M, Santoni F, Circi C. 2021. Trajectory optimization for the Horyu-VI international lunar mission. Astrodynamics. 5(3):263–278.10.1007/s42064-021-0105-1Search in Google Scholar

De Luca A, Termini S. 1972. A definition of nonprobabilistic entropy in the setting of fuzzy sets theory. Inf Control. 20(4):301–312.10.1016/B978-1-4832-1450-4.50020-1Search in Google Scholar

Dong J, Rao W, Sun Z, Wang C, Huang X, Li Q, Li J. 2022. Interdisciplinary design and validation for key phases of martian landing missions. Jf Astron. 4(3):21–29.Search in Google Scholar

Du X, Liu H. 2017. Analysis of reachable sets of lunar module skip entry trajectory. Zairen Hangtian. 23(2):163–172.Search in Google Scholar

Fang K, Zhang Q, Ni K, Lin Cheng, Yuntao Huang. 2018. Time-coordinated reentry guidance law for hypersonic vehicle. Hangkong Xuebao. 39(5):321958.Search in Google Scholar

Fieee AF, Immediata L, Timmoneri L, Meloni M, Vigilante D. Comparison of recursive and batch processing for impact point prediction of ballistic targets. IEEE International Radar Conference; 2005 May 9–12; Arlington (VA), USA. IEEE; 2005. p. 121–126.Search in Google Scholar

Gamble JD, Cerimele CJ, Moore TE, Higgins J. 1988. Atmospheric guidance concepts for an aeroassisted flight experiment. J Astronaut Sci. 36:45–71.Search in Google Scholar

Graves CA, Harpold JC. 1972. Apollo experience report-mission planning for apollo entry. Technical report. Houston. NASA TN D-6725.Search in Google Scholar

Guo T, Song Z, Shi J. 2021. Study on predictor-corrector guidance law for skip reentry of manned spacecraft with blunt body. Zairen Hangtian. 27(2):149–157.Search in Google Scholar

Haitao LI, Chen S, Li Z, Fan M, Cheng C. 2021. Ground station visible region determination method in Chang’E-5 reentry. J Deep Space Explor. 8(3):284–289.Search in Google Scholar

Hale N, Lamotte N, Garner T. Operational experience with hypersonic entry of the space shuttle. AIAA/AAAF 11th International Space Planes and Hypersonic Systems and Technologies Conference; 2022 24 Sep–4 Oct; Orleans, France. AIAA; 2002. 10.2514/6.2002-5259.Search in Google Scholar

Huang P, He Y, Wang A, Zhang J. 2020. Analysis on real-time impact point calculation method of cz-2c rocket residues. Spacecr Recovery Remote Sens. 41(5):13–20.Search in Google Scholar

Jiang X, Dang L, Li Z, Li S, Tang X. 2020. Analysis and research on scattered range of irregular debris for uncontrolled reentry disintegration of spacecraft. Manned Spaceflight. 26(4):436–442.Search in Google Scholar

Li Y, Guo J, Qi L, Liu X, Ruan P, Tao X. 2022. Density-sensitive fuzzy kernel maximum entropy clustering algorithm. Control Theory Appl. 39(1):67–82.Search in Google Scholar

Li Z, He Y, Gao C, Zhang X, Wang Q. 2020. Optimization of aeroshape integrated design of winged re-entry vehicles. Hangkong Xuebao. 41(5):623356.Search in Google Scholar

Lin J. 1991. Divergence measures based on Shannon entropy. IEEE Trans Inf Theory. 37(1):145–151.10.1109/18.61115Search in Google Scholar

Lu P. 2008. Predictor-corrector entry guidance for low-lifting vehicles. J Guid Control Dyn. 31(4):1067–1075.10.2514/6.2007-6425Search in Google Scholar

Ma Z, Li M, Fan Y, Li W, Xia Q. 2021. The sensitivity analysis of departure stability of hypersonic vehicle based on neural network. J Projectiles Rockets Missiles Guid. 41(1):124–134.Search in Google Scholar

Mansell JR, Grant MJ. 2018. Adaptive continuation strategy for indirect hypersonic trajectory optimization. J Spacecr Rockets. 55(4):818–828.10.2514/1.A34013Search in Google Scholar

Mehta PM, Kubicek M, Minisci E, Vasile M. 2017. Sensitivity analysis and probabilistic re-entry modeling for debris using high dimensional model representation based uncertainty treatment. Adv Space Res. 59(1):193–211.10.1016/j.asr.2016.08.032Search in Google Scholar

Meng Z, Gao S, Wang Z, Zhou W. 2015. Circumlunar free return trajectories design and validation for high-speed moon-to-earth reentry mission. Sci Sin Technol. 45(3):249–256.10.1360/N092014-00474Search in Google Scholar

Ning B, Xie J, Shan Z. 2019. Sorting method for multi-attribute decision-making based on relative entropy and VIKOR. Math Practice Theory. 49(4):35–45.Search in Google Scholar

Ono G, Terui F, Ogawa N, Mimasu Y, Yoshikawa K, Takei Y, et al. 2020. Design and flight results of GNC systems in Hayabusa2 descent operations. Astrodynamics. 4(2):105–117.10.1007/s42064-020-0072-ySearch in Google Scholar

Peña-Asensio E, Trigo-Rodrıguez JM, Langbroek M, Rimola A, Robles AJ. 2021. Using fireball networks to track more frequent reentries: Falcon 9 upper-stage orbit determination from video recordings. Astrodynamics. 5(4):347–358.10.1007/s42064-021-0112-2Search in Google Scholar

Phillips TH. A common aero vehicle (CAV) model, description, and employment guide. USA Corporation; 2003.Search in Google Scholar

Putnam ZR, Bairstow SH, Braun RD, Barton GH. 2008. Improving lunar return entry range capability using enhanced skip trajectory guidance. J Spacecr Rockets. 45(2):309–316.10.2514/1.27616Search in Google Scholar

Qiao H, Li Z, Li X, Sun P. 2017. A unified numerical method for aircraft accessibility problems. J Ballist. 29(4):9–14.Search in Google Scholar

Rea JR, Putnam ZR. A comparison of two Orion skip entry guidance algorithms. AIAA Guidance, Navigation and Control Conference and Exhibit; 2007 Aug 20–23; Hilton Head, SC, USA. AIAA; 2007. p. 2007–6424.10.2514/6.2007-6424Search in Google Scholar

Richie G. The common aero vehicle: space delivery system of the future. AIAA Space Technology Conference and Exposition; 1999 Sep 28–30; Albuquerque, USA. AIAA Press; 1999. p. 1999–4435.10.2514/6.1999-4435Search in Google Scholar

Roh H, Oh YJ, Tahk MJ, Kwon K-J, Kwon H-H. 2020. L1 penalized sequential convex programming for fast trajectory optimization: with application to optimal missile guidance. Int J Aeronaut Space Sci. 21(2):493–503.10.1007/s42405-019-00230-0Search in Google Scholar

Sánchez-Sánchez C, Izzo D. 2018. Real-time optimal control via deep neural networks: study on landing problems. J Guid Control Dyn. 41(5):1122–1135.10.2514/1.G002357Search in Google Scholar

Succa M, Boscolo I, Drocco A, Malucchi G, Dussy S. 2016. IXV avionics architecture: Design, qualification and mission results. Acta Astronaut. 124:67–78.10.1016/j.actaastro.2016.01.006Search in Google Scholar

Taheri E, Arya V, Junkins JL. 2021. Costate mapping for indirect trajectory optimization. Astrodynamics. 5(4):359–371.10.1007/s42064-021-0114-0Search in Google Scholar

Tang X, Wang J, Xiao Z. 2019. Landing point prediction ballistic reentry spacecraft. J Nanjing Univ Aeronaut Astronaut. 51(S):145-148.Search in Google Scholar

Terui F, Ogawa N, Ono G, Yasuda S, Masuda T, Matsushima K, et al. 2020. Guidance, navigation, and control of Hayabusa2 touchdown operations. Astrodynamics. 4(4):393–409.10.1007/s42064-020-0086-5Search in Google Scholar

Vinh NX, Busemann A, Culp RD. Hypersonic and planetary entry flight mechanics. Ann Arbor, USA: The University of Michigan Press; 1980.Search in Google Scholar

Vinh NX. Optimal trajectories in atmospheric flight. New York: Elsevier; 1981. p. 222–224.Search in Google Scholar

Vivani A, Pezzella G. Winged re-entry vehicles: Aerodynamic and aero thermo dynamic analysis of space mission vehicles. Berlin: Springer International Publishing; 2015. p. 571–701.10.1007/978-3-319-13927-2_6Search in Google Scholar

Wang J, Bian H, Chen X, Shen Y, Zhao W. 2014. Research on impact point prediction methods of CZ-2F rocket fairing Debris. Zairen Hangtian. 20(5):457–460.Search in Google Scholar

Wang J, Liang H, Qin X, Qi Z, Li Z. 2019. Mapped Chebyshev pseudo spectral methods for optimal trajectory planning of differentially flat hypersonic vehicle systems. Aerosp Sci Technol. 89(6):420–430.10.1016/j.ast.2019.04.017Search in Google Scholar

Wang Y, Yang M, Yu D, Qiang D, Wang Z, Xu Y. 2021. Skip-reentry guidance, navigation, and control technology for the Chang’e-5 lunar-return vehicle. Sci SinTech. 51:799–812.Search in Google Scholar

Wang Z, Grant MJ. 2017. Constrained trajectory optimization for planetary entry via sequential convex programming. J Guid Control Dyn. 10(10):2603–2615.10.2514/6.2016-3241Search in Google Scholar

Wei W, Li H, Li J, Gu J. 2022. Ballistic impact point prediction method based on UKF algorithm. Ordnance Ind Automat. 41(2):70–74.Search in Google Scholar

Wu Y, Deng J, Li L, Su X, Lin L. 2021. A hybrid particle swarm optimization-gauss pseudo method for reentry trajectory optimization of hypersonic vehicle with navigation information model. Aerosp Sci Technol. 118:107046.10.1016/j.ast.2021.107046Search in Google Scholar

Yang S, Wang Z. 2020. A deep learning-based approach to real-time trajectory optimization for hypersonic vehicles. AIAA Scitech 2020 Forum; 2020 Jan 6–10; Orlando, FL, USA. AIAA; 2020. 10.2514/6.2020-0023.Search in Google Scholar

You S, Wan C, Dai R, Lu P, Rea JR. 2020. Learning-based optimal control for planetary entry, powered descent and landing guidance. AIAA Scitech 2020 Forum; 2020 Jan 6-10; Orlando (FL), USA. AIAA. p. 849.10.2514/6.2020-0849Search in Google Scholar

You Z, Yang Y, Liu G, Cao X, Zheng H. 2021. Reentry guidance algorithm based on Kalman filter for aerospace vehicles. Hangkong Xuebao. 42(11):524608.Search in Google Scholar

Received: 2022-04-23
Revised: 2022-04-30
Accepted: 2022-05-02
Published Online: 2022-06-07

© 2022 Hong Ma et al., published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

Downloaded on 8.6.2024 from https://www.degruyter.com/document/doi/10.1515/astro-2022-0026/html
Scroll to top button