中国空间科学技术

• • 上一篇    下一篇

多冲量近程交会最优化模型

涂良辉;袁建平;罗建军;方群;   

  1. 西北工业大学航天学院;中航工业洪都飞机设计研究所;
  • 发布日期:2010-04-25

Optimal Multi-impulse Close-range Rendezvous

Tu Lianghui1,2 Yuan Jianping1 Luo Jianjun1 Fang Qun1(1 College of Astronautics,Northwestern Polytechnical University,Xi'an 710072)(2 Hongdu Aircraft Design & Research Institude,Aviation Industry Corporation,Nanchang 330024)   

  • Online:2010-04-25

摘要: 文章基于Lawden方程对椭圆参考轨道的近程最优交会问题进行了研究,并提出了一种混合遗传算法求解最优近程交会问题。首先在一定假设条件下给出了目标在椭圆参考轨道的近距离相对运动模型——Lawden方程,构建了多脉冲最优交会问题模型并进行了理论分析。性能指标选为轨道交会过程中燃料消耗和时间消耗加权最小的多目标优化指标,优化参数为脉冲大小和脉冲施加时刻,终端状态受到相对位置和相对速度的约束。然后介绍了具有较强全局和局部寻优能力的混合遗传算法。最后以四脉冲为例进行仿真计算。仿真结果表明,是否考虑第一次脉冲位置,总燃料消耗变化不明显。因此,追踪航天器一旦捕获到目标信息即可施加第一次脉冲。仿真结果还证明了混合遗传算法在求解最优交会问题时的有效性。因此,混合遗传算法对基于Lawden方程的椭圆参考轨道近程最优交会问题的求解可行。

关键词: 近程交会, 多目标优化, Lawden方程, 混合遗传算法, 航天器

Abstract: The application of hybrid genetic algorithm to space vehicle close-range orbital rendezvous optimization problem was studied based on Lawden's equations,while target vehicle was on an arbitrary elliptical orbit.Firstly,the Lawden's motion model of close-range orbital rendezvous was established,which was simplified based on some reasonable hypotheses.Then,theory of multi-impulse rendezvous was developed and optimal multi-impulse rendezvous control problem was established.The multi-ocjective optimization performance was selected to minimize the total fuel consumqtion and total time.The optimal variables included magnitude of impulse components and imposed time of impulse.Terminal state variable constraints included relative position and velocity constraints.Finally,hybrid genetic algorithm was put forward which has high convergence both in global and local optimization problem,and optimization problem was solved using hybrid genetic algorithm,no matter whether the influence of the first impulse's position was taken into consideration.A numerical example was presented to demonstrate the effectiveness of hybrid genetic algorithm.Simulation results show that the total fuel consumption in both conditions is nearly the same.