Optimization of Regional Navigation Satellite Constellation by Improved NSGA-II Algorithm
In this paper, the non-dominated sorting genetic algorithm II (NSGA-II) based on the concept of Pareto optimal is improved. A new algorithm with lower O (MNlogN) computational complexity to construct nondominated set replaces the NSGA-II original fast nondominated sorting algorithm with O(MN2) computational complexity. The new algorithm improves operating efficiency of NSGA-II significantly. Based on the combination of the improved NSGA-II algorithm and regional navigation satellite constellation design, a new idea to design regional navigation satellite constellation is proposed in this paper. The new idea is implemented by Satellite Tool Kits (STK) and Matlab: the improved NSGA-II algorithm is implemented by Matlab and the calculation of the objective function values is implemented by STK. STK/Connect interface is used to integrate STK and Matlab into one simulation. Simulation results show that new idea has some advantages over the traditional methods, being more efficient, more flexible and more comprehensive.
Chang Hui Hu Xiulin Zhang Yunyu Zeng Yujiang Wang Ying
Electronics and Information Department, Huazhong University of Science and Technology, Wuhan 430074, China
国际会议
International Conference on Space Information Technology 2009(2009年第三届空间信息技术国际会议)
北京
英文
1-10
2009-11-26（万方平台首次上网日期，不代表论文的发表时间）