系统工程与电子技术

• 制导、导航与控制 • 上一篇    下一篇

基于hp自适应伪谱法的N脉冲轨道优化设计

韩威华1,2,3, 杨新1, 姜萌哲3   

  1. 1.中国科学院光电研究院, 北京 100094; 2.中国科学院大学, 北京 100049; 
     3.北京航天飞行控制中心, 北京 100094
  • 出版日期:2013-12-24 发布日期:2010-01-03

Optimal design of N-impulse trajectories based on hp-adaptive pseudospectral method

HAN Wei-hua1,2,3,YANG Xin1,JIANG Meng-zhe3   

  1. 1. Academy of OptoElectronics, Chinese Academy of Sciences, Beijing 100094, China;
    2. University of Chinese Academy of Sciences, Beijing 100049, China;
    3. Beijing Aerospace Flight Control Center, Beijing 100094, China
  • Online:2013-12-24 Published:2010-01-03

摘要:

在实效性要求高的空间操控任务中,脉冲轨道的优化设计必不可少。针对脉冲轨道转移和交会的优化设计问题,基于hp自适应伪谱法设计一种通用方法,以直接法计算为主,综合使用间接法主矢量理论交互式规划出最优N脉冲轨道的机动方案。该方法以hp自适应伪谱法直接求解首末端双脉冲机动,依据间接法最优脉冲机动满足的主矢量必要条件进行检验,通过增加脉冲或者首末端漂移进行交互式规划,逐步确定出最优脉冲数目N的值,再采用hp自适应伪谱法求解出各脉冲速度增量的矢量与施加时刻,获得脉冲轨道的优化设计。提供2个仿真场景算例,求解过程和结果表明,该方法对初值敏感度小、鲁棒性强、收敛快、实用有效,可以便捷处理脉冲轨道的优化设计问题。

Abstract:

The optimal design of impulse trajectories is essential in space-assembly and space-succor. A novel algorithm for solving general minimum-fuel N-impulsive orbit maneuver,e.g.orbit transfer and rendezvous, is proposed. The developed algorithm combines a primer vector obtained through the use of a Yamanaka-Ankersen state transition matrix and an interactive optimization approach based on an hp-adaptive pseudospctral method to calculate the N-impulse velocities directly. The approach starts from twoimpulse  calculated by the hp-adaptive pseudospctral method at initial and terminal points,and is checked by satisfying the necessary conditions for the primer vector. By the reference of the obtained primer vector magnitude information, adding initial coast, final coast or a new midimpulse is tried. Provided the number of multiple-impulse N is fixed, its numerical result of the N-impulse velocities and the time can be calculated by the hp-adaptive pseudospctral method. Through the interactive procedure, the optimal N-impulsive orbit maneuvers are designed. The simulation and outcomes demonstrate that the algorithm is fairly robust, quickly converged and able to deal with the optimal design of N-impulse trajectories efficiently and practically.