Optimization of Regional Coverage Reconnaissance Satellite Constellation by NSGA-II Algorithm
This paper aims at the optimizing design of regional coverage reconnaissance satellite constellation.Firstly,model of regional coverage satellite constellation is set up before the design is formulated into a multiple objectives optimization problem. Secondly,a nondominated sorting genetic algorithm (NSGA)and its improved version,elitist and fast nondominated genetic algorithm (NSGA-II),are introduced.With respect to characteristic of optimization of satellite constellation,an improvement is made to NSGA-II.Combined with dictionary ordered method,improved NSGA-II is applied to solve the satellite constellation optimization.The new algorithm is implemented by STK and Visual C++.Simulation results show that the new algorithm has some advantage over the conventional genetic algorithm,being more flexible and avoiding selecting weight of multiple objectives.
Li Wang Yanjuan Wang Kewei Chen Hui Zhang
College of Electromechanical Engineering and Automation National University of Defense Technology Changsha,Hunan Province,410073,China
国际会议
2008 IEEE International Conference on Onformation and Automation(IEEE 信息与自动化国际会议)
张家界
英文
1111-1116
2008-06-20(万方平台首次上网日期,不代表论文的发表时间)