.png){kind=icon}
返回
Multi satellites scheduling algorithm based on task merging mechanism
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.12.109.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Earth observation satellites are platforms equipped with optical instruments that orbit the earth to take photographs of specific areas at users' requests. Compared with huge user requests, satellites are still scanty resources. For some task, the satellite has to roll its camera to take the desired image. However, manysatellites are rigidly restricted on maneuverability. As a result, the performances of satellites are greatly confined. Therefore, we need a scientific observation plan to weaken the constraints arising from satellites' poor slew ability. To solve the problem we present a multi satellites scheduling algorithm based on task merging mechanism. The algorithm partitions the problem into two sub-problems: task assignment and task merging. In task assignment, we propose an adaptive ant colony optimization algorithm to select specific time window for each task, creating a task list for each satellite. In task merging, we propose the concept of task combination and develop a dynamic programming algorithm to find the best merging plan for each satellite. The two sub-problems are logically coupled; a valid observation plan will be got after much iteration. Finally, a series of test examples are given out, which demonstrate our algorithm to be effective. (C) 2013 Elsevier Inc. All rights reserved.
Keyword:
Earth observation satellite
Scheduling
Task merging
Decomposition optimization
Dynamic programming
Adaptive ant colony optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints具有时间窗约束的车辆路径和调度问题的算法
PREAI
分享收藏A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem最大覆盖位置问题的拉格朗日松弛和替代松弛的比较
PREAI
分享收藏
没有更多内容
没有更多内容