首页> 外文会议>AIAA SciTech forum and exposition >Real Time Powered Descent Guidance Algorithm for Mars Pinpoint Landing with Inequality Constraints
【24h】

Real Time Powered Descent Guidance Algorithm for Mars Pinpoint Landing with Inequality Constraints

机译:具有不等式约束的火星精确着陆的实时动力下降制导算法

获取原文

摘要

Real time trajectory optimization of the powered descent phase in Mars pinpoint landing is presented in this paper. The optimal soft landing trajectory in the presence of large initial condition dispersion and inequality constraints on thrust, orientation and path is generated in real time. The guidance algorithm proposed in this paper can converge from a wide range of initial conditions within the capability of the propulsion system (propellant available and thrust). A two level optimization scheme is adopted for solving the trajectory parameters and optimizing fuel consumption. In the outer loop, the required burn duration is iterated using a simple optimization procedure for minimizing fuel consumption. In the inner loop, the trajectory for a given burn time obtained from the outer loop, is solved using a modified Newton-Raphson scheme in the pseudo-spectral global collocation framework. An important advantage of this scheme is that, it does not use any general gradient-based optimization procedures which are time consuming. This makes it attractive for on-board implementation. The algorithm is least sensitive to initial guess values while exhibiting very good convergence properties. The computation cost for solving the trajectory equations is also minimal in terms of optimization time. It is tested for robustness with respect to both initial guess and initial condition dispersion in the Monte Carlo sense.
机译:本文提出了火星精确着陆中动力下降阶段的实时轨迹优化。在初始条件分散较大且推力,方向和路径存在不平等约束的情况下,实时生成最佳的软着陆轨迹。本文提出的制导算法可以在推进系统能力范围内(可使用的推进剂和推力)在很大范围的初始条件下收敛。采用二级优化方案求解轨迹参数,优化油耗。在外循环中,使用简单的优化程序来迭代所需的燃烧持续时间,以最大程度地减少燃料消耗。在内部循环中,从外部循环获得的给定燃烧时间的轨迹在伪谱全局配置框架中使用改良的Newton-Raphson方案求解。该方案的一个重要优点是,它不使用任何费时的常规基于梯度的优化过程。这使其对于板载实施具有吸引力。该算法对初始猜测值最不敏感,同时表现出非常好的收敛特性。就优化时间而言,求解轨迹方程的计算成本也最小。就蒙特卡罗意义上的初始猜测和初始条件分散而言,对它进行了鲁棒性测试。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号