Chinese Space Science and Technology ›› 2023, Vol. 43 ›› Issue (3): 123-133.doi: 10.16708/j.cnki.1000-758X.2023.0045

Previous Articles     Next Articles

Research of dynamic beam resource scheduling of LEO constellation based on A2C algorithm

LIU Wei,ZHENG Runze,ZHANG Lei,GAO Zihe,TAO Ying,CUI Kaixin   

  1. 1 Innovation Center of Satellite Communication System,CNSA,Beijing 100094,China
    2 Institute of Telecommunication and Navigation Satellites,China Academy of Space Technology,Beijing 100094,China
    3 Northwestern Polytechnical University,Xi′an 710072,China
    4 Beijing Institute of Technology,Beijing 100081,China
  • Published:2023-06-25 Online:2023-05-23

Abstract: The giant low-orbit constellation provided low-latency,largecapacity communication channels for user spacecraft such as manned spacecraft,space stations and remote sensing satellites,and there was a resource allocation optimizing problem of satellite beams.The intelligent optimization framework of A2C(advanced actor-critic)using discrete-time deep reinforcement learning was studied,and the beam resource scheduling algorithm that could effectively meet the needs of multi-users,dynamic and concurrent access was formed by combining the concepts of individuals and genes in genetic algorithms.Based on simulation and analysis,the proposed algorithm could be applicable in a variety of typical scenarios.The method could provide effective scheduling results for more than 3000 tasks in 20s,and the task success rate was not less than 91%.The complexity was reduced by algorithm optimization,which could save more than 45% of the time compared with traditional genetic algorithms.At the same time,the convergence problem in the traditional A2C algorithm framework was optimized,which solved the non-convergence problem in the traditional fully connected A2C algorithm.Meanwhile,the convergence speed was increased by more than 38% compared with the DQN(deep q-network)algorithm.

Key words: LEO constellation, beam scheduling, task planning, DRL, A2C algorithm