Answers are grounded in this paper and cite their sources.
The scarcity of space orbit resources has intensified the issue of orbital games between spacecraft. This paper presents a control strategy for the pursuing spacecraft in a multiple-to-one orbital pursuit–evasion game problem. Initially, a mathematical model is established for the multiple-to-one orbital pursuit–evasion game problem, incorporating impulse maneuvers for both the pursuing and evasive spacecraft. This model also considers the maximum single velocity increment and maximum total velocity increment restrictions imposed on the spacecraft. Subsequently, a method for constructing a pursuing policy, which integrates evasive spacecraft action prediction and the deep deterministic policy gradient algorithm, is proposed. The pursuing policy network and the evasive spacecraft action prediction network are trained under a centralized training and decentralized execution framework. The evasive spacecraft action prediction network can predict the actions of the evasive spacecraft based on the states observed by the pursuing spacecraft. It then predicts the subsequent state of the evasive spacecraft through the control model, providing supplementary information for the decision-making process of the pursuing policy. The simulation results indicate that the pursuing policy, enhanced by the prediction of the evasive spacecraft’s actions, outperforms the traditional deep deterministic policy gradient algorithm in both the training stage and statistical performance. Furthermore, the prediction of the evasive spacecraft’s actions can compensate for the numerical and maneuverability deficiencies of the pursuing spacecraft. However, a key limitation of this approach is its reliance on prior action data of the evasive spacecraft.
No takes yet. Share an insight, caveat, or question.
Yan et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: