宇航总体技术2024,Vol.8Issue(6) :1-9.DOI:10.20210/j.issn.2096-4080.2024.06.001

基于连续凸近似的多阶段弹道重规划求解算法

An Algorithm for Multistage Trajectory Replanning Based on Successive Convex Approximation

谭宇霄 彭博 邓智斌 王宇 李莉
宇航总体技术2024,Vol.8Issue(6) :1-9.DOI:10.20210/j.issn.2096-4080.2024.06.001

基于连续凸近似的多阶段弹道重规划求解算法

An Algorithm for Multistage Trajectory Replanning Based on Successive Convex Approximation

谭宇霄 1彭博 2邓智斌 3王宇 2李莉2
扫码查看

作者信息

  • 1. 中国科学院大学,北京 100190
  • 2. 北京宇航系统工程研究所,北京 100076
  • 3. 中国科学院大学,北京 100190;数字经济监测预测预警与政策仿真教育部哲学社会科学实验室,北京 100190
  • 折叠

摘要

运载火箭弹道重规划问题是航天工程中至关重要的问题之一.目前运载火箭弹道重规划方法尚未对特定的多阶段弹道优化模型的特殊结构进行深入挖掘,计算效率有待进一步提升.通过建立多阶段弹道重规划问题模型,开展模型结构特性分析,最终在连续凸优化近似框架下构建了高效的定制化内点算法,以实现高精度、高鲁棒性的多阶段弹道重规划问题在线求解.仿真实验的结果表明,对典型火箭发射的SSO和GTO弹道,定制化内点算法的运行时间与传统算法相比分别减少了 37.41%和47.86%,大幅提升了计算效率.

Abstract

The trajectory replanning problem of rocket launchers is one of the crucial issues in aer-ospace engineering.Currently,the existing trajectory replanning methods have not deeply explored the special structure of specific multi-stage trajectory optimization models,and the com-putational efficiency can be further improved.This paper establishes a multi-stage trajectory re-planning problem model,analyzes the structural characteristics of the model,and finally develops an effective customized interior point algorithm by using successive convex approximation technol-ogy to achieve a high-precision and high-robustness online solution for trajectory replanning prob-lems.The numerical simulation results show that,for typical SSO and GTO rocket orbits,the running time of the customized interior point algorithm is reduced by 37.41%and 47.86%respec-tively compared to traditional algorithms.The superior performance of the customized algorithm implies that it can meet the practical engineering demand of online trajectory replanning.

关键词

弹道重规划/连续凸近似/定制化内点算法

Key words

Rajectory replanning/Successive convex approximation/Customized interior point method

引用本文复制引用

出版年

2024
宇航总体技术

宇航总体技术

CSTPCD
ISSN:
段落导航相关论文