首页 | 本学科首页   官方微博 | 高级检索  
     

基于序列凸规划的运载火箭轨迹在线规划方法
引用本文:程晓明,尚腾,徐帆,王晋麟,姚寅伟. 基于序列凸规划的运载火箭轨迹在线规划方法[J]. 宇航学报, 2021, 42(2): 202-210. DOI: 10.3873/j.issn.1000-1328.2021.02.008
作者姓名:程晓明  尚腾  徐帆  王晋麟  姚寅伟
作者单位:北京航天自动控制研究所,北京 100854
摘    要:针对大气层内气动力对轨迹规划求解实时性与收敛性的影响,提出一种基于模型补偿序列凸规划的大气层内火箭轨迹规划方法.该方法的核心思想是通过设计一种序列补偿的方式,将火箭动力学中非线性项(气动力加速度与重力加速度)与过程约束项(动压、过载约束等)进行凸化,从而将轨迹规划问题转化为序列凸规划问题而得到快速求解.在此基础上,本文...

关 键 词:运载火箭  序列凸规划  轨迹在线规划  大气层内  模型补偿
收稿时间:2019-12-05

Online Trajectory Planning for Launch Vehicles withSuccessiveConvex Programming
CHENG Xiao ming,SHANG Teng,XU Fan,WANG Jin lin,YAO Yin wei. Online Trajectory Planning for Launch Vehicles withSuccessiveConvex Programming[J]. Journal of Astronautics, 2021, 42(2): 202-210. DOI: 10.3873/j.issn.1000-1328.2021.02.008
Authors:CHENG Xiao ming  SHANG Teng  XU Fan  WANG Jin lin  YAO Yin wei
Affiliation:Beijing Aerospace Automatic Control Institute, Beijing100854, China
Abstract:A model compensation version ofsuccessive convex programming is developed to account for aerodynamicdispersions and applied to the atmospheric rocket trajectory planning problem.A strategy to successively compensate the nonlinear terms in the vehicledynamics is proposed, with which the original problem can be transformed into aconvex one and then solved rapidly. A method to successively convexify the pathconstraints is developed, which is capable of addressing the nonconvex pathconstraints without slowing the optimization process. At last, the convergenceis analyzed theoretically. The simulation results suggest that the proposedmethod can generate trajectories autonomously and rapidly for launch vehiclesboth in landing phase and in ascent flight. Besides, the convergence rate ofthe method meets the real time requirement.
Keywords:Launch vehicles  Successive convex programming  Onlinetrajectory planning  Endoatmospheric  Model compensation  
本文献已被 CNKI 等数据库收录!
点击此处可从《宇航学报》浏览原始摘要信息
点击此处可从《宇航学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号