Daily imaging scheduling of an Earth observation satellite
Daily imaging scheduling of an Earth observation satellite
复制标题
DOI：
10.1109/tsmca.2005.843380
复制
发表时间：
2003-11
期刊：
影响因子：
--
通讯作者：
Wei-Cheng Lin;Da-Yin Liao;Chung-Yang Liu;Yong-Yao Lee
中科院分区：
文献类型：
--
作者：
Wei-Cheng Lin;Da-Yin Liao;Chung-Yang Liu;Yong-Yao Lee
这项工作介绍了一种低轨道地球观测卫星的日常成像调度系统的开发。卫星的日常成像调度问题考虑了具有不同收益机会的各种成像请求、两个连续成像任务之间的转换工作量、云层覆盖影响以及航天器资源的可用性。它属于一类具有与顺序相关的设置、任务组合以及操作时间窗口约束等显著特征的单机调度问题。该调度问题被表述为一个整数规划问题，其计算复杂度为NP难。采用拉格朗日松弛和线性搜索技术来解决这个问题。为了证明我们的求解方法的效率和有效性，实施了一种基于禁忌搜索的算法，该算法是对Vasquez和Hao在2001年提出的算法进行修改得到的。数值结果表明，该方法对于为卫星的成像操作生成接近最优的可行调度非常有效。它在实际问题的应用中是高效的。拉格朗日松弛方法在最优性和计算时间方面都优于禁忌搜索方法。
This work presents the development of a daily imaging scheduling system for a low-orbit, Earth observation satellite. The daily imaging scheduling problem of satellite considers various imaging requests with different reward opportunities, changeover efforts between two consecutive imaging tasks, cloud-coverage effects, and the availability of the spacecraft resource. It belongs to a class of single-machine scheduling problems with salient features of sequence-dependent setup, job assembly, and the constraint of operating time windows. The scheduling problem is formulated as an integer-programming problem, which is NP-hard in computational complexity. Lagrangian relaxation and linear search techniques are adopted to solve this problem. In order to demonstrate the efficiency and effectiveness of our solution methodology, a Tabu search-based algorithm is implemented, which is modified from the algorithm in Vasquez and Hao, 2001. Numerical results indicate that the approach is very effective to generate a near-optimal, feasible schedule for the imaging operations of the satellite. It is efficient in applications to the real problems. The Lagrangian-relaxation approach is superior to the Tabu search one in both optimality and computation time.