Spatiotemporal-Aware Multi-Agent Reinforcement Learning for Revisit-Oriented Multi-Satellite Observation Task Scheduling

The scheduling of Earth observation satellites presents a formidable multi-objective optimization challenge, characterized by inherent trade-offs among task completion rate, execution timeliness, and the temporal uniformity of revisits. To address this, we introduce the Multi-Satellite Observation Task Scheduling (MSOTS) framework, a novel end-to-end approach based on Multi-Agent Reinforcement Learning (MARL). This framework formulates the scheduling process as a Markov game, employing the Multi-Agent Proximal Policy Optimization (MAPPO) algorithm within a Centralized Training, Decentralized Execution (CTDE) paradigm to effectively navigate these competing objectives. Furthermore, to ensure a balanced evaluation, we propose a Composite Multi-Objective Performance Score grounded in a weighted harmonic mean. Comprehensive empirical evaluations conducted on large-scale, simulated orbital scenarios demonstrate that MSOTS significantly outperforms both traditional heuristics and existing deep reinforcement learning methods in comprehensive performance and robust efficiency. This research provides a highly effective and intelligent approach to modern satellite task scheduling.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-03-11
DOI
https://doi.org/10.3390/app16062685
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Spatiotemporal-Aware Multi-Agent Reinforcement Learning for Revisit-Oriented Multi-Satellite Observation Task Scheduling

Binpin Su, Chongbin Guo, Qing He, Xuanyu Liu et al.
Applied Sciences
Satellite Communication Systems
article

Spatiotemporal-Aware Multi-Agent Reinforcement Learning for Revisit-Oriented Multi-Satellite Observation Task Scheduling

Binpin Su, Chongbin Guo, Qing He, Xuanyu Liu, Wenbo Zhang, Wei Zhao
article en

Abstract

The scheduling of Earth observation satellites presents a formidable multi-objective optimization challenge, characterized by inherent trade-offs among task completion rate, execution timeliness, and the temporal uniformity of revisits. To address this, we introduce the Multi-Satellite Observation Task Scheduling (MSOTS) framework, a novel end-to-end approach based on Multi-Agent Reinforcement Learning (MARL). This framework formulates the scheduling process as a Markov game, employing the Multi-Agent Proximal Policy Optimization (MAPPO) algorithm within a Centralized Training, Decentralized Execution (CTDE) paradigm to effectively navigate these competing objectives. Furthermore, to ensure a balanced evaluation, we propose a Composite Multi-Objective Performance Score grounded in a weighted harmonic mean. Comprehensive empirical evaluations conducted on large-scale, simulated orbital scenarios demonstrate that MSOTS significantly outperforms both traditional heuristics and existing deep reinforcement learning methods in comprehensive performance and robust efficiency. This research provides a highly effective and intelligent approach to modern satellite task scheduling.

Applied SciencesVol. 16(6)
Shanghai Micro Satellite Engineering Center (CN), University of Chinese Academy of Sciences (CN), Innovation Academy for Microsatellites of Chinese Academy of Sciences, Shanghai Ocean University (CN)
National Natural Science Foundation of China, Chinese Academy of Sciences
Openalex Percentile: Top 25%
Satellite Communication Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.