Indirect method for solving the reentry trajectory with maximum cross range

Yong Yuan Li, Yi Jiang*, Wei Tao Gao, Chun Ping Huang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

The indirect method cannot obtain the solution of global trajectory optimization, since the difficulty of evaluating initial values of conjugate variables which are highly sensitive. To overcome that disadvantage, a hybrid genetic algorithm is introduced in this paper to search initial value of conjugate variables and the equations are solved to obtain the reentry trajectory with maximum cross range. In the optimization process, the constraints of equations, such as heating rate, dynamic pressure and overload, could be handled as penalty functions which could convert the feasible solution to unconstrained problem by penalty conversion. Numerical simulations confirm the applicability of the presented algorithm and some typical spacecraft gliding trajectories are optimized.

Original languageEnglish
Pages (from-to)665-668
Number of pages4
JournalBeijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
Volume33
Issue number7
Publication statusPublished - Jul 2013

Keywords

  • Hybrid genetic algorithm
  • Maximum cross range
  • Reentry trajectory
  • Reentry vehicle

Fingerprint

Dive into the research topics of 'Indirect method for solving the reentry trajectory with maximum cross range'. Together they form a unique fingerprint.

Cite this