高级检索

基于序列凸优化的火星上升器机会约束轨迹优化

Chance-Constrained Trajectory Optimization for Mars Ascent Vehicle Based on Sequential Convex Optimization

  • 摘要: 火星上升器承担着将火星样品送入空间轨道的任务,其轨迹优化是火星采样返回任务中的关键一环。火星上升任务情境复杂,并且受到各类不确定性的影响。然而传统的轨迹优化大多基于标称模型,对不确定性的应对能力有限。将火星上升器面临的初始位置和推力幅值不确定性描述为机会约束,建立考虑不确定性的机会约束轨迹优化问题,并使用序列凸优化方法迭代求解最优轨迹。数值仿真结果证明了所提出方法的有效性,同时对比表明本文方法的性能指标更优,且比传统鲁棒优化的保守性更低。另外,对机会约束的风险管理作用和概率近似函数的保守性进行了对比分析。

     

    Abstract: The Mars ascent vehicle is tasked with sending Martian samples into space orbit, and its trajectory optimization is a crucial part of the Mars sample return mission. The scenario of the Mars ascent mission is complex and subject to various uncertainties. However, traditional trajectory optimizations are mostly based on nominal models, with limited ability to address uncertainties. In this thesis, the uncertainties in the initial position and thrust amplitude were described as chance constraints, so a chance-constrained trajectory optimization problem was established. Then the optimal trajectory was iteratively solved using sequential convex optimization method. Numerical simulation results verified the effectiveness of the proposed method. Comparisons also demonstrated that this method achieved better performance indicators and exhibited less conservatism than traditional robust optimization. In addition, a comparative analysis of the risk management effect of chance constraints and the conservatism of probability approximation functions was conducted.

     

/

返回文章
返回