Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Two-Stage Multi-Satellite Scheduling Algorithm Based on Task Merging Mechanism

Version 1 : Received: 15 April 2024 / Approved: 15 April 2024 / Online: 15 April 2024 (10:58:41 CEST)

How to cite: Yu, J.; Xing, L. N.; Song, Y. J.; Liu, Z. H. Two-Stage Multi-Satellite Scheduling Algorithm Based on Task Merging Mechanism. Preprints 2024, 2024040953. https://doi.org/10.20944/preprints202404.0953.v1 Yu, J.; Xing, L. N.; Song, Y. J.; Liu, Z. H. Two-Stage Multi-Satellite Scheduling Algorithm Based on Task Merging Mechanism. Preprints 2024, 2024040953. https://doi.org/10.20944/preprints202404.0953.v1

Abstract

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

Keywords

multi-satellite scheduling; task merging; mergring task scheduling; firework algorithm

Subject

Engineering, Aerospace Engineering

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.