Online Assignment of Satellite Data Transmission Tasks Based on Twin Delayed Deep Deterministic Policy Gradient

This study focuses on the scheduling problem of satellite data transmission tasks, where ground station resources are scarce and subject to multiple constraints, such as limited funding, long investment cycles, and limited industrial technology. With the increase of satellite observation tasks, data...

Full description

Saved in:
Bibliographic Details
Published in:2024 7th World Conference on Computing and Communication Technologies (WCCCT) pp. 245 - 249
Main Authors: Li, Ke, Xiong, Shunrui, Yang, Mingying, Ma, Sai
Format: Conference Proceeding
Language:English
Published: IEEE 12.04.2024
Subjects:
data transmission task scheduling
Deep reinforcement learning
Dynamic scheduling
Heuristic algorithms
Job shop scheduling
Processor scheduling
Satellites
scheduling problem
Sharding
twin delayed deep deterministic policy gradient
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This study focuses on the scheduling problem of satellite data transmission tasks, where ground station resources are scarce and subject to multiple constraints, such as limited funding, long investment cycles, and limited industrial technology. With the increase of satellite observation tasks, data transmission tasks continue to rise, making scheduling problems more urgent. Effective data transmission task scheduling requires comprehensive consideration of multiple factors such as task priority, visible time window, and ground station location within a limited time frame, in order to maximize the utilization of ground station resources and ensure the effective and efficient execution of satellite data transmission tasks. In addition, considering the segmentation and rearrangement capabilities of satellites and the need for online scheduling of emergency data transmission tasks, this paper proposes a new online scheduling problem for data transmission tasks (OSDTT). To solve the OSDTT problem, deep reinforcement learning method was introduced, and online scheduling of dynamic data transmission tasks was achieved through Markov modeling and deep deterministic policy gradient algorithm. The experimental results show that the proposed algorithm performs superior on the OSDTT problem. Overall, this study provides a new perspective and solution for satellite data transmission task scheduling problems, emphasizing the importance of online scheduling for dynamic tasks. In addition, it contributes to the improvement of algorithm performance in different task density scenarios.
AbstractList This study focuses on the scheduling problem of satellite data transmission tasks, where ground station resources are scarce and subject to multiple constraints, such as limited funding, long investment cycles, and limited industrial technology. With the increase of satellite observation tasks, data transmission tasks continue to rise, making scheduling problems more urgent. Effective data transmission task scheduling requires comprehensive consideration of multiple factors such as task priority, visible time window, and ground station location within a limited time frame, in order to maximize the utilization of ground station resources and ensure the effective and efficient execution of satellite data transmission tasks. In addition, considering the segmentation and rearrangement capabilities of satellites and the need for online scheduling of emergency data transmission tasks, this paper proposes a new online scheduling problem for data transmission tasks (OSDTT). To solve the OSDTT problem, deep reinforcement learning method was introduced, and online scheduling of dynamic data transmission tasks was achieved through Markov modeling and deep deterministic policy gradient algorithm. The experimental results show that the proposed algorithm performs superior on the OSDTT problem. Overall, this study provides a new perspective and solution for satellite data transmission task scheduling problems, emphasizing the importance of online scheduling for dynamic tasks. In addition, it contributes to the improvement of algorithm performance in different task density scenarios.
Author Xiong, Shunrui
Ma, Sai
Yang, Mingying
Li, Ke
Author_xml – sequence: 1
  givenname: Ke
  surname: Li
  fullname: Li, Ke
  email: keli@swjtu.edu.cn
  organization: Southwest Jiaotong University,School of Computing and Artificial Intelligence,Chengdu,China
– sequence: 2
  givenname: Shunrui
  surname: Xiong
  fullname: Xiong, Shunrui
  email: xiong05340@my.swjtu.edu.cn
  organization: Southwest Jiaotong University,School of Computing and Artificial Intelligence,Chengdu,China
– sequence: 3
  givenname: Mingying
  surname: Yang
  fullname: Yang, Mingying
  email: 2019115591@my.swjtu.edu.cn
  organization: Southwest Jiaotong University,School of Computing and Artificial Intelligence,Chengdu,China
– sequence: 4
  givenname: Sai
  surname: Ma
  fullname: Ma, Sai
  email: gabrielma@my.swjtu.edu.cn
  organization: Southwest Jiaotong University,School of Computing and Artificial Intelligence,Chengdu,China
BookMark eNo1kE9LAzEUxCPoQWu_gYd8gdb82WSTY91qKxQquOKxvG7eysPdbNkEpN_eFfUywzDD7zA37DIOERnjUiylFP7-vaqq2gprzVIJVSylMIV02l-wuS-900boUmnlrtmwjx1F5KuU6CP2GDMfWv4KGbuOMvI1ZOD1CDH1NE2GyGtIn4k_QMLAf-IXRb7GDs5TXiOeJsk49hQpZWr4y9BRc-abEQJN9Ft21UKXcP7nM_b29FhX28Vuv3muVrsFSenzQmtovXFKlx6tsypobb1Cq8AEYbBwhYHSaAVK2XKqi9D6Bpw8ytDKcHR6xu5-uYSIh9NIPYznw_8P-huF51iW
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/WCCCT60665.2024.10541839
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798350372328
EndPage 249
ExternalDocumentID 10541839
Genre orig-research
GrantInformation_xml – fundername: Research and Development
  funderid: 10.13039/100006190
– fundername: Natural Science Foundation of Sichuan Province
  funderid: 10.13039/501100018542
– fundername: Natural Science Foundation of Hebei Province
  funderid: 10.13039/501100003787
– fundername: National Natural Science Foundation of China
  funderid: 10.13039/501100001809
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i119t-33af9582379e6862d33692e62a5d05e4845a7532a226762d4df9ca81b1df1db83
IEDL.DBID RIE
IngestDate Wed Aug 27 02:06:55 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i119t-33af9582379e6862d33692e62a5d05e4845a7532a226762d4df9ca81b1df1db83
PageCount 5
ParticipantIDs ieee_primary_10541839
PublicationCentury 2000
PublicationDate 2024-April-12
PublicationDateYYYYMMDD 2024-04-12
PublicationDate_xml – month: 04
  year: 2024
  text: 2024-April-12
  day: 12
PublicationDecade 2020
PublicationTitle 2024 7th World Conference on Computing and Communication Technologies (WCCCT)
PublicationTitleAbbrev WCCCT
PublicationYear 2024
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.8664467
Snippet This study focuses on the scheduling problem of satellite data transmission tasks, where ground station resources are scarce and subject to multiple...
SourceID ieee
SourceType Publisher
StartPage 245
SubjectTerms data transmission task scheduling
Deep reinforcement learning
Dynamic scheduling
Heuristic algorithms
Job shop scheduling
Processor scheduling
Satellites
scheduling problem
Sharding
twin delayed deep deterministic policy gradient
Title Online Assignment of Satellite Data Transmission Tasks Based on Twin Delayed Deep Deterministic Policy Gradient
URI https://ieeexplore.ieee.org/document/10541839
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEF1s8eBJxYrf7MFrarMfSfZqavVUClbsrUyyEwlKUtpU8d87u2kVDx68LNkQCMyQvLe7894wdg2qyIg32MAkIg6UVHlgLA1JpqV2FmEG2mYT8XiczGZmshGrey0MIvriM-y7S3-Wb-t87bbK6AvXyiF6h3XiOGrFWtvqnIG5eU7TdOoIuaZ1n1D97eO_Gqd43Bjt__ONB6z3o8Djk29sOWQ7WB2xuvUF5RTS8sWf4vO64I_gTTUb5ENogHvwoeS5XTA-hdXrit8SUlnuph9lxYf4Bp80HyIuaGirYbxdM29Ngvn90teBNT32NLqbpg_BpmFCUIahaQIpoTDa2c8YdMoPK2VkBEYCtB1oVInSQMsTAcS56CdolS1MDkRcQ1uENkvkMetWdYUnjIuceEYuIEGrVBGBkTqzAoW1URZmUp-ynovWfNF6Ysy3gTr74_4523M5CbxL4gXrNss1XrLd_L0pV8srn8kvYLig9w
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEF20CnpSseK3e_Ca2uxHmr2aWivWUjBib2WTmUhQktKmiv_e3U2rePDgZckGQmCG5L3dnfeGkEstssTwBvBUyDqe4CL1FJghTCSX1iJM6brZRGc4DMdjNVqK1Z0WBhFd8Rm27KU7y4cyXditMvOFS2ERfZ1sSCFYu5Zrrepz2urqOYqi2FJyaVZ-TLRWD_xqneKQo7fzz3fukuaPBo-OvtFlj6xhsU_K2hmUmqDmL-4cn5YZfdTOVrNC2tWVpg5-TPrsPhiN9fx1Tq8NVgG104-8oF18059m3kWcmqGuh3GGzbS2Caa3M1cJVjXJU-8mjvresmWCl_u-qjzOdaakNaBRaLUfwHmgGAZMS2hLFKGQ2ixQmDasy_wGQUCmUm2oqw-ZD0nID0ijKAs8JJSlhmmkTIcIQmSBVlwmwJABBImfcHlEmjZak2ntijFZBer4j_sXZKsfPwwmg7vh_QnZtvnxnGfiKWlUswWekc30vcrns3OX1S_sqKQ-
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2024+7th+World+Conference+on+Computing+and+Communication+Technologies+%28WCCCT%29&rft.atitle=Online+Assignment+of+Satellite+Data+Transmission+Tasks+Based+on+Twin+Delayed+Deep+Deterministic+Policy+Gradient&rft.au=Li%2C+Ke&rft.au=Xiong%2C+Shunrui&rft.au=Yang%2C+Mingying&rft.au=Ma%2C+Sai&rft.date=2024-04-12&rft.pub=IEEE&rft.spage=245&rft.epage=249&rft_id=info:doi/10.1109%2FWCCCT60665.2024.10541839&rft.externalDocID=10541839