Aiming at the trajectory optimization problem of the rocket vertical recovery landing phase, this paper proposes a sequential convex optimization trajectory optimization method based on the pseudospectral method for planning the nominal trajectory. Firstly, considering the multi-constraint conditions of the rocket landing phase, a dynamic model for the vertical landing of the rocket is established. The optimization problem takes less fuel consumption as the performance index. The nominal trajectory planning is accomplished using the pseudospectral method. Then, considering the non-convexity of the state equation and multi-constraint conditions, the problem is transformed into a second-order cone programming (SOCP) problem by using lossless convexification, linearization and discretization methods. Finally, the optimization problem is solved by sequential iteration of the interior point method. The simulation experiments show that this sequential convex optimization method can obtain the optimal solution after a few iterations. This method for solving the optimal trajectory is efficient and accurate.
Research on Trajectory Optimization Method of Rocket Vertical Recovery Landing Phase
Lect. Notes Electrical Eng.
International Conference on Autonomous Unmanned Systems ; 2023 ; Nanjing, China September 09, 2023 - September 11, 2023
Proceedings of 3rd 2023 International Conference on Autonomous Unmanned Systems (3rd ICAUS 2023) ; Chapter : 42 ; 441-450
2024-04-27
10 pages
Article/Chapter (Book)
Electronic Resource
English
Correction to: Research on Trajectory Optimization Method of Rocket Vertical Recovery Landing Phase
Springer Verlag | 2024
|Trajectory Optimization for Reusable Rocket Landing
IEEE | 2018
|Rocket soft landing trajectory planning method based on convex optimization
European Patent Office | 2021
|An Iterative Convex Programming Method for Rocket Landing Trajectory Optimization
Springer Verlag | 2020
|Aerodynamics of Vertical Landing Rocket Vehicle in Landing Phase (AAS 03-438)
British Library Conference Proceedings | 2004
|