Deep reinforcement learning-based resource allocation method for multi-satellite scheduling

IF 4.3 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2025-09-01 Epub Date: 2025-04-17 DOI:10.1016/j.cor.2025.107088
Xiaoyu Chen , Tian Tian , Guangming Dai , Maocai Wang , Zhiming Song , Lining Xing
{"title":"Deep reinforcement learning-based resource allocation method for multi-satellite scheduling","authors":"Xiaoyu Chen ,&nbsp;Tian Tian ,&nbsp;Guangming Dai ,&nbsp;Maocai Wang ,&nbsp;Zhiming Song ,&nbsp;Lining Xing","doi":"10.1016/j.cor.2025.107088","DOIUrl":null,"url":null,"abstract":"<div><div>Agile Earth observation satellites (AEOSs) scheduling represents a complex domain within combinatorial optimization, crucial for the regular operations and mission success of in-orbit satellites. In order to timelessly tackle the allocation of complex resources and corresponding time windows, a satellite resource adaptive allocation method, named SRADA-DRL, is proposed in this paper. By combining deep reinforcement learning (DRL) with rule-based heuristics, the SRADA-DRL is designed to optimize the allocation of satellite resources in dynamic environments. Concerning maximizing the total rewards of allocated missions, a mathematical model and a corresponding Markov decision model are constructed within the scheduling process. After analyzing the spatial–temporal distribution features of all resources and missions, the time-dependent missions are first decomposed into meta-missions corresponding to satellite resources, and a meta-mission is then selected to generate an allocation sequence in each stage. On this basis, the execution times for all missions are assigned in the single-satellite scheduling process. In which, the DRL updates the gradient information contingent upon the rewards garnered from the allocation sequence. In addition, the classical scheduling scenarios of varying scales are also conducted. Experimental results demonstrate the effectiveness and efficiency of the proposed SRADA-DRL method in addressing the AEOSs scheduling.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"181 ","pages":"Article 107088"},"PeriodicalIF":4.3000,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825001169","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/4/17 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Agile Earth observation satellites (AEOSs) scheduling represents a complex domain within combinatorial optimization, crucial for the regular operations and mission success of in-orbit satellites. In order to timelessly tackle the allocation of complex resources and corresponding time windows, a satellite resource adaptive allocation method, named SRADA-DRL, is proposed in this paper. By combining deep reinforcement learning (DRL) with rule-based heuristics, the SRADA-DRL is designed to optimize the allocation of satellite resources in dynamic environments. Concerning maximizing the total rewards of allocated missions, a mathematical model and a corresponding Markov decision model are constructed within the scheduling process. After analyzing the spatial–temporal distribution features of all resources and missions, the time-dependent missions are first decomposed into meta-missions corresponding to satellite resources, and a meta-mission is then selected to generate an allocation sequence in each stage. On this basis, the execution times for all missions are assigned in the single-satellite scheduling process. In which, the DRL updates the gradient information contingent upon the rewards garnered from the allocation sequence. In addition, the classical scheduling scenarios of varying scales are also conducted. Experimental results demonstrate the effectiveness and efficiency of the proposed SRADA-DRL method in addressing the AEOSs scheduling.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于深度强化学习的多卫星调度资源分配方法
敏捷对地观测卫星调度是组合优化中的一个复杂问题,对在轨卫星的正常运行和任务成功至关重要。为了解决复杂资源和相应时间窗的分配问题,提出了一种卫星资源自适应分配方法SRADA-DRL。将深度强化学习(DRL)与基于规则的启发式方法相结合,设计了SRADA-DRL来优化动态环境下的卫星资源分配。针对分配任务的总报酬最大化问题,建立了调度过程中的数学模型和相应的马尔可夫决策模型。在分析了所有资源和任务的时空分布特征后,首先将时间相关任务分解为与卫星资源相对应的元任务,然后选择一个元任务生成每个阶段的分配序列。在此基础上,在单卫星调度过程中分配各任务的执行时间。其中,DRL根据从分配序列中获得的奖励更新梯度信息。此外,还对不同规模的经典调度场景进行了分析。实验结果证明了该方法在解决aeos调度问题上的有效性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Beware of the classical benchmark instances for the Traveling Salesman Problem with Time Windows A speed-up for Helsgaun’s TSP heuristic by relaxing the positive gain criterion A memory-enhanced Greedy Randomized Adaptive Search Procedure for the Multi-Pickup and Delivery Problem with Time Windows A neural-driven constructive heuristic for the flexible job shop scheduling problem: An efficient alternative to complex deep learning methods Constraint programming approaches for stochastic Resource-Constrained Project Scheduling Problem subject to disruptions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1