Optimization of near-space aerocraft track for regional coverage based on greedy algorithm
-
摘要: 为了实现近空间多平台对任意区域的协同覆盖观测,提出了一种近空间区域性覆盖优化设计方法.该方法针对问题建立了NP-hard集合覆盖模型,应用随机贪婪算法设计并优化平台的位置参数以及采用的波位.随机贪婪方法从贪婪算法得到的一个解出发,随机移除一定比例的平台,再用贪婪策略加入若干个平台,改进了原始贪婪算法对优解空间搜索不足的缺点,因此提高了解的优度,同时也避免了应用遗传算法、蚁群算法等智能搜索算法在解决此类问题时对全部子集族庞大的存储和复杂的计算.利用STK(Satellite Tool Kit)卫星仿真软件对四川汶川地区的优化设计结果进行了仿真,仿真结果给出了在100%覆盖的情况下平台的各参数信息,验证了该优化设计方法的有效性和智能性,为近空间区域覆盖设计提供了有力参考.Abstract: In order to covering any discretionary polygonal region,a novel method was proposed based on set covering problem model, which is a NP-hard problem. Random greedy algorithm strategy was applied in the method to achieve 100% regional coverage with minimum aerocrafts by designing and optimizing each aerocraft-s track and beam position. Random greedy algorithm removed some aerocrafts from the solution of greedy algorithm randomly and added some new ones based on greedy strategy again. The method extended search range for more possible optimized solutions compared with traditional greedy algorithm. Simulation result on Wenchuan area shows good effectiveness and intelligence of the method. Reliable reference can be supplied for near-space regional coverage planning.
-
Key words:
- synthetic aperture radar /
- set theory /
- greedy algorithm
-
[1] Allen H E. The case for near space[J]. Aerospace America,2006, 2, 31-34 [2] Galletti M, Krieger G, Brner 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 -
点击查看大图
计量
- 文章访问数: 4283
- HTML全文浏览量: 144
- PDF下载量: 1630
- 被引次数: 0
下载:
