星际转移发射机会搜索方法  

Launch Opportunity Search Method for Interplanetary Transfer

作　　者：徐瑞[1] 乔栋[1] 蒋惠萍[1] 

机构地区：[1]北京理工大学宇航科学技术学院,北京100081

出　　处：《北京理工大学学报》2008年第3期226-229,共4页Transactions of Beijing Institute of Technology

基　　金：国家自然科学基金资助项目(10672044)

摘　　要：针对星际探测任务发射机会搜索中,等高线图法计算量大和基于遗传算法的搜索方法难以得到精确最优解的问题,提出了一种混合搜索方法.该方法根据探测任务要求,定义待搜索目标函数,并确定搜索域;结合Lam-bert定理与Gauss算法对该问题进行降维;采用全局-局部混合搜索方法求解,解决了传统方法计算量大、计算效率低、求解最优解困难的问题.以1627 Ivar小行星的交会任务为例验证了该方法,其结果表明,采用混合搜索方法可以快速获得最优的星际转移发射机会.To search the problem of launch opportunity for interplanetary exploration, especially large-scale search of launch opportunity, a hybrid search method is presented. According to the requirements of exploration mission, it defines the target function and makes certain search domain, It reduces the search dimension, combining Lambert theory and Gauss algorithm, and solves this problem using the hybrid method. Compared with traditional method, the method proposed needs less computional time and is more efficient. Finally, taking the asteroid Ivar （numbered 1627） rendezvous mission as example, the results of methods are verified and investigated.

关 键 词：发射机会搜索 遗传算法 混合搜索 小行星交会 

分 类 号：V41[航空宇航科学与技术—航空宇航推进理论与工程]