北京航空航天大学学报 ›› 2009, Vol. 35 ›› Issue (11): 1398-1402.

• 论文 • 上一篇    下一篇

广义多圈Lambert算法求解多脉冲最优交会问题

童科伟1, 周建平1, 何麟书1, 张丽艳2   

  1. 1. 北京航空航天大学 宇航学院, 北京 100191;
    2. 中国载人航天工程办公室, 北京 100720
  • 收稿日期:2008-11-07 出版日期:2009-11-30 发布日期:2010-09-16
  • 作者简介:童科伟(1982-),男,湖南常德人,博士生,tongkewei@126.com.

Generalized multiple-revolution Lambert algorithm for solving multiple-impulse rendezvous problem

Tong Kewei1, Zhou Jianping1, He Linshu1, Zhang Liyan2   

  1. 1. School of Astronautics, Beijing University of Aeronautics and Astronautics, Beijing 100191, China;
    2. China Manned Space Engineering Office, Beijing 100720, China
  • Received:2008-11-07 Online:2009-11-30 Published:2010-09-16

摘要: 基于一种高效高精度的Battin多圈Lambert算法提出一种考虑轨道摄动的广义多圈Lambert算法.与现有算法相比,本算法虽然原理复杂但计算流程非常简单,效率极高,分别通过几次内外循环就可满足精度要求.广义多圈Lambert算法结合一种可行解迭代交会模型构成了一个通用的多圈多脉冲交会规划框架,应用两步法求解此多变量的复杂工程优化问题,首先利用高效率的进化全局优化算法以及解析轨道模型作全局搜索,然后利用序列二次规划算法以及简化高精度轨道计算模型作局部搜索,此方法可以保证高效高精度的求解多圈多脉冲交会问题.算例表明此方法特别适用于满足实际工程约束的交会规划问题.

Abstract: Techniques based on a high efficient high precision Battin multiple-revolution Lambert algorithm were extended to a generalized multiple-revolution Lambert algorithm which can consider orbital perturbations. The approach is difficult to understand but is high efficient with a simple calculation flow which needs only several inner and outer iterations. A unified multiple-revolution multiple-impulse rendezvous planning framework was proposed by combining the generalized multiple-revolution Lambert algorithm and a feasible iteration rendezvous approach. A two-step optimization method was used to solve this difficult multi-variable engineering optimization problem which first utilizing a high efficient evolutionary algorithm with an analytical orbit model for global search, then a sequential quadratic programming algorithm was used with a simplified high precision orbit model for local optimization. The proposed method can guarantee to solve multiple-revolution multiple-impulse rendezvous problem with high efficiency and precision. The demonstration validates that it is very suitable for rendezvous planning problem with practical engineering constraints.

中图分类号: 


版权所有 © 《北京航空航天大学学报》编辑部
通讯地址:北京市海淀区学院路37号 北京航空航天大学学报编辑部 邮编:100191 E-mail:jbuaa@buaa.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发