Boost-Phase Trajectory Planning with the Nonregular Reachable Area Constraints
During emergency return or mission change, the boost-glide vehicle needs to meet the nonregular reachable area constraints (NRACs). Therefore, this paper introduced NRACs into boost-phase trajectory planning to extend the maneuvering range and enhance the mission adaptability of boost-glide vehicle. Firstly, the library of the reachable area boundaries was constructed with the fast computation method under the deviations of boost terminal states, and the polynomials were used to fit the boundary parameters. Secondly, the nonlinear mapping relationship between the reachable area boundary parameters and the deviations of boost terminal states was obtained by the deep neural networks (DNNs). Then, the new boundary parameters were obtained by the constraint transformation rules under NRACs and the separation window constraints and transformed into the constraints of the boost-phase terminal states by DNNs. Finally, the hp-adaptive pseudospectral method (hpPM) was adopted to complete the trajectory planning considering the path and terminal constraints. The simulation results showed that the proposed trajectory planning method considering NRACs had high trajectory planning accuracy and good deviation adaptability and exhibited excellent performance in the adjustment of reachable area. This study provides theoretical support for integrate mission decisions and trajectory planning of boost-glide vehicles.
Proposed by X. S. Qian in 1948, boost-glide vehicles, characterized with high lift-to-drag ratio, high altitude and velocity, and large flight envelope, are capable of long-range maneuvering, defense penetration, and target changing . Diversified launch modes and multistage boosters have greatly expanded the glider’s application scope. In particular, the air-based launch mode allows the glider to quickly obtain the initial states in a specified direction, which brings great convenience for mission expansion. To reach the designated mission area precisely, suitable initial conditions of the glider are required for the boost-phase trajectory planning. Compared with the gliding phase, the boost phase is characterized by shorter flight time and weaker mobility, and it can significantly affect the reachable area by changing the initial conditions of the glider. Therefore, boost-phase trajectory planning has become one of the critical technologies affecting mission reachability.
Under the preset separation conditions, boost-glide vehicles only depend on the gliding phase trajectory planning to meet the landing point constraints. In the case of emergency return of lift-body spacecraft with a booster during the ascending phase or in the case of the terminal mission change of the boost-glide vehicle during the boost stage, the spacecraft or the vehicle needs to meet the temporary constraints of terminal reachable area, and the adjustment ability of the gliding phase may not be enough to meet the constraints. Therefore, the authors consider using the remaining fuel in the booster to replan the boost-phase trajectory, make the glider reach more appropriate separation conditions, and make full use of the maneuverability of different flight phases to meet the terminal constraints. At the same time, the boost-phase trajectory is affected by the initial state of the vehicle, the combined action of aerodynamic force and engine thrust, and the environmental disturbances and needs to satisfy various constraints such as process state quantity, control angle, angular rate, and the quantity of terminal state quantity. Therefore, boost-phase trajectory planning is a complex practical problem to be addressed.
With the rapid development of trajectory optimization theory [2–4], trajectory planning methods are mainly divided into methods based on optimal control principle, optimization theory, and artificial intelligence technology. Among them, the methods based on optimization theory have advantages in flexibility, but the online computing performance under complex constraints needs to be improved; the methods based on artificial intelligence technology have advantages in efficiency and adaptability . The multiconstraint trajectory planning problem can be better solved with the rapid development of optimization theory and artificial intelligence technology . In literature , a full-phase optimization model of the boost-glide vehicle was established, and the furthest range trajectory planning problem was solved via segment optimization. In literature [8–10], the gliding-phase trajectory planning problem satisfying the range and path constraints was investigated. In literature , the orthogonal test method was used to determine the optimal initial glide conditions and effective results were obtained. However, the connection between the reachable area and the boost terminal states was not established. In literature , the solution of the reachable area was transformed into a series of longest ranges to the virtual target points, and the optimal control theory and quasi-equilibrium glide condition were adopted to turn the longest ranges into univariate iterative problems, so that high computational accuracy and convergence speed were obtained. However, the actual coverage requirements were not considered in the boost-phase trajectory planning.
DNNs/heuristic-based trajectory optimization algorithms have been widely studied. In reference [13, 14], a two-step strategy based on the trajectory optimization method and DNN attitude controller was proposed, which could better solve the problems in real-time attitude and trajectory planning and control for hypersonic vehicles. The desensitized/multiobjective trajectory optimization method generated the optimal reentry trajectory. In contrast, DNNs were used to obtain the optimal control attitude command matching the states, which could not realize the feedback from the reachable area constraints to the boost terminal states. Moreover, the thrust was not considered in the optimization model, so it could not be applied to the powered boost-phase trajectory optimization. In reference , a stochastic trajectory optimization framework was proposed to solve chance constraints, which could be used for the reentry trajectory planning of hypersonic vehicles under noise-perturbed dynamics and probabilistic constraints. In reference , a hybrid optimization algorithm composed of an initial value generator and an internal solver was proposed, which showed improved the convergence and stability. However, the algorithm proposed could not quickly calculate and adjust the reachable area.
Although heuristic algorithms such as the multiobjective genetic algorithm  and gray wolf algorithm  have been widely studied and developed, the pseudospectral method is still one of the mainstream algorithms applied in the field of ascending trajectory planning . On the basis of the equivalence between the Karush-Kuhn-Tucker (KKT) conditions of the parametric nonlinear program problem (NLP) and the discrete Hamiltonian boundary value problem (HBVP) , the Gaussian pseudospectral method with higher accuracy and convergence speed has been widely used in the boost-phase trajectory planning [21, 22]. With ever-increasing solution scale of trajectory planning problem under complex constraints in recent years, the hp-adaptive discrete grid updating method has been integrated into the Gaussian/Radau pseudospectral method for trajectory planning .
To extend the maneuvering range of the boost-glide vehicle and meet NRACs, parametric descriptions of the reachable area, reachable area constraint transformation, and the boost-phase trajectory planning were studied in this paper. The main contributions of the work in this paper are drawn from the following three aspects. (1)The NRACs were introduced into the boost-phase trajectory planning via constraint transformation to extend the maneuvering range and enhance mission adaptability(2)A parametric method was designed to describe the reachable area boundary of the boost-glider vehicle, and DNNs were adopted to obtain the mapping relationship between the reachable area boundary and the booster’s separation point states(3)The energy equivalence principles were proposed to deal with the separation window constraints, and the hp-adaptive pseudospectral method was adopted to plan the trajectory under path and terminal constraints
The remainder of this paper is organized as follows. Firstly, the problem formulation and methodological framework are established in Section 2. Secondly, the reachable area boundary library is established by the reachable area fast calculation method under initial deviations of states and environmental perturbations. And the boundaries of the reachable area are parameterized by the polynomial in Section 3. Next, constraints transformation rules, relational mapping of deep neural networks, and energy equivalence principles are proposed to transform the nonregular reachable area constraints into the terminal state constraints of the boost phase in Section 4. Then, the hpPM is adopted to plan the boost-phase trajectory under the path and terminal constraints in Section 5. Finally, the simulation analyses of the proposed method are carried out under the nonregular reachable area constraints in Section 6.
2. Problem Formulation and Methodological Framework
2.1. Problem Formulation
The boost-glide vehicle has two flight phases: the boost phase and gliding phase. The mathematical motion model of the boost phase can be established in the launch coordinate system as follows . where denotes the velocity vector; , , and denote the three components of position, respectively; and denote the transformation matrix from the body-fixed coordinate system and velocity coordinate system to the launch coordinate system, respectively; denotes the engine’s thrust; , , and denote the drag, lift, and lateral force coefficients, respectively; and denote the dynamic pressure and pneumatic reference area, respectively; and (which can be decomposed into , , and ) denote the geocentric vector diameter and earth rotation rate, respectively; and denote the gravitational components along the direction of the geocentric vector and the direction of the earth’s rotation, respectively; is the gravitational acceleration at sea level; is specific impulse; is engine consumption per second.
The dynamics model of the gliding phase is given as follows . where ; denotes the radius of the earth, and is the height; and denote the aerodynamic lift and drag, respectively; and denote the latitude and longitude, respectively; is the velocity; and denote the flight path angle and heading angle, respectively.
The state equations of the boost terminal point need to be introduced to ensure the continuity of the motion equation. where and denote the geocentric distance components in the and directions in the geocentric coordinate system, respectively; and denote the velocity vector components in the and directions in the local Cartesian coordinate coordinate system (ENU), respectively.
denotes the coordinate conversion matrix from the launch coordinate system to the geocentric coordinate system, denotes the coordinate conversion matrix from the geocentric coordinate system to ENU. , , , and can be represented as follows . where is the direction cosine matrix of rotation about axis; , , and denote the pitch angle, yaw angle, and roll angle, respectively; , , and denote the trajectory inclination angle, trajectory deflection angle, and velocity inclination angle, respectively; , , and denote the initial latitude, longitude, and launch azimuth, respectively.
2.2. Methodological Framework
The boost-phase trajectory planning method considering NRACs proposed in this paper mainly consists of six parts. ① Polynomial was selected to parameterize the reachable area boundary obtained by the fast calculation method. ② The constraint transformation rules were proposed to calculate the new reachable area boundary parameters under NRACs. ③ DNNs were trained for the relationship mapping between the boost terminal states and the boundary parameters. ④ The initial values of the boost terminal states were obtained by the trained DNNs and the new reachable area boundary parameters. ⑤ Energy equivalence principles were proposed for the optimal boost terminal states under the separation window constraints. ⑥ The hpPM was used to plan the boost-phase trajectory considering path and terminal constraints. Therefore, the methodological framework is shown in Figure 1.
3. Parametric Description of the Reachable Area
3.1. Fast Calculation Method of the Reachable Area
The problem of the reachable area calculation can be decomposed into the issues on the longest ranges from the separation point to the virtual target points, as shown in Figure 2. denotes the virtual target points; is the initial velocity direction of the vehicle; represents the longest ground projection points under the energy management conditions, i.e., the farthest arrival points.
When solving the issues on the longest range in the reachable area solution, the earth rotation, oblateness, and gravitational perturbation can be ignored, and the dynamic equations can be simplified based on the quasi-equilibrium glide condition. where and denote the aerodynamic lift coefficient and drag coefficient in the gliding phase, respectively.
The subproblem can be transformed into the following optimal control form: where denotes the range; denotes the performance index; denotes the states; denotes the right end term of the system differential equations; , , , and represent the corresponding covariate variables, respectively; is Hamiltonian. The pitch angle is the only control variable when the attack profile is given in segments.
Since the Hamiltonian function does not consider time, the analytical form of the optimal control solution can be obtained by using the control equation and the costate Equation (12): where and denote the latitude and longitude of the virtual target point, respectively; and denote the terminal latitude and longitude of the gliding phase, respectively. The optimal control solution satisfying the requirements of the longest range can be found by iterating the univariate . The reachable area boundary can be obtained by connecting the farthest arrival point obtained by solving the issues on the longest range.
The reachable area shown in Figure 3 can be obtained by the fast calculation method by superimposing the normal distribution deviation shown in Table 2 on the nominal initial states. At the same time, the coordinate data of the reachable area is normalized to facilitate the fitting calculation of large data samples.
3.2. Parametric Description
Considering that the boundary of the reachable area is a continuous closed curve connected by a series of boundary points, it can be described by curve parameters. Suppose that the boundary of the reachable area can be defined in the form of the following curve:
The least-square method is used to select the best fitting curves in different forms. The fitting results of different forms of curves are shown in Table 3.
The fitting results show that too much increase in the order and complexity of the curve will increase the fitting deviation. Therefore, the curve form corresponding to No. 3 is finally selected as the parametric description form of the reachable area boundary. The results after parameter normalization are shown in Figure 4.
4. Reachable Area Constraint Transformation
4.1. Constraint Transformation Rules
This section describes the method to transform NRACs to generate new coverage envelopes about the reachable area. As shown in Figure 5, the projection of the boost terminal point on the ground is the origin , and the coordinate system is established in the horizontal plane, with the axis in the same direction as the projection of the initial velocity direction on the ground. The original terminal states of the boost phase are ; is the reachable area boundary curve generated by ; the nonregular reachable area is ; the distance from the farthest point in to the coordinate origin is ; the angle between and formed by the left and right boundary points of and the coordinate origin is ; the centerline of is the new axis ; the angle between and is ; denotes the new reachable area boundary curve, so the key of the issue is to solve the parameters of .
Whether the original terminal states of the boost phase are appropriate can be judged by the relative position relationship between the boundary points of and the boundary of the original reachable area. where is the number of divisions when judging the boundary for ; is the distance from the coordinate origin to the boundary judgment point. The judgment conditions must be satisfied simultaneously to determine whether the original terminal states of the boost phase are appropriate. The number of divisions can be obtained according to the description accuracy of the reachable area and the shape of .
When the original terminal states of the boost phase do not meet NRACs, the change of initial heading angle can bring great convenience to the adjustment of the reachable area. However, the reachable area adjusted by the initial flight direction may still not meet the coverage requirements. Therefore, the judgments need to be reconducted in the new -coordinate system.
When the judgment conditions cannot be satisfied simultaneously, the new boundary parameters can be adjusted and determined according to the range of values of the boundary parameters.
As a supporting parameter, the parameter varies inversely and equivalently with the adjustment of . The adjustment strategies for the three parameters are shown in Figure 6.
4.2. Relational Mapping of Deep Neural Networks
The relationship between the reachable area boundary parameters and the boost terminal states needs to be mapped to obtain effective boost terminal states. The same reachable area may correspond to multiple sets of boost terminal states. However, the reachable area boundary parameters caused by the deviation of the boost terminal states are unique. Therefore, it is possible to construct the mapping relationship to realize the transformation from the reachable area boundary to the terminal state increments of the boost phase. Thus, the networks of altitude, velocity, and flight path angle as shown in Figure 7 are established.
Generally, the neural networks with 1~2 hidden layers can fit the nonlinear smooth mapping with arbitrary accuracy, and the ability of neural networks to describe complex learning can be increased by introducing the third hidden layer . For the training of neural networks with three parameters of the reachable area boundary as input and one terminal state increment of the boost phase as output, the number of hidden layers was set to 3 in this study. For the hyperparameter setting of other hidden layer neural networks, some meaningful manual optimization rules were given in Nielsen’s works . In literature [27, 28], an automatic optimization method of hyperparameters using grid search technology was introduced. Therefore, this paper only briefly gives the process of determining the number of hidden layers: firstly, the number of nodes in each hidden layer is set to 2~20; then, the number of hidden layer nodes is increased in turn for network training; finally, the network structure with the least total error on the verification is recorded as the optimal neural network structure.
4.3. Energy Equivalence Principles
It is necessary to adopt the optimal adjustment strategy of the reachable area according to the influence of the boost terminal states considering limited fuel. Under fixed time constraints, the trajectory optimization was carried out with the boost terminal point’s altitude, velocity, and flight path angle as performance indexes. By taking the obtained boost terminal states as the initial condition for the glider, the reachable area boundaries under different energy consumption conditions (100 kg, 200 kg, and 300 kg fuel increase, respectively) as shown in Figure 8 are obtained by the method in Section 3.1.
Under the same energy consumption conditions, the reachable area obtained by raising the velocity of the boost terminal was larger than the reachable area obtained by raising the flight path angle of the boost terminal, and both were larger than the reachable area obtained by increasing the height of the boost terminal. Therefore, on the basis of getting the new reachable area boundary parameters, the terminal states of the boost phase can be obtained through DNNs described in Section 4.2. The selection priority of the mapping networks is velocity networks>flight path angle networks>altitude networks.
Although the selection priority can maximize the reachable area, the terminal states of the boost phase must be within a certain limit due to the debris drop point constraints, separation conditions, and the limitation of the glider’s navigation communication window. Assume that the separation window constraints of the booster based on the nominal terminal states are . When the boost terminal states obtained by DNN exceed the separation window constraints, the energy equivalence principles are adopted to obtain the new boost terminal states.
The contents of the energy equivalence principles are as follows. ① After the reachable area boundary parameters are obtained by the constraint transformation rules, the velocity networks can be used to obtain the boost terminal velocity increment . If , the final boost terminal state constraints are ; if , proceed to the next step. ② Let and interpolate Table 4 with to obtain the reachable area boundary parameter increment ; then, the flight path angle neural networks can be used to obtain the new boost terminal increment of the flight path angle . If , the final boost terminal state constraints are ; if , proceed to the next step. ③ Let and interpolate Table 4 with to obtain the increment of reachable area boundary parameters ; then, the height neural networks are used to obtain the new boost terminal height increment . If , the final boost terminal state constraints are ; if , the constraint window is exceeded, and the boost terminal states are set to the maximum separation window constraints .
5. Boost-Phase Trajectory Planning
After obtaining the terminal state constraints of the boost phase, the trajectory from the initial point to the new terminal point needs to be replanned. Unlike the trajectory tracking with a known reference trajectory , the boost-phase trajectory is replanned under the condition that the initial value is not ideal or there is no reference trajectory in this study. At the same time, the trajectory planning method needs to overcome the impacts of initial deviation and environmental disturbance conditions and needs to meet the process constraints such as states and control and the given terminal states constraints.
The Gaussian pseudospectral method can be used to realize fast and accurate trajectory replanning to meet the requirements of low sensitivity to initial values, good convergence, and high accuracy. Aiming at the “Dimensional Catastrophe” of Jacobian and Hessian matrices and the slow convergence speed when solving nonsmooth problems, the hp-type adaptive finite element method (hp-FEM) is used, which allows the segment length and the order of basis function to change adaptively on the mesh profile at the same time.
By taking the longest range of the boost phase is taken as the performance index, the boost-phase trajectory planning problem is converted into an optimal control problem: where denotes the states; denotes the control variables; denotes the dynamic equations corresponding to Equation (1); is the time interval; denotes the boundary constraints; denotes the path constraints; is the latitude and longitude of the launch point; is the latitude and longitude of the terminal location of the boost phase.
The control variables are the attack angle and sideslip angle:
Boundary constraints are as follows: where , , , and denote the terminal altitude, velocity, flight path angle, and heading angle, respectively.
Path constraints are as follows:
The time, states, and control variables must be transformed and discretized. denotes the discretized states, and denotes the control variables. The time interval is converted into [-1,1].
Taking Legendre-Gauss points and as nodes, the Lagrange interpolation polynomials are formed as basis functions to approximate the states.
The approximation of control variables are as follows:
Furthermore, the kinetic differential equations can be transformed into algebraic constraints.
where is the differential matrix derived from the Legendre polynomial; is the root of the Legendre polynomial .
Discrete approximation of path constraints are as follows:
Discrete approximation of boundary constraints are as follows:
Since the terminal states are not included in the state approximation, a discrete approximation can be performed using Gaussian integration to satisfy the dynamics constraints.
The optimal control problem has been transformed into a discrete nonlinear programming problem, which can be solved using the large-scale sequential quadratic programming-based SNOPT solver.
There have been a great number of research achievements on using the hp-adaptive pseudospectral method to solve the trajectory planning problem [30–32]. The convergence of the Gaussian pseudospectral method has been studied and described in reference . Therefore, this paper will not repeat this part but only discuss the convergence range of the deviation conditions in the simulation section.
6. Simulation and Analysis
6.1. Simulation Settings
The simulation configuration is Intel (R) Core (TM) i7-10510U. The general parameters of the vehicle, mission parameters, disturbances, and deviation conditions required for the simulation are given in Tables 5–7.
6.2. Simulation Results
(1)Training results of deep neural networks
Three different DNNs were trained using the parameterized reachable area boundary library in Section 3.2 as the samples. From the single hidden layer network structure of three neurons, the depth and breadth of neural network are gradually increased until the accuracy requirements are met. The training, verification, and test results are shown in Figures 9–11.
The simulation results show that all three deep neural networks have achieved convergence, with training and testing accuracy higher than 99%. The generated demand reachable area boundary parameter increments are based on the previous geometric relations. (2)Simulation of boost-phase trajectory planning
To verify the effectiveness of the proposed trajectory planning method and analyze the algorithm’s performance, NSGA II as a widely used evolutionary algorithm was used in simulation experiments for comparison. The principle of NSGA II is referred to in .
Optimization objectives where , , , and are the terminal states deviations; denotes the terminal range.
Control variables where denotes of the attack angle at linear interpolation node; denotes the change rate of sideslip angle.
Other main parameters are shown in Table 8.
The terminal constraints of the boost phase obtained by using neural networks are , , , . “hpPM” represents the planning result of the hp-adaptive pseudospectral method, “verification” denotes the integral verification result of the hp-adaptive pseudospectral method, and “ NSGA II” represents the planning result of the improved nondominated sorting genetic algorithm. The trajectory planning curves are shown in Figures 12–21, and the comparison results of two methods are shown in Table 9.
The results show that ① the boost-phase flight trajectory obtained by the hpPM that met the requirements of dynamic integration verification; ② the terminal planning accuracy of hpPM was higher than that of NSGA II; ③ the trajectory obtained by hpPM had a larger range than that obtained by NSGA II; ④ the change rate of control angle planned by hpPM was more stable than that by NSGA II in longitudinal profile; the control angle and the change rate of control angle were the same in transverse profile; ⑤ the timeliness of hpPM was significantly better than that of NSGA II. (3)Influence of disturbances and deviations
Due to the influence of NRACs, the boost-phase trajectory planning with fixed working time has been a challenge. To analyze the impacts of initial state deviations, power system deviation, and environmental disturbances on hpPM, it is necessary to conduct simulation experiments under the limit energy deviation as shown in Table 7. The trajectory planning curves are shown in Figures 22–31, and the results of model uncertainty and disturbances are shown in Table 10.
Due to limited fuel, the adjustment ability of the boost-glide vehicle is limited. Therefore, a limited energy deviation of trajectory planning failure is of great importance. The minimum energy deviation will seriously reduce the flight maneuverability, making the boost-glide vehicle barely reach the designated mission point with the loss of working performance; the maximum energy deviation will make the boost-glide vehicle produce excess flight maneuverability, leading to a large oscillation of attitude angle and instability of flight.
The results show that ① for the maximum energy deviation, the velocity, flight path angle, and heading angle of boost-glide vehicle met the terminal indexes, but the altitude and range were greater than the nominal case, and an over large change rate of control angle was produced. If the magnitude of energy deviations continued to increase, the boost-glide vehicle would lose stability easily or exceed the separation window constraint; ② for the minimum energy deviation, the altitude, flight path angle, and heading angle of the boost-glide vehicle fully met the terminal indexes, but the velocity and range were less than the nominal case. If the magnitude of energy deviations continued to increase, the reachable area of the boost-glide vehicle would be seriously reduced. Therefore, the disturbances and deviations listed in Table 7 can be considered as the failure range of the trajectory planned by hpPM under the mission specified in Table 6. (4)The verification simulation of the reachable area
After obtaining the deviations of the range, height, and velocity of the boost terminal point, the distribution of reachable area can be calculated, and the effectiveness of the proposed trajectory planning method considering NRACs can be further analyzed. In the comparison of reachable area distribution, “nominal reachable area” refers to the maneuvering range of the boost-glider vehicle without any adjustments; “demand boundary” refers to the maneuvering range meeting NRACs obtained by the constraint transformation rules; “maximum/minimum energy” represents the maneuvering range under the influence of disturbances and deviations. The results are shown in Figure 32.
The results show that ① the nominal reachable area could not meet the requirements of NRACs, but the demand boundary transformed by the method proposed in this paper completely covered the area specified by NRACs; ② the actual maneuvering range of the boost-glide vehicle still met NRACs under the influence of disturbances and deviations; ③ the average deviation between the actual reachable area boundary and the demand boundary under the limit energy deviation was 3.9%. The above results indicated that the proposed trajectory planning method considering NRACs was sufficiently capable of adjusting the reachable area and had high trajectory planning accuracy and good deviation adaptability.
Aiming at the boost-phase trajectory planning under NRACs, this paper studies the parametric description of the reachable area, the reachable area constraint transformation, and the boost-phase trajectory planning. The NRACs were successfully transformed into the terminal state constraints of the boost phase, and the hpPM was used to complete the trajectory planning. The main conclusions are as follows. (1)The reachable area boundary of the boost-glide vehicle can be described and represented in a simple parametric form. The quadratic form is a feasible solution considering the accuracy and parameter complexity(2)There is a clear relationship between the reachable area boundary described by parameterization and the boost terminal state change. The DNNs can be used for model learning and parameter mapping, with accuracy of model training and testing greater than 99%. In addition, the changes of boost terminal states pose a significant influence on the reachable area, that is, the influence of velocity was greater than that of flight path angle, and the influence of altitude is the most insignificant(3)Using the constraint transformation rules, it is possible to quickly determine the reachable area boundary parameters that meet NRACs after changing the initial flight direction of the boost-glide vehicle through the air-based launch mode or the promotion of the front stage(4)Based on the deep neural networks model and the energy equivalence principles, the appropriate boost terminal states under the separation window constraints can be obtained(5)The boost-phase trajectory planning method based on the hpPM has good timeliness, high planning accuracy, and strong deviation adaptability
Since this paper focuses on the boost-phase trajectory planning method considering NRACs, the determination of the reachable area of the boost-glide vehicle is mainly depended on the fast calculation method described in Section 3.1 in spite of the influences of the deviations and disturbances of the gliding phase. Future research will focus on the influences of combined deviations in different stages.
The image data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The authors declare that there is no conflict of interest regarding the publication of this paper.
This study was supported by the open Fund of National Defense Key Discipline Laboratory of Micro-Spacecraft Technology (Grant No. HIT.KLOF.MST.2018028).
J. Lin, Y. Z. He, and P. X. Huang, “Powered hypersonic vehicle reentry trajectory optimization based on improved multi-phase gauss spectral method,” Control Theory and Applications, vol. 36, no. 10, pp. 1662–1671, 2019.View at: Google Scholar
R. Q. Chai, A. Tsourdos, A. Savvaris, S. C. Chai, Y. Q. Xia, and C. L. P. Chen, “Six-DOF spacecraft optimal trajectory planning and real-time attitude control: a deep neural network-based approach,” IEEE Transactions on Neural Networks and Learning Systems, vol. 31, no. 11, pp. 5005–5013, 2019.View at: Google Scholar
R. Q. Chai, A. Tsourdos, A. Savvaris, Y. Q. Xia, and S. C. Chai, “Real-time reentry trajectory planning of hypersonic vehicles: a two-step strategy incorporating fuzzy multiobjective transcription and deep neural network,” IEEE Transactions on Industrial Electronics, vol. 67, no. 8, pp. 6904–6915, 2020.View at: Publisher Site | Google Scholar
Q. Shi and H. Zhang, “Road-curvature-range-dependent path following controller design for autonomous ground vehicles subject to stochastic delays,” IEEE Transactions on Intelligent Transportation Systems, pp. 1–11, 2022.View at: Google Scholar
M. Bittner, F. Fisch, and F. Holzapfel, “A multi-model gauss pseudospectral optimization method for aircraft trajectories,” in AIAA Atmospheric Flight Mechanics Conference, Minneapolis, America, 2012.View at: Google Scholar
G. T. Huntington, Advancement and analysis of gauss pseudospectral transcription for optimal control problems, Massachusetts Institute of Technology, 2007.
C. Y. Liu and C. Zhang, “Multi-stage trajectory optimization of tactical two-stage booster rocket based on gauss pseudospectral method,” Acta Armamentarii, vol. 40, no. 2, pp. 292–302, 2019.View at: Google Scholar
K. J. Chen, L. H. Liu, and Y. H. Meng, Launch vehicle flight dynamics and guidance, National Defense Industry Press, Beijing, 2014.
M. A. Nielsen, Neural Networks and Deep Learning, Determination Press, San Francisco, America, 2015.
J. Bergstra and Y. Bengio, “Random search for hyper-parameter optimization,” The Journal of Machine Learning Research, vol. 13, pp. 281–305, 2012.View at: Google Scholar
G. Montavon, G. B. Orr, and K. R. Müller, Neural Networks: Tricks of the Trade, Springer, Berlin, Heidelberg, 2012.View at: Publisher Site
R. Q. Chai, A. Savvaris, and A. Tsourdos, “Violation learning differential evolution-based hp-adaptive pseudospectral method for trajectory optimization of space maneuver vehicle,” IEEE Transactions on Aerospace and Electronic Systems, vol. 53, no. 4, pp. 2031–2044, 2017.View at: Publisher Site | Google Scholar
H. Y. Hou, W. Hager, and A. Rao, “Convergence of a Gauss pseudospectral method for optimal control,” in AIAA Guidance, Navigation, & Control Conference, Minneapolis, America, 2012.View at: Google Scholar