Aiming at the problems of a large number of low-orbit constellation satellites, considerable task pressure of tracking, telemetry, and command (TT&C) network, and limited resources of TT&C stations, this paper proposes a satellite TT&C station layout algorithm based on improved artificial fish swarm algorithm. Firstly, according to the requirements of satellite TT&C tasks and the constraints of TT&C stations, a constraint satisfaction model with the optimization goal of maximizing satellite service time is constructed. Secondly, an adaptive artificial fish swarm algorithm combined with a penalty function is proposed; that is, the moving step size and sensing distance are adaptively adjusted in the iterative process of the algorithm. By adding a penalty function to the fitness function, the optimal solution vector is retained for iterative optimization, and the optimization performance of the algorithm is enhanced. Finally, to verify the algorithm’s effectiveness, the algorithm is compared with the genetic algorithm and the basic artificial fish swarm algorithm. The simulation results show that the proposed algorithm has a faster convergence speed and better convergence effect.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Satellite TT&C Station Layout Method Based on Improved Artificial Fish Swarm Algorithm

  • Kewei Ni,
  • Xinglong Li,
  • Gaopeng Zhao

摘要

Aiming at the problems of a large number of low-orbit constellation satellites, considerable task pressure of tracking, telemetry, and command (TT&C) network, and limited resources of TT&C stations, this paper proposes a satellite TT&C station layout algorithm based on improved artificial fish swarm algorithm. Firstly, according to the requirements of satellite TT&C tasks and the constraints of TT&C stations, a constraint satisfaction model with the optimization goal of maximizing satellite service time is constructed. Secondly, an adaptive artificial fish swarm algorithm combined with a penalty function is proposed; that is, the moving step size and sensing distance are adaptively adjusted in the iterative process of the algorithm. By adding a penalty function to the fitness function, the optimal solution vector is retained for iterative optimization, and the optimization performance of the algorithm is enhanced. Finally, to verify the algorithm’s effectiveness, the algorithm is compared with the genetic algorithm and the basic artificial fish swarm algorithm. The simulation results show that the proposed algorithm has a faster convergence speed and better convergence effect.