Reduced Space Sequential Convex Programming for Rapid Trajectory Optimization

被引:6
作者
Ma, Yangyang [1 ]
Pan, Binfeng [1 ]
Tang, Jingyuan [2 ]
机构
[1] Northwestern Polytech Univ, Sch Astronaut, Xian 710072, Peoples R China
[2] Beijing Electromech Engn Inst, Beijing 100074, Peoples R China
关键词
Optimization; Convex functions; Aerodynamics; Iterative methods; Space vehicles; Programming; Convergence; Implicit function; iterative methods; reduced space framework; sequential convex programming (SCP); trajectory optimization;
D O I
10.1109/TAES.2024.3437330
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
Convex optimization is of great interest as an efficient and reliable solver in the field of aerospace engineering. Existing research often focuses on developing proper convexification techniques to handle aerospace problems within the convex optimization framework, with limited attention to further efficiency enhancements in convex optimization solving, such as by reducing the optimization problem size. Motivated by the real-time requirements of onboard aerospac applications, this article presents a unified framework for reduced space sequential convex programming formulations, emphasizing a significant reduction of optimization variables and constraints. The primary idea is to employ an iterative scheme to explicitly approximate the dynamic implicit function and subsequently eliminate the explicitly defined state variables and dynamic equality constraints, thereby constructing a sequence of reduced space optimization subproblems to be solved iteratively. Within the proposed framework, a family of reduced space sequential convex programming methods with different performance-complexity tradeoffs is developed by virtue of the fixed-point iteration, Newton iteration, damped Newton iteration, and simplified Newton iteration. Numerical simulations for a minimum-fuel rocket landing problem inside atmosphere are conducted to demonstrate the performance of the developed methods.
引用
收藏
页码:9060 / 9072
页数:13
相关论文
共 44 条
[1]   Convex programming approach to powered descent guidance for Mars landing [J].
Acikmese, Behcet ;
Ploen, Scott R. .
JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 2007, 30 (05) :1353-1366
[2]   On implementing a primal-dual interior-point method for conic quadratic optimization [J].
Andersen, ED ;
Roos, C ;
Terlaky, T .
MATHEMATICAL PROGRAMMING, 2003, 95 (02) :249-277
[3]  
Bai X., 2010, Modified Chebyshev-Picard iteration methods for solution of initial value and boundary value problems
[4]   Convex Approach to Three-Dimensional Launch Vehicle Ascent Trajectory Optimization [J].
Benedikter, Boris ;
Zavoli, Alessandro ;
Colasurdo, Guido ;
Pizzurro, Simone ;
Cavallini, Enrico .
JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 2021, 44 (06) :1116-1131
[5]   State-dependent trust region for successive convex programming for autonomous spacecraft [J].
Bernardini, Nicolo ;
Baresi, Nicola ;
Armellin, Roberto .
ASTRODYNAMICS, 2024, 8 (04) :553-575
[6]   Survey of numerical methods for trajectory optimization [J].
Betts, JT .
JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 1998, 21 (02) :193-207
[7]   Parallel Lagrange-Newton-Krylov-Schur methods for PDE-constrained optimization. Part I: The Krylov-Schur solver [J].
Biros, G ;
Ghattas, O .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2005, 27 (02) :687-713
[8]   Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations [J].
Bongartz, Dominik ;
Mitsos, Alexander .
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 69 (04) :761-796
[9]  
Deuflhard P., 2005, Newton Methods for Nonlinear Problems
[10]   Global optimal control with the direct multiple shooting method [J].
Diedam, H. ;
Sager, S. .
OPTIMAL CONTROL APPLICATIONS & METHODS, 2018, 39 (02) :449-470