基于人工蜂群算法的固定时间多脉冲交会

Optimal Multiple Impulse Orbital Rendezvous Using Artificial Bee Colony

  • 摘要: 在两航天器交会问题中,采用多脉冲变轨策略往往能取得更小的燃料消耗.利用人工蜂群算法优化了航天器固定时间多脉冲交会问题,提出一种改进的人工蜂群算法.该方法能够简化时间约束的处理,能获得满足地球半径约束的解.该方法易于编程,鲁棒性强,可以应用到不同的摄动模型.仿真结果表明,该算法不易陷入局部最优,相比于粒子群算法和传统人工蜂群算法具有更高的求解精度.

     

    Abstract: In the problem of two spacecraft rendezvous, the multi impulse strategy can often achieve less fuel consumption. In this paper, the artificial bee colony algorithm is used to optimize the fixed time multi impulse rendezvous of spacecraft, and an improved artificial bee colony algorithm is proposed. This method can simplify the processing of time constraints and obtain solutions that meet the constraints of earth radius. This method is easy to program and robust, and can be applied to different perturbation models. Simulation results show that the algorithm is not easy to fall into local optima, and has higher accuracy than particle swarm optimization algorithm and traditional artificial bee colony algorithm.

     

/

返回文章
返回