首页 | 官方网站   微博 | 高级检索  
     

双脉冲卫星交汇算法研究
引用本文:王于,戴光明,李艳. 双脉冲卫星交汇算法研究[J]. 电脑编程技巧与维护, 2009, 0(6): 44-44
作者姓名:王于  戴光明  李艳
作者单位:中国地质大学,武汉,武汉,430074;中国地质大学,武汉,武汉,430074;中国地质大学,武汉,武汉,430074
摘    要:针对双脉冲卫星交汇问题,首先建立了双脉冲交汇模型,提出优化的目标函数,然后分别采用二种算法,比较了确定性方法和非确定性方法的优劣,得出结论:演化算法容易实现,结果比较精确,但是效率太低,运算开销大,适用于解决一些复杂的大型运算;SQP方法结果精确,效率较高,但是却有初始点敏感问题,可能陷入局部最优,适用于解决一些小型计算问题。

关 键 词:卫星交汇  Hill方程  演化算法  非线性约束  SQP算法  QP算法

Reaserch of The Algorithms about Two Impulses Satelite Rendezvous
WANG Yu,DAI Guangming,LI Yan. Reaserch of The Algorithms about Two Impulses Satelite Rendezvous[J]. Computer Programming Skills & Maintenance, 2009, 0(6): 44-44
Authors:WANG Yu  DAI Guangming  LI Yan
Affiliation:China University of Geosciences;Wuhan 430074
Abstract: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 certain precision, but 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...
Keywords:Satellite rendezvous  Hill equation  GA  Non-linearity restraint  SQP method  QP method  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号