双脉冲卫星交汇算法研究

Reaserch of The Algorithms about Two Impulses Satelite Rendezvous

针对双脉冲卫星交汇问题,首先建立了双脉冲交汇模型,提出优化的目标函数,然后分别采用二种算法,比较了确定性方法和非确定性方法的优劣,得出结论:演化算法容易实现,结果比较精确,但是效率太低,运算开销大,适用于解决一些复杂的大型运算;SQP方法结果精确,效率较高,但是却有初始点敏感问题,可能陷入局部最优,适用于解决一些小型计算问题。

In this paper, there are three ways to solute Two Impulses Satelite Rendezvous problem, and having a conclusion by comparing these algorithms. All the works shows that first, GA is a algorithm which is easy to be realized, the result have a certa/n precision, hut the efficiency is low, and the cost is high, it is propitious to solve the problem which is complex; Second, SQP is mathematic ways, the result is more accurate than GA, and the efficiency is high, but the initial point is very sensitive and brings on a new problem that local optimization, it is propitious to solve the problem which is ordinary.