基于贪婪算法的近空间平台区域覆盖优化设计

为了实现近空间多平台对任意区域的协同覆盖观测,提出了一种近空间区域性覆盖优化设计方法.该方法针对问题建立了NP-hard集合覆盖模型,应用随机贪婪算法设计并优化平台的位置参数以及采用的波位.随机贪婪方法从贪婪算法得到的一个解出发,随机移除一定比例的平台,再用贪婪策略加入若干个平台,改进了原始贪婪算法对优解空间搜索不足的缺点,因此提高了解的优度,同时也避免了应用遗传算法、蚁群算法等智能搜索算法在解决此类问题时对全部子集族庞大的存储和复杂的计算.利用STK(Satellite Tool Kit)卫星仿真软件对四川汶川地区的优化设计结果进行了仿真,仿真结果给出了在100%覆盖的情况下平台的各参数信息,验证了该优化设计方法的有效性和智能性,为近空间区域覆盖设计提供了有力参考.

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

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 ra...