首页|Dynamic access task scheduling of LEO constellation based on space-based distributed computing
Dynamic access task scheduling of LEO constellation based on space-based distributed computing
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
万方数据
维普
A dynamic multi-beam resource allocation algorithm for large low Earth orbit(LEO)constellation based on on-board distributed computing is proposed in this paper.The allocation is a combinatorial optimization process under a series of complex constraints,which is important for enhancing the matching between resources and requirements.A complex algorithm is not available because that the LEO on-board resources is limi-ted.The proposed genetic algorithm(GA)based on two-dimen-sional individual model and uncorrelated single paternal inheri-tance method is designed to support distributed computation to enhance the feasibility of on-board application.A distributed system composed of eight embedded devices is built to verify the algorithm.A typical scenario is built in the system to evalu-ate the resource allocation process,algorithm mathematical model,trigger strategy,and distributed computation architec-ture.According to the simulation and measurement results,the proposed algorithm can provide an allocation result for more than 1 500 tasks in 14 s and the success rate is more than 91％in a typical scene.The response time is decreased by 40％com-pared with the conditional GA.
万方数据
维普
