Reentry Trajectory Optimization and Simulation of Hypersonic Vehicle with Maximum Cross Range Based on GPM

2014 ◽  
Vol 635-637 ◽  
pp. 1431-1437
Author(s):  
Wu Jun Huo ◽  
Xu Liu ◽  
Li Wang ◽  
Chao Song

Abstract:The application of Gauss pseudospectral method (GPM) to hypersonic aircraft reentry trajectory optimization problem with maximum cross range was introduced. The Gauss pseudospectral method was used to solve the reentry trajectory of the hypersonic vehicle with the maximum cross range. Firstly, the model of hypersonic aircraft reentry trajectory optimization control problem was established. Taking no account of course constraint, the maximum cross range was chosen as optimal performance index, and angle of attack and bank was chosen as control variable. Terminal state was constrained by position and velocity. Then GPM was applied to change trajectory optimization problem into nonlinear programming problem (NLP), and the state variables and control variables were selected as optimal parameters at all Gauss nodes. At last, optimal reentry trajectory was solved by solving the NLP with the help of SNOPT. The simulation results indicate that GPM does not need to estimate the initial cost variable, and it is not sensitive to the initial states and effective to solve trajectory optimization problem.

2011 ◽  
Vol 383-390 ◽  
pp. 7375-7380 ◽  
Author(s):  
Bo Yang ◽  
Shang Sun

According to the nonlinear, multivariable and multi-constraint features of the reentry trajectory optimization problem of airbreathing hypersonic vehicles, a suboptimal solution method is developed. The reentry trajectory generation is converted to a nonlinear programming (NLP) problem by using Gauss pseudospectral method (GPM). The state and control variables on Gauss nodes are chosen as parameters to be optimized and the minimum total heat absorption is chosen as the optimal performance index. Then the sequential quadratic programming (SQP) method is used to solve the NLP problem. The states of optimized trajectory are compared with the states obtained by the integral of kinetic equations. By simulating on an example of airbreathing hypersonic vehicles, it is demonstrated that the above method is not sensitive to the estimate of motion states and is easier to converge. And the method is effective to solve trajectory optimization problems.


2012 ◽  
Vol 591-593 ◽  
pp. 2624-2627
Author(s):  
Xu Zhong Wu ◽  
Sheng Jing Tang ◽  
Jie Guo

This paper deals with the reentry trajectory optimization problem for lunar return with consideration of entry vehicle’s fore-body shape. Three performance objectives are applied in this work: cross range, peak heat flux and total heat load. Aerothermodynamic models are based on modified Newtonian impact theory and semi-empirical correlations for convective and radiative stagnation-point heat transfer. A population based evolutionary algorithm has been executed to optimize the multidisciplinary problem. At last the numerical example showed the Pareto frontiers for spherical segment and sphere cone respectively, one of optimal trajectory designs selected from the Pareto frontiers are showed in this paper. The mission requirements are satisfied through the aerothermodynamic balance.


2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Chun-Mei Yu ◽  
Dang-Jun Zhao ◽  
Ye Yang

A novel sequential convex (SCvx) optimization scheme via the Chebyshev pseudospectral method is proposed for efficiently solving the hypersonic reentry trajectory optimization problem which is highly constrained by heat flux, dynamic pressure, normal load, and multiple no-fly zones. The Chebyshev-Gauss Legend (CGL) node points are used to transcribe the original dynamic constraint into algebraic equality constraint; therefore, a nonlinear programming (NLP) problem is concave and time-consuming to be solved. The iterative linearization and convexification techniques are proposed to convert the concave constraints into convex constraints; therefore, a sequential convex programming problem can be efficiently solved by convex algorithms. Numerical results and a comparison study reveal that the proposed method is efficient and effective to solve the problem of reentry trajectory optimization with multiple constraints.


Sign in / Sign up

Export Citation Format

Share Document