Large-scale hybrid mission scheduling for LuTan-1 satellites using sparse evolutionary algorithm

IF 3.4 2区 物理与天体物理 Q1 ENGINEERING, AEROSPACE
Wan Liu , Dexin Zhang , Yuan Tian , Xiaowei Shao
{"title":"Large-scale hybrid mission scheduling for LuTan-1 satellites using sparse evolutionary algorithm","authors":"Wan Liu ,&nbsp;Dexin Zhang ,&nbsp;Yuan Tian ,&nbsp;Xiaowei Shao","doi":"10.1016/j.actaastro.2025.08.044","DOIUrl":null,"url":null,"abstract":"<div><div>LuTan-1 is China’s first L-band Synthetic Aperture Radar (SAR) satellite system designed for high-precision global land deformation monitoring. To address the challenges of SAR satellite observation missions characterized by extensive spatial coverage and intensive temporal conflicts, this paper presents a hybrid large-scale mission scheduling optimization method based on a revised sparse evolutionary algorithm (R-SparseEA). The method first generates meta-tasks through irregular region decomposition to minimize global overlap while comprehensively considering satellite visibility, onboard resources, and regional priorities. Subsequently, a multi-objective hybrid mission scheduling model with multiple revisit periods is established, providing an efficient and scalable framework for describing the large-scale long-term decision-making problem of SAR satellite systems. The proposed R-SparseEA algorithm incorporates innovative evolutionary techniques, including novel population initialization, masked genetic operations, and sparse population revision strategies to effectively solve this model. These techniques ensure both the feasibility and sparsity of the solution set throughout the evolutionary process. Comparative experiments demonstrate that R-SparseEA outperforms three state-of-the-art sparse evolutionary algorithms in Pareto solution set distribution, convergence performance, and computational efficiency. Simulation results indicate that complete coverage of China can be achieved within 33 days, while global land observation can be accomplished in 79 days through the collaboration of LuTan-1’s dual satellites.</div></div>","PeriodicalId":44971,"journal":{"name":"Acta Astronautica","volume":"237 ","pages":"Pages 395-408"},"PeriodicalIF":3.4000,"publicationDate":"2025-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Astronautica","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0094576525005521","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, AEROSPACE","Score":null,"Total":0}
引用次数: 0

Abstract

LuTan-1 is China’s first L-band Synthetic Aperture Radar (SAR) satellite system designed for high-precision global land deformation monitoring. To address the challenges of SAR satellite observation missions characterized by extensive spatial coverage and intensive temporal conflicts, this paper presents a hybrid large-scale mission scheduling optimization method based on a revised sparse evolutionary algorithm (R-SparseEA). The method first generates meta-tasks through irregular region decomposition to minimize global overlap while comprehensively considering satellite visibility, onboard resources, and regional priorities. Subsequently, a multi-objective hybrid mission scheduling model with multiple revisit periods is established, providing an efficient and scalable framework for describing the large-scale long-term decision-making problem of SAR satellite systems. The proposed R-SparseEA algorithm incorporates innovative evolutionary techniques, including novel population initialization, masked genetic operations, and sparse population revision strategies to effectively solve this model. These techniques ensure both the feasibility and sparsity of the solution set throughout the evolutionary process. Comparative experiments demonstrate that R-SparseEA outperforms three state-of-the-art sparse evolutionary algorithms in Pareto solution set distribution, convergence performance, and computational efficiency. Simulation results indicate that complete coverage of China can be achieved within 33 days, while global land observation can be accomplished in 79 days through the collaboration of LuTan-1’s dual satellites.
基于稀疏进化算法的陆坦一号卫星大规模混合任务调度
鲁坦-1是中国首个l波段合成孔径雷达(SAR)卫星系统,设计用于高精度全球陆地变形监测。针对SAR卫星观测任务空间覆盖广、时间冲突大的特点,提出了一种基于改进稀疏进化算法(R-SparseEA)的混合大规模任务调度优化方法。该方法首先通过不规则区域分解生成元任务,在综合考虑卫星能见度、机载资源和区域优先级的同时,最大限度地减少全局重叠。随后,建立了多重访周期的多目标混合任务调度模型,为描述SAR卫星系统大规模长期决策问题提供了一个高效、可扩展的框架。提出的R-SparseEA算法结合了新颖的种群初始化、隐藏遗传操作和稀疏种群修正策略等进化技术,有效地解决了该模型。这些技术确保了整个进化过程中解决方案集的可行性和稀疏性。对比实验表明,R-SparseEA在Pareto解集分布、收敛性能和计算效率方面优于三种最先进的稀疏进化算法。模拟结果表明,通过“陆坦一号”双星的协同,可以在33天内实现对中国的完全覆盖,而全球陆地观测可以在79天内完成。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Acta Astronautica
Acta Astronautica 工程技术-工程:宇航
CiteScore
7.20
自引率
22.90%
发文量
599
审稿时长
53 days
期刊介绍: Acta Astronautica is sponsored by the International Academy of Astronautics. Content is based on original contributions in all fields of basic, engineering, life and social space sciences and of space technology related to: The peaceful scientific exploration of space, Its exploitation for human welfare and progress, Conception, design, development and operation of space-borne and Earth-based systems, In addition to regular issues, the journal publishes selected proceedings of the annual International Astronautical Congress (IAC), transactions of the IAA and special issues on topics of current interest, such as microgravity, space station technology, geostationary orbits, and space economics. Other subject areas include satellite technology, space transportation and communications, space energy, power and propulsion, astrodynamics, extraterrestrial intelligence and Earth observations.
×
引用
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学术官方微信