Optimization of near-space aerocraft track for regional coverage based on greedy algorithm

[1] Allen H E. The case for near space[J]. Aerospace America,2006, 2, 31-34 [2] Galletti M, Krieger G, Brner T, et al. Concept design of a near space radar for tsunami detection IEEE International Geoscience and Remote Sensing Symposium. Barcelona: IGARSS, 2007:34-37 [3] 冯富宝.集合覆盖问题研究 . 山东:山东大学计算机学院,2006 Feng Fubao. Research on set covering problem . Shandong: School of Computer Science and Technology, Shandong University, 2006(in Chinese) [4] Song S M, Lei Chi Meng ,Wang Jiang. The end-effector angle and manipulator dexterous workspace[J]. ASME Journal of Mechanical Design, 1990, 112(3):278-282 [5] 陈端兵,黄文奇.一种求解集合覆盖问题的启发式算法[J]. 计算机科学,2007, 34(4):133-135 Chen Duanbing, Huang Wenqi. A heuristic algorithm for set covering problem[J]. Computer Science, 2007, 34(4):133-135(in Chinese) [6] Zhang Pei,Wang Ronglong,Wu Chongguang, et al. An effective algorithm for the minimum set cover problem Proceedings of the Fifth International Conference on Machine Learning and Cybernetics. Dalian: IEEE, 2006:3032-3035 [7] 王瑞,马兴瑞,李明.采用遗传算法进行区域卫星星座优化设计[J]. 宇航学报,2002, 23(3):24-28 Wang Rui, Ma Xingrui, Li Ming. Opertimizaition of regional coverage satellite constellations by genetic algorithm[J]. Journal of Astronautics, 2002, 23(3): 24-28(in Chinese) [8] Xie Kai, Yang Zhengbin, Huang Zhitao, et al. LEO space-based radar constellation design using a genetic algorithm International Conference on Radar. Changsha: IEEE, 2006:1-4