宇航学报

宇航学报 ›› 2021, Vol. 42 ›› Issue (2): 202-210.doi: 10.3873/j.issn.1000-1328.2021.02.008

• 制导、导航、控制与电子 • 上一篇    下一篇

基于序列凸规划的运载火箭轨迹在线规划方法

程晓明，尚腾，徐帆，王晋麟，姚寅伟   

  1. 北京航天自动控制研究所，北京 100854
  • 收稿日期:2019-12-05 修回日期:2020-06-21 出版日期:2021-02-15 发布日期:2021-02-15

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

PDF

196

摘要： 针对大气层内气动力对轨迹规划求解实时性与收敛性的影响，提出一种基于模型补偿序列凸规划的大气层内火箭轨迹规划方法。该方法的核心思想是通过设计一种序列补偿的方式，将火箭动力学中非线性项(气动力加速度与重力加速度)与过程约束项(动压、过载约束等)进行凸化，从而将轨迹规划问题转化为序列凸规划问题而得到快速求解。在此基础上，本文理论分析了该序列凸规划方法的收敛性，保证该方法能够收敛到原问题的最优解。数值仿真表明，该方法能够完成大气层内的火箭上升段与垂直着陆段轨迹在线规划任务，方法的收敛速度能满足轨迹在线生成的实时性要求。

关键词:

运载火箭, 序列凸规划, 轨迹在线规划, 大气层内, 模型补偿

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

中图分类号: