导航

Acta Aeronautica et Astronautica Sinica ›› 2023, Vol. 44 ›› Issue (15): 528698-528698.doi: 10.7527/S1000-6893.2023.28698

• Flight Mechanics and Guidance Control • Previous Articles    

Space target rendezvous sequence planning via pointer networks

Jiacheng ZHANG1,2, Yuehe ZHU1,2, Yazhong LUO1,2()   

  1. 1.College of Aerospace Science,National University of Defense Technology,Changsha  410073,China
    2.Hunan Key Laboratory of Intelligent Planning and Simulation for Aerospace Missions,Changsha  410073,China
  • Received:2023-04-11 Revised:2023-04-22 Accepted:2023-05-06 Online:2023-05-15 Published:2023-05-12
  • Contact: Yazhong LUO E-mail:luoyz@nudt.edu.cn
  • Supported by:
    National Natural Science Foundation of China(12125207)

Abstract:

Traversal rendezvous mission planning of multiple space targets for a single spacecraft is a mixed-integer programming problem with high complexity, which involves the combinatorial optimization of the top-level rendezvous sequence and the continuous optimization of the base-level flight trajectories. Existing methods that integrally optimize all discrete and continuous variables are inefficient and difficult to achieve the optimum. We propose a learning-based method that can efficiently obtain the near-optimal sequence mainly using the pointer networks. First, the neural network model for multiple-space-target traversal rendezvous planning is constructed as the decision agent of sequencing. Second, an unsupervised learning method based on the asynchronous advantage actor-critic algorithm is proposed to avoid the expensive computational cost in obtaining training labels. Finally, an estimation method to rapidly approximate the actual transfer cost is embedded in the training process to improve the efficiency of calculating rewards. Case studies show that the proposed training method performs efficiently, and the well-trained agent can rapidly predict the optimal sequence with a probability more than 88.7%.

Key words: aerospace mission planning, rendezvous sequence planning, moving target traveling salesman problem, combinatorial optimization, pointer network, reinforcement learning

CLC Number: