航空学报 > 2021, Vol. 42 Issue (11): 524834-524834   doi: 10.7527/S1000-6893.2021.24834

扰动环境下火星精确着陆自主轨迹规划方法

邓云山1,2, 夏元清1,2, 孙中奇1,2, 沈刚辉1,2   

  1. 1. 北京理工大学 自动化学院, 北京 100081;
    2. 复杂系统智能控制与决策国家重点实验室, 北京 100081
  • 收稿日期:2020-10-02 修回日期:2020-11-30 发布日期:2021-02-24
  • 通讯作者: 夏元清 E-mail:xia_yuanqing@bit.edu.cn
  • 基金资助:
    国家自然科学基金(61836001,61803033)

Autonomous trajectory planning method for Mars precise landing in disturbed environment

DENG Yunshan1,2, XIA Yuanqing1,2, SUN Zhongqi1,2, SHEN Ganghui1,2   

  1. 1. School of Automation, Beijing Institute of Technology, Beijing 100081, China;
    2. State Key Laboratory of Intelligent Control and Decision of Complex Systems, Beijing 100081, China
  • Received:2020-10-02 Revised:2020-11-30 Published:2021-02-24
  • Supported by:
    National Natural Science Foundation of China (61836001, 61803033)

摘要: 针对扰动环境下火星精确着陆动力下降段自主轨迹规划问题,在终端时间自由条件下,研究了基于序列凸优化方法的自主轨迹规划方法。首先,在终端自由情况下,建立初始状态无扰动轨迹预规划问题。其次,结合鲁棒Tube-MPC思想,针对线性反馈控制律,建立扰动环境下着陆轨迹重规划问题,分析重规划问题的可行性,给出了预规划问题可行的必要性条件,为控制参数的选取提供参考,提出扰动环境下火星精确着陆自主轨迹规划框架。然后,针对终端自由问题,将飞行时域映射到单位时间,建立序列凸优化子问题,对子问题进行线性近似,使用序列凸优化方法进行求解并分析了收敛解的最优性。最后,进行数值仿真,验证扰动环境下火星精确着陆自主轨迹规划方法的有效性。

关键词: 轨迹规划, 火星着陆, 动力下降段, 序列凸优化, 扰动环境, 终端时间自由

Abstract: An autonomous trajectory planning method of Mars landing powered-descent in the disturbed environment is proposed based on the sequential convex programming method with the consideration of free terminal time. Firstly, considering the free terminal time, a trajectory planning problem without disturbance is established. Secondly, based on the robust Tube-MPC and the linear feedback control law, we establish a series of replanning problems of landing trajectory under the disturbed environment. The feasibility of the replanning problems is analyzed, and the necessary conditions for the feasibility of the preplanning problem are given to provide a reference for selection of control parameters. The autonomous trajectory planning framework for Mars precise landing under the disturbed environment is then proposed. Thirdly, considering the free terminal time, the flight time domain is mapped to the unit time, and a sub-problem of sequence optimization is established. The sub-problem is linearly approximated, and the sequential convex programming is employed to solve it. It is proved that the convergent solution of the approximation problem is a KKT solution of the original problem. Finally, numerical simulation is carried out to verify the effectiveness of the method.

Key words: trajectory planning, landing on Mars, powered-descent, sequence convex programming, disturbed environment, free terminal time

中图分类号: