面向区域目标的遥感卫星任务规划算法

面向区域目标的遥感任务规划问题主要解决如何在多遥感卫星条件下,对区域目标进行合理的任务分解和分配。提出了一种动态划分方法,通过加入卫星观测范围因素,改进了现有的静态划分方法。该方法划分生成的候选条带数量大大增加,使算法求解难度增大。基于邻域搜索思想,综合贪婪规则、随机模式和变邻域等因素提出了快速求解区域目标任务规划问题的贪婪随机变邻域搜索算法。最后通过实例进行了验证,结果证明应用该算法能较快得到比较好的解。

An Algorithm to Mission Planning Problem of Polygon Target Remote Sensing

The mission planning problem for polygon target involves the partition of polygon target and the assignment of imaging activities for different remote sensing satellites. A dynamic partition method which takes into account the coverage of satellite is proposed to improve on the present partition method. As the result, the candidate strips increases so enomlously that the mission planning problem is difficult to solve. Based on the local search method, GRVNS algorithm, integrating the greed rules, random mode, and variable neighborhood, is proposed to solve the mission planning problem for polygon target. Experiments results show that the effectiveness of our approach.