基于改进的NSGA-Ⅱ算法的区域覆盖卫星星座优化  

OPTIMIZATION OF REGIONAL COVERAGE SATELLITE CONSTELLAION BY IMPROVED NSGA-Ⅱ ALGORITHM

作　　者：阎志伟[1] 田菁[2] 李汉铃[1] 

机构地区：[1]哈尔滨工业大学管理学院,哈尔滨150001 [2]国防科技大学机电工程与自动化学院,长沙410073

出　　处：《空间科学学报》2004年第1期43-50,共8页Chinese Journal of Space Science

基　　金：国防预研项目资助

摘　　要：对基于Pareto最优概念的非劣性分层遗传算法(NSGA-Ⅱ)进行了改进,与区域覆盖卫星星座的多目标优化设计相结合,提出基于改进的NSGA-Ⅱ算法的区域覆盖卫星星座优化设计方法,并利用多属性决策中的字典序法,根据目标的重要程度,在得到的Pareto解中进行选择.最后,利用STK和Mat1ab工具对遥感卫星星座进行了仿真,仿真结果表明该算法可以找到多个Pareto解,避免了传统的多目标优化求解方法的权值选择问题,并且比简单遗传算法具有更好的灵活性,从而解决了多目标优化的星座设计问题.This paper presents a new method to design regional coverage satellite constellation, the non-dominated sorting genetic algorithm Ⅱ (NSGA-Ⅱ) based on Pareto optimal is improved and applied it to the optimization of regional coverage satellite constellation. The best solution,depending on the importance of different objects, is selected by a kind of multi attributes decision making method. Simulations on remote sensing satellite constellation are presented. The results of the simulation realized by STK and Matlab show that the algorithm can get a group of Pareto solutions. The algorithm presented in this paper can avoid selecting weights of multiple objects. On the other hand, compared with the simple genetic algorithm, our algorithm is more active. Thus the question of optimization of satellite constellation with multiple objectives can be solved.

关 键 词：NSGA-Ⅱ算法 卫星星座 区域覆盖 优化设计 非劣性分层遗传算法 

分 类 号：V448[航空宇航科学与技术—飞行器设计]