摘要
对地观测卫星任务规划需要对参与规划的任务安排卫星成像窗口,问题优化目标是在不违反约束的情况下,最大化安排任务的重要性评价值,是一类典型的过载规划问题。引入迭代修复算法思想对多类型卫星任务规划问题进行求解,设计了迭代修复算法流程,给出基于成像概率、基于时间序和基于随机选择的三种不同的启发式策略,并结合不同的贪婪初始解生成策略进行比较研究。实验结果表明,基于随机选择的启发式策略在改进问题解上表现最优,而结合领域知识的初始解能有效提高算法收敛速度。
Earth Observing Satellites imaging scheduling problem needs to assign time slot of the participated satellites to the tasks, the object of which is to maximize the total evaluation of the assigned tasks without constraint violation, thus is an oversub- scribed scheduling problem. As iterative repair method is successfully used in the oversubscribed scheduling problem, we propose an iterative repair based heuristic method to solve it. We redesign the task selection and re - arranging procedure, and try some heuristic methods to test the performance, combined with different greedy initializing methods. These heuristic methods include time-sequence based search, photo-probability based search and stochastic search. Finally, we compare these approaches on two types of data-sets. The result shows that, stochastic search performs best, while good heuristic initialize method can make the con- vergence speed rapider.
出处
《宇航学报》
EI
CAS
CSCD
北大核心
2009年第3期1255-1260,共6页
Journal of Astronautics
基金
国家自然科学基金(60604035)
国家863高技术研究发展计划(2007AA12Z229)
关键词
对地观测卫星
任务规划
启发式搜索
迭代修复
Earth observing satellite
Imaging scheduling
Heuristic search
Iterative repair
