Efficient and fair PPO-based integrated scheduling method for multiple tasks of SATech-01 satellite

SATech-01 is an experimental satellite for space science exploration and on-orbit demonstration of advanced technologies. The satellite is equipped with 16 experimental payloads and supports multiple working modes to meet the observation requirements of various payloads. Due to the limitation of pla...

Full description

Saved in:
Bibliographic Details
Published inChinese journal of aeronautics Vol. 37; no. 2; pp. 417 - 430
Main Authors SHI, Qi, LI, Lu, FANG, Ziruo, BI, Xingzi, LIU, Huaqiu, ZHANG, Xiaofeng, CHEN, Wen, YU, Jinpei
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.02.2024
University of Chinese Academy of Sciences,Beijing 100039,China
Shanghai Satellite Network Research Institute CO.,LTD,Shanghai 201210,China%Innovation Academy for Microsatellites of Chinese Academy of Sciences,Shanghai 201306,China%Innovation Academy for Microsatellites of Chinese Academy of Sciences,Shanghai 201306,China
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:SATech-01 is an experimental satellite for space science exploration and on-orbit demonstration of advanced technologies. The satellite is equipped with 16 experimental payloads and supports multiple working modes to meet the observation requirements of various payloads. Due to the limitation of platform power supply and data storage systems, proposing reasonable mission planning schemes to improve scientific revenue of the payloads becomes a critical issue. In this article, we formulate the integrated task scheduling of SATech-01 as a multi-objective optimization problem and propose a novel Fair Integrated Scheduling with Proximal Policy Optimization (FIS-PPO) algorithm to solve it. We use multiple decision heads to generate decisions for each task and design the action mask to ensure the schedule meeting the platform constraints. Experimental results show that FIS-PPO could push the capability of the platform to the limit and improve the overall observation efficiency by 31.5% compared to rule-based plans currently used. Moreover, fairness is considered in the reward design and our method achieves much better performance in terms of equal task opportunities. Because of its low computational complexity, our task scheduling algorithm has the potential to be directly deployed on board for real-time task scheduling in future space projects.
ISSN:1000-9361
DOI:10.1016/j.cja.2023.10.011