| 摘要: |
| 运载火箭弹道重规划问题是航天工程中至关重要的问题之一。目前运载火箭弹道重规划方法尚未对特定的多阶段弹道优化模型的特殊结构进行深入挖掘，计算效率有待进一步提升。通过建立多阶段弹道重规划问题模型，开展模型结构特性分析，最终在连续凸优化近似框架下构建了高效的定制化内点算法，以实现高精度、高鲁棒性的多阶段弹道重规划问题在线求解。仿真实验的结果表明，对典型火箭发射的SSO和GTO弹道，定制化内点算法的运行时间与传统算法相比分别减少了37.41%和47.86%，大幅提升了计算效率。 |
| 关键词: 弹道重规划 连续凸近似 定制化内点算法 |
| DOI： |
|
| 基金项目:国家自然科学基金(12171151)；中国科学院大学基金 |
|
| An Algorithm for Multistage Trajectory Replanning Based on Successive Convex Approximation |
| TAN Yuxiao,PENG Bo,DENG Zhibin,WANG Yu,LI Li |
| (University of Chinese Academy of Science，Beijing 100190，China;Beijing Institute of Astronautical Systems Engineering, Beijing 100076, China;1. University of Chinese Academy of Science，Beijing 100190，China;2. MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation at UCAS，Beijing 100190，China) |
| Abstract: |
| The trajectory replanning problem of rocket launchers is one of the crucial issues in aerospace engineering. Currently, the existing trajectory replanning methods have not deeply explored the special structure of specific multi-stage trajectory optimization models, and the computational efficiency can be further improved. This paper establishes a multi-stage trajectory replanning problem model, analyzes the structural characteristics of the model, and finally develops an effective customized interior point algorithm by using successive convex approximation technology to achieve a high-precision and high-robustness online solution for trajectory replanning problems. 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% respectively 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 |