›› 2014, Vol. 34 ›› Issue (1): 26-34.doi: 10.3780/j.issn.1000-758X.2014.01.004

• 研究探讨 • 上一篇    下一篇

基于凸优化的自主交会迭代制导方法

池贤彬, 岳晓奎, 李鹏   

  1. (西北工业大学航天学院,西安 710072)
  • 收稿日期:2013-04-27 修回日期:2013-08-12 出版日期:2014-02-25 发布日期:2014-02-25
  • 作者简介:池贤彬, 1989年生,2012年毕业于西北工业大学飞行器设计与工程专业,现为西北工业大学航天工程专业硕士研究生。研究方向为航天器自主交会对接。
  • 基金资助:

    国家自然科学基金(11172235)资助项目

Iterative Guidance Method of Autonomous RendezvousBased on Convex Optimization

CHI Xian-bin, YUE Xiao-kui, LI Peng   

  1. (School of Astronautics,Northwestern Polytechnical University,Xi'an 710072)
  • Received:2013-04-27 Revised:2013-08-12 Published:2014-02-25 Online:2014-02-25

摘要: 针对目前航天器自主交会接近制导算法实时性与鲁棒性不足的问题,提出一种基于凸优化的迭代制导方法。该方法利用凸优化技术对椭圆轨道情况下有限推力的航天器相对运动动力学模型化简并进行与最优解等价的凸化处理,再运用原始对偶内点法进行求解,最后使用迭代制导策略对追踪航天器进行制导,大幅提高最优自主交会制导的实时性。针对自主交会最终逼近段的最优接近轨迹进行了数值仿真和蒙特卡洛打靶误差分析。仿真结果表明,提出的制导方法能有效进行最优接近轨迹的实时规划和制导,并且在超近距离交会接近情况下,相对位置制导误差为1μm量级,满足工程应用需求。

关键词: 有限推力, 最优轨迹, 凸优化, 迭代制导, 自主交会, 航天器

Abstract: The guidance law for autonomous rendezvous and proximity operations requires the real-time guidance capability and excellent robustness. An iterative guidance methodology based on convex optimization with a target satellite in an arbitrary orbit was presented. Firstly, by the lossless simplification and convex processing to the dynamic model of relative motion, a convex optimization problem was formed, and its solution was proven to be equivalent to that of the original autonomous rendezvous problem. Secondly, after solving the convex optimization problem by the primal-dual interior point algorithm, an iterative guidance method was used to finish the onboard planning of the chaser vehicle. Numerical experiments demonstrate the efficiency of the proposed guidance method.

Key words: Finite thrust, Optimal trajectory, Convex optimization, Iterative guidance, Autonomous rendezvous, Spacecraft