A dynamic scheduling method of Earth-observing satellites by employing rolling horizon strategy.
Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy...
| Publicado en: | Scientific World Journal pp. 304047 - 304048 |
|---|---|
| Autores principales: | , , , |
| Formato: | Journal Article |
| Publicado: |
Wiley-Blackwell
2013
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=104164748&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 104164748 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 1537744X 1BX5 jtl: Scientific World Journal issn: 1537744X maglogo: N pubinfo: dt: 2013 pid: 480 pub: Wiley-Blackwell place: Malden, Massachusetts artinfo: ui: 104164748 NLM23690742 2012241927 10.1155/2013/304047 NLM23690742 PMC3654287 104164748 ppf: 304047 ppct: 1 formats: tig: atl: A dynamic scheduling method of Earth-observing satellites by employing rolling horizon strategy. aug: au: Dishan, Qiu Chuan, He Jin, Liu Manhao, Ma affil: Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha 410073, China. sug: subj: Algorithms Astronomy Image Enhancement Methods Image Interpretation, Computer Assisted Methods Photography Methods Space Flight Time Factors ab: Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, and the scheduling horizon is decomposed into a series of static scheduling intervals. By optimizing the scheduling schemes in each interval, the dynamic scheduling of EOS is realized. We also propose three dynamic scheduling algorithms by the combination of the RH strategy and various heuristic algorithms. Finally, the scheduling results of different algorithms are compared and the presented methods in this paper are demonstrated to be efficient by extensive experiments. pubtype: Academic Journal doctype: Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|