Entry trajectory optimization via hp pseudospectral convex programming

Xiao Wanga, Yulin Wang, Shengjing Tang, Jie Guo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

In this paper, a hp pseudospectral sequential convex programming (hp-PSCP) method is proposed to solve the entry trajectory optimization problem. The hp flipped Radau pseudospectral method (FRPM) is utilized to discretize the nonlinear dynamics. By successive linearization technology and introducing new variables, the optimization problem is converted into a series of convex problems and solved by primal-dual interior-point method. Numerical results show that the proposed method provides a good compromise between computational accuracy and speed compared to existing convex methods.

Original languageEnglish
Title of host publicationICINCO 2019 - Proceedings of the 16th International Conference on Informatics in Control, Automation and Robotics
EditorsOleg Gusikhin, Kurosh Madani, Janan Zaytoon
PublisherSciTePress
Pages61-69
Number of pages9
ISBN (Electronic)9789897583803
DOIs
Publication statusPublished - 2019
Event16th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2019 - Prague, Czech Republic
Duration: 29 Jul 201931 Jul 2019

Publication series

NameICINCO 2019 - Proceedings of the 16th International Conference on Informatics in Control, Automation and Robotics
Volume1

Conference

Conference16th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2019
Country/TerritoryCzech Republic
CityPrague
Period29/07/1931/07/19

Keywords

  • Convex programming
  • Entry guidance
  • Pseudospectral method
  • Trajectory optimization

Fingerprint

Dive into the research topics of 'Entry trajectory optimization via hp pseudospectral convex programming'. Together they form a unique fingerprint.

Cite this