.png){kind=icon}
返回
hp-Adaptive RPD based sequential convex programming for reentry trajectory optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ast.2022.107887.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sequential convex programming (SCP) methods have been developed to solve reentry trajectory optimization problems. Due to the oversimplified discretization and iteration, the accuracy and efficiency of the existing SCP methods can be further improved. In this paper, a SCP algorithm based on the hpadaptive Radau pseudospectral discretization (RPD) is proposed. In the proposed algorithm, the iteration process is divided into three stages depending on the characteristics of subproblems. The constraint relaxation technique is applied in the first stage to ensure that the iteration is stable. During the second stage, the number and position of discretized points will be updated adaptively according to the discretization error and the curvature of state. In the last stage, the linearization error is reduced by several iterations without updating mesh, and the regularization technique is utilized to improve the convergence rate of this process. The proposed algorithm is validated and examined by a typical reentry example. With comparable or even higher results accuracy, the CPU time reduced by 40%-70% when compared to other SCP methods, and is only twentieth of that of GPOPS-II. (c) 2022 Elsevier Masson SAS. All rights reserved.
Keyword:
Reentry
Trajectory optimization
Sequential convex programming
hp -adaptive
Radau pseudospectral
期刊
IF:
5.8
论文数:
1.0W
被引数:
3.0W
机构
引用论文
Improved sequential convex programming using modified Chebyshev-Picard iteration for ascent trajectory optimization改进的chebyshev-picard迭代序列凸规划在上升轨迹优化中的应用
PREAI
分享收藏
Lossless convexification of a class of optimal control problems with non-convex control constraints一类具有非凸控制约束的最优控制问题的无损凸化.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏分享收藏
查看更多内容