GEO Spacecraft Rendezvous Sequence Mission Planning Based on Data Augmented REINFORCE Algorithm

This paper proposes a fast multi-spacecraft rendezvous sequence mission planning algorithm based on neural combinatorial optimization (NCO) and deep reinforcement learning (DRL). The algorithm can address rendezvous requirements for various GEO spacecraft on-orbit servicing missions, such as on-orbit maintenance and on-orbit refueling. In order to meet the fast decision-making needs of multi-spacecraft rendezvous missions and ensure the successful completion of the missions, we take advantage of the fast calculation speed of the DRL algorithm and make some unique designs to address the challenges of missions, and finally propose the data augmented REINFORCE algorithm (DARA). The algorithm can rapidly plan the optimal rendezvous sequence for multiple GEO targets and minimize fuel consumption while completing all rendezvous missions. It is implemented based on the REINFORCE algorithm using a multi-head attention neural network. In order to solve the problem that DRL training is difficult due to the time-varying characteristics of the space targets' positions, a data augmentation method is designed to strengthen the learning weights of different parameters. In order to solve the problem of trivial objective function gradient and slow iteration caused by the dense distribution of orbital planes, a loss function is designed to improve the earning efficiency of the neural network. Through multiple comparative experiments with existing algorithms, the calculation speed of DARA significantly exceeds that of commonly used heuristic mission planning algorithms. The results accuracy is better than that of various meta-heuristic algorithms and typical reinforcement learning algorithm, which proves the effectiveness and superiority of the proposed algorithm.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Aerospace and Electronic Systems
Published
2025-08-04
DOI
https://doi.org/10.1109/taes.2025.3595109
Citations
1
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GEO Spacecraft Rendezvous Sequence Mission Planning Based on Data Augmented REINFORCE Algorithm

Guangtao Ran, Yanning Guo, Chuanjiang Li, Bohui Wang et al.
1 citations
IEEE Transactions on Aerospace and Electronic Systems
Distributed and Parallel Computing Systems
1.49
article

GEO Spacecraft Rendezvous Sequence Mission Planning Based on Data Augmented REINFORCE Algorithm

Guangtao Ran, Yanning Guo, Chuanjiang Li, Bohui Wang, Muhammad Ashraf, Shuanghong Wu
article en
1 citations

Abstract

This paper proposes a fast multi-spacecraft rendezvous sequence mission planning algorithm based on neural combinatorial optimization (NCO) and deep reinforcement learning (DRL). The algorithm can address rendezvous requirements for various GEO spacecraft on-orbit servicing missions, such as on-orbit maintenance and on-orbit refueling. In order to meet the fast decision-making needs of multi-spacecraft rendezvous missions and ensure the successful completion of the missions, we take advantage of the fast calculation speed of the DRL algorithm and make some unique designs to address the challenges of missions, and finally propose the data augmented REINFORCE algorithm (DARA). The algorithm can rapidly plan the optimal rendezvous sequence for multiple GEO targets and minimize fuel consumption while completing all rendezvous missions. It is implemented based on the REINFORCE algorithm using a multi-head attention neural network. In order to solve the problem that DRL training is difficult due to the time-varying characteristics of the space targets' positions, a data augmentation method is designed to strengthen the learning weights of different parameters. In order to solve the problem of trivial objective function gradient and slow iteration caused by the dense distribution of orbital planes, a loss function is designed to improve the earning efficiency of the neural network. Through multiple comparative experiments with existing algorithms, the calculation speed of DARA significantly exceeds that of commonly used heuristic mission planning algorithms. The results accuracy is better than that of various meta-heuristic algorithms and typical reinforcement learning algorithm, which proves the effectiveness and superiority of the proposed algorithm.

IEEE Transactions on Aerospace and Electronic SystemsVol. 61(6)
Harbin Institute of Technology (CN), Xi'an Jiaotong University (CN)
Climate action
Openalex Percentile: Top 14%
Distributed and Parallel Computing Systems
1.49
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.