.png){kind=icon}
返回
A three-stage sequential convex programming approach for trajectory optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ast.2024.109128.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, sequential convex programming (SCP) has become a potential approach in trajectory optimization because of its high efficiency. To improve stability and discretization accuracy, a three-stage SCP approach based on the hp-adaptive Radau pseudospectral discretization is proposed in this paper. In most instances, the initial subproblem may risk infeasibility due to the undesignated initial guess. Therefore, we design a constraint relaxation stage for the SCP to enhance the feasibility of the subproblem as much as possible. Once the subproblem can be directly solved, the iteration enters the second stage, during which a mesh refinement algorithm based on discretization error analysis is utilized to decrease the discretization error to the tolerance. In the final stage, the damping term is introduced into the objective of the subproblem to suppress the oscillation of the solution and accelerate the convergence. A dual-channel control reentry trajectory optimization and an ascent trajectory optimization are taken as examples, and the simulation results show that the proposed approach outperforms conventional SCP approaches in terms of accuracy and efficiency.
Keyword:
Trajectory optimization
Sequential convex programming
Radau pseudospectral
Mesh refinement
hp-adaptive
期刊
IF:
5.8
论文数:
1.0W
被引数:
3.0W
机构
引用论文
.png){kind=icon}
Improved sequential convex programming using modified Chebyshev-Picard iteration for ascent trajectory optimization改进的chebyshev-picard迭代序列凸规划在上升轨迹优化中的应用
PREAI
分享收藏
分享收藏分享收藏The revised UCLA Loneliness Scale: Concurrent and discriminant validity evidence.修订后的加州大学洛杉矶分校孤独量表: 并发和判别效度证据。
PREAI
分享收藏hp-Adaptive RPD based sequential convex programming for reentry trajectory optimization基于hp自适应RPD的序列凸规划在再入轨迹优化中的应用
PREAI
分享收藏
查看更多内容