Sequential convex programming without penalty function for reentry trajectory optimization problem
Authors:
- Cheng-Long DongCDCheng-Long Dong
- Lei XieLXLei Xie
- Rui-Zhi HeRHRui-Zhi He
- Hong-Bo ZhangHZHong-Bo Zhang
- 19 September 2024
- journal article
- research article
- Published by Elsevier in Acta Astronautica
- Vol. 225, 402-416
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (92371203)
This publication has 28 references indexed in Scilit:
- Hybrid-order soft trust region-based sequential convex programming for reentry trajectory optimizationAdvances In Space Research, 2023
- Distributed safe trajectory optimization for large-scale spacecraft formation reconfigurationActa Astronautica, 2023
- Mixed-integer trajectory optimization with no-fly zone constraints for a hypersonic vehicleActa Astronautica, 2023
- Obstacle avoidance guidance for planetary landing using convex trajectory and adaptive curvature regulationActa Astronautica, 2022
- Rocket landing guidance using convex optimization and proportional navigation considering performance-limited engineActa Astronautica, 2022
- Survey of convex optimization for aerospace applicationsAstrodynamics, 2017
- Reentry trajectory optimization with waypoint and no-fly zone constraints using multiphase convex programmingActa Astronautica, 2017
- Rapid Smooth Entry Trajectory Planning for High Lift/Drag Hypersonic Glide VehiclesJournal of Optimization Theory and Applications, 2015
- Rapid generation of entry trajectories with waypoint and no-fly zone constraintsActa Astronautica, 2012
- Nonlinear programming without a penalty functionMathematical Programming, 2002