Journal of Astronautics ›› 2021, Vol. 42 ›› Issue (2): 202-210.doi: 10.3873/j.issn.1000-1328.2021.02.008

Previous Articles     Next Articles

Online Trajectory Planning for Launch Vehicles with Successive Convex Programming

CHENG Xiao ming, SHANG Teng, XU Fan, WANG Jin lin, YAO Yin wei   

  1. Beijing Aerospace Automatic Control Institute, Beijing 100854, China
  • Received:2019-12-05 Revised:2020-06-21 Online:2021-02-15 Published:2021-02-15

Abstract: A model compensation version of successive convex programming is developed to account for aerodynamic dispersions and applied to the atmospheric rocket trajectory planning problem. A strategy to successively compensate the nonlinear terms in the vehicle dynamics is proposed, with which the original problem can be transformed into a convex one and then solved rapidly. A method to successively convexify the path constraints is developed, which is capable of addressing the nonconvex path constraints without slowing the optimization process. At last, the convergence is analyzed theoretically. The simulation results suggest that the proposed method can generate trajectories autonomously and rapidly for launch vehicles both in landing phase and in ascent flight. Besides, the convergence rate of the method meets the real time requirement.

Key words: Launch vehicles, Successive convex programming, Online trajectory planning, Endoatmospheric, Model compensation

CLC Number: