导航

ACTA AERONAUTICAET ASTRONAUTICA SINICA ›› 2023, Vol. 44 ›› Issue (12): 327759-327759.doi: 10.7527/S1000-6893.2022.27759

• Electronics and Electrical Engineering and Control • Previous Articles    

Large-scale constellation TT&C resource scheduling algorithm based on adaptive simulated annealing

Guohua WU(), Tianyu WANG   

  1. School of Traffic and Transportation Engineering,Central South University,Changsha 410073,China
  • Received:2022-07-04 Revised:2022-07-20 Accepted:2022-08-04 Online:2022-08-09 Published:2022-08-08
  • Contact: Guohua WU E-mail:guohuawu@csu.edu.cn
  • Supported by:
    National Natural Science Foundation of China(62073341)

Abstract:

With the rapid growth of the number of satellites in orbit, the already relatively scarce Tracking Telemetry and Command (TT&C) resources are becoming even more scarce. The TT&C resource scheduling problem for large-scale constellation is restricted by multiple constraints, and is a complex combinatorial optimization problem with strong conflicts. An improved adaptive simulated annealing algorithm is proposed to solve the TT&C resource scheduling problem for large-scale constellation in order to improve the capability of TT&C systems and the revenue from completing TT&C tasks. Firstly, the satellite TT&C process is analyzed. According to satellite TT&C task requirements and resource usage constraints, a constraint satisfaction model is established aiming to maximize the total profits from task completion. A method for evaluating the conflict degree of available TT&C opportunities is proposed, and a fitness based task allocation algorithm is designed to generate a high-quality initial solution. Then, an adaptive simulated annealing algorithm combining perturbation strategy and tabu mechanism is designed, which adaptively controls the update of temperature and neighborhood structure selection probability during the optimization process of the algorithm. The short-term memory mechanism of the tabu table is used to avoid repeated searches. The perturbation strategy is combined to diverse the solution to a certain extent, thereby jumping out of the local optima and enhancing the optimization performance of the algorithm. Finally, in order to verify the effectiveness of the proposed method, a large number of simulation experiments were conducted to compare the algorithm with simulated annealing algorithm, genetic algorithm, fitness based task allocation algorithm, and maximum weight first allocation algorithm. Experimental results show that compared with traditional algorithms, the proposed algorithm improves the solution by 10.34%, 23.59%, 23.20%, and 46.51%, respectively.

Key words: large-scale constellation, TT&C resource scheduling, conflict degree, simulated annealing algorithm, self-adaptive

CLC Number: