Earth observation satellite imaging task scheduling with metaheuristics: Multi-level clustering and priority-driven pre-scheduling

IF 2.8 3区 地球科学 Q2 ASTRONOMY & ASTROPHYSICS
Mohamed Elamine Galloua, Shuai Li, Jiahao Cui
{"title":"Earth observation satellite imaging task scheduling with metaheuristics: Multi-level clustering and priority-driven pre-scheduling","authors":"Mohamed Elamine Galloua,&nbsp;Shuai Li,&nbsp;Jiahao Cui","doi":"10.1016/j.asr.2024.11.023","DOIUrl":null,"url":null,"abstract":"<div><div>Daily planning and scheduling of Agile Earth Observation Satellite (AEOS) observation tasks are enormously challenging due to their inherent complexity. This complexity stems from the vast number of observations that need to be coordinated and the multiple constraints that must be considered. In this study, we propose a comprehensive framework consisting of three steps to effectively tackle these challenges. To begin with, we employ a Multi-Level Clustering technique (MLC) to mitigate the problem complexity. Additionally, we integrate a Fixed High Priority First (FHPF) algorithm for tasks pre-scheduling. This algorithm effectively manages conflicts in time resource allocation for observation tasks at the lowest cluster level. Finally, we conduct a comparative analysis of four metaheuristic algorithms, integrating the pre-scheduled task clusters from the MLC-FHPF module as input for the main scheduling process. Our strategy aims to overcome the limitations of existing methods by incorporating continuous time modeling and accounting for “Fixed Time Maneuver” for time-dependent transition time constraints. Real-world evaluations highlight the resilience and effectiveness of our MLC-FHPF framework when integrated with various metaheuristic algorithms. Our approach significantly outperforms standard metaheuristics in terms of efficacy and efficiency. Notably, the GA MLC-FHPF algorithm consistently surpasses BDP-ILS and ALNS, especially in large-scale scenarios. It adapts effectively to different task densities and scales, maintaining optimized scheduling performance and efficient processing times.</div></div>","PeriodicalId":50850,"journal":{"name":"Advances in Space Research","volume":"75 3","pages":"Pages 2929-2953"},"PeriodicalIF":2.8000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Space Research","FirstCategoryId":"89","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0273117724011451","RegionNum":3,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ASTRONOMY & ASTROPHYSICS","Score":null,"Total":0}
引用次数: 0

Abstract

Daily planning and scheduling of Agile Earth Observation Satellite (AEOS) observation tasks are enormously challenging due to their inherent complexity. This complexity stems from the vast number of observations that need to be coordinated and the multiple constraints that must be considered. In this study, we propose a comprehensive framework consisting of three steps to effectively tackle these challenges. To begin with, we employ a Multi-Level Clustering technique (MLC) to mitigate the problem complexity. Additionally, we integrate a Fixed High Priority First (FHPF) algorithm for tasks pre-scheduling. This algorithm effectively manages conflicts in time resource allocation for observation tasks at the lowest cluster level. Finally, we conduct a comparative analysis of four metaheuristic algorithms, integrating the pre-scheduled task clusters from the MLC-FHPF module as input for the main scheduling process. Our strategy aims to overcome the limitations of existing methods by incorporating continuous time modeling and accounting for “Fixed Time Maneuver” for time-dependent transition time constraints. Real-world evaluations highlight the resilience and effectiveness of our MLC-FHPF framework when integrated with various metaheuristic algorithms. Our approach significantly outperforms standard metaheuristics in terms of efficacy and efficiency. Notably, the GA MLC-FHPF algorithm consistently surpasses BDP-ILS and ALNS, especially in large-scale scenarios. It adapts effectively to different task densities and scales, maintaining optimized scheduling performance and efficient processing times.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Advances in Space Research
Advances in Space Research 地学天文-地球科学综合
CiteScore
5.20
自引率
11.50%
发文量
800
审稿时长
5.8 months
期刊介绍: The COSPAR publication Advances in Space Research (ASR) is an open journal covering all areas of space research including: space studies of the Earth''s surface, meteorology, climate, the Earth-Moon system, planets and small bodies of the solar system, upper atmospheres, ionospheres and magnetospheres of the Earth and planets including reference atmospheres, space plasmas in the solar system, astrophysics from space, materials sciences in space, fundamental physics in space, space debris, space weather, Earth observations of space phenomena, etc. NB: Please note that manuscripts related to life sciences as related to space are no more accepted for submission to Advances in Space Research. Such manuscripts should now be submitted to the new COSPAR Journal Life Sciences in Space Research (LSSR). All submissions are reviewed by two scientists in the field. COSPAR is an interdisciplinary scientific organization concerned with the progress of space research on an international scale. Operating under the rules of ICSU, COSPAR ignores political considerations and considers all questions solely from the scientific viewpoint.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信