Improved heuristic auction-initialized large neighborhood search for online scheduling of Earth observation satellites in large-scale emergency mission

IF 3.2 3区 地球科学 Q2 ASTRONOMY & ASTROPHYSICS
Advances in Space Research Pub Date : 2026-07-15 Epub Date: 2026-05-04 DOI:10.1016/j.asr.2026.04.116
Cheng Wang, Yuhan Liu, Yueyong Lyu, Xusheng Xu, Bin Song
{"title":"Improved heuristic auction-initialized large neighborhood search for online scheduling of Earth observation satellites in large-scale emergency mission","authors":"Cheng Wang,&nbsp;Yuhan Liu,&nbsp;Yueyong Lyu,&nbsp;Xusheng Xu,&nbsp;Bin Song","doi":"10.1016/j.asr.2026.04.116","DOIUrl":null,"url":null,"abstract":"<div><div>Real-time and reliable online scheduling for large-scale Earth observation mission using multiple agile satellites remains challenging, due to stringent response-time and complex orbit-attitude coupling dynamics during observation maneuvers. To address this problem, this paper proposes a novel improved heuristic auction-initialized large neighborhood search (IHALNS) algorithm framework. First, a precise attitude-pointing maneuver model based on iterative correction strategy is developed to ensure the reliability of planned schedules. Then, a mission planning model is established to maximize observation profit while minimizing maneuver energy consumption. Subsequently, the IHALNS algorithm framework is proposed for real-time online scheduling. Within IHALNS, an improved heuristic auction (IHA) algorithm module with multiple heuristic rules and a self-decision mechanism is developed to generate a high-quality initial scheduling scheme in real time. Furthermore, a large neighborhood search incorporating density-guided destroy and spatiotemporal coupling repair operators is designed to rapidly achieve global optimization based on the initial scheme. Finally, numerical simulations demonstrate that the proposed IHALNS algorithm framework outperforms conventional methods in terms of computational efficiency, solution quality, scalability and stability, showing significant advantages in real-time online scheduling.</div></div>","PeriodicalId":50850,"journal":{"name":"Advances in Space Research","volume":"78 2","pages":"Pages 1367-1388"},"PeriodicalIF":3.2000,"publicationDate":"2026-07-15","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/S0273117726006241","RegionNum":3,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/5/4 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"ASTRONOMY & ASTROPHYSICS","Score":null,"Total":0}
引用次数: 0

Abstract

Real-time and reliable online scheduling for large-scale Earth observation mission using multiple agile satellites remains challenging, due to stringent response-time and complex orbit-attitude coupling dynamics during observation maneuvers. To address this problem, this paper proposes a novel improved heuristic auction-initialized large neighborhood search (IHALNS) algorithm framework. First, a precise attitude-pointing maneuver model based on iterative correction strategy is developed to ensure the reliability of planned schedules. Then, a mission planning model is established to maximize observation profit while minimizing maneuver energy consumption. Subsequently, the IHALNS algorithm framework is proposed for real-time online scheduling. Within IHALNS, an improved heuristic auction (IHA) algorithm module with multiple heuristic rules and a self-decision mechanism is developed to generate a high-quality initial scheduling scheme in real time. Furthermore, a large neighborhood search incorporating density-guided destroy and spatiotemporal coupling repair operators is designed to rapidly achieve global optimization based on the initial scheme. Finally, numerical simulations demonstrate that the proposed IHALNS algorithm framework outperforms conventional methods in terms of computational efficiency, solution quality, scalability and stability, showing significant advantages in real-time online scheduling.
大型应急任务中对地观测卫星在线调度的改进启发式拍卖初始化大邻域搜索
由于观测机动过程中响应时间严格、轨道姿态耦合动力学复杂,使用多颗敏捷卫星进行大规模对地观测任务的实时、可靠在线调度仍然具有挑战性。为了解决这一问题,本文提出了一种改进的启发式拍卖初始化大邻域搜索算法框架。首先,建立了基于迭代修正策略的精确姿态指向机动模型,以保证计划调度的可靠性;在此基础上,建立了以观测利润最大化、机动能量消耗最小化为目标的任务规划模型。随后,提出了用于实时在线调度的IHALNS算法框架。在IHALNS中,开发了一种改进的启发式拍卖(IHA)算法模块,该模块具有多启发式规则和自决策机制,可以实时生成高质量的初始调度方案。此外,在初始方案的基础上,设计了包含密度引导破坏算子和时空耦合修复算子的大邻域搜索,快速实现全局优化。最后,数值仿真结果表明,本文提出的IHALNS算法框架在计算效率、解质量、可扩展性和稳定性等方面均优于传统算法,在实时在线调度方面具有显著优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书