The invention provides a rocket soft landing trajectory planning method based on convex optimization, and belongs to the technical field of carrier rocket control. The method comprises the following steps: building a rocket power soft landing section motion equation and a rocket power soft landing section state constraint equation meeting the convex optimization according to a rocket soft landingprocess, and obtaining an objective function of a rocket power soft landing section; establishing a rocket power soft landing section online trajectory sequence convex optimization equation accordingto the rocket power soft landing section motion equation, the rocket power soft landing section state constraint equation and the rocket power soft landing section target function; and planning an ideal track with the maximum feasible region of the soft landing section in an online rolling manner. According to the rocket soft landing trajectory planning method based on convex optimization providedby the invention, the anti-interference capability of the reusable rocket after entering the power soft landing section is improved, and the method is suitable for solving the trajectory planning problem of complex constraints on line.
本发明提供了一种基于凸优化的火箭软着陆轨迹规划方法,属于运载火箭控制技术领域,包括以下步骤:根据火箭软着陆过程建立满足凸优化的火箭动力软着陆段运动方程、火箭动力软着陆段状态约束方程,并获取火箭动力软着陆段目标函数;根据火箭动力软着陆段运动方程、火箭动力软着陆段状态约束方程、以及火箭动力软着陆段目标函数建立火箭动力软着陆段在线轨迹序列凸优化方程;在线滚动规划软着陆段可行域最大的理想轨迹。本发明提供的一种基于凸优化的火箭软着陆轨迹规划方法,提升可重复使用火箭进入动力软着陆段后的抗干扰能力,并且适于在线求解复杂约束的轨迹规划问题。
Rocket soft landing trajectory planning method based on convex optimization
一种基于凸优化的火箭软着陆轨迹规划方法
2021-03-26
Patent
Electronic Resource
Chinese
IPC: | B64G Raumfahrt , COSMONAUTICS |
An Iterative Convex Programming Method for Rocket Landing Trajectory Optimization
Springer Verlag | 2020
|Trajectory Optimization for Reusable Rocket Landing
IEEE | 2018
|