卫星围绕地球运行,若在一个时间段内,多颗卫星经过多个地面站形成数据接收冲突时,如何安排卫星下传数据和地面站接收数据的时间,这就是多星多站数据接收规划问题.首先将该问题归结为针对矩阵的一种变换,然后以数据接收总时长最大为目标建立了模型.接着给出了最优解的性质并予以证明.最后用贪婪算法进行了求解和分析.利用STK仿真多星过站情况.计算结果表明贪婪算法求解结果达到理论最优值上限的90％以上,故该模型和算法效果良好.%Satellite data transmission planning of multi-satellite and multi-station is how to allocate the time of satellites and grand stations when one of the follow cases happens: A) a satellite could access several grand stations , or B) a grand station could be accessed by several satellites, even C) the mixture of case A) and B) . The problem is viewed as a matrix transform firstly, and each matrix element is a time windows' set which belongs a pair of satellite and grand station. The model is built on matrix secondly. The feature of optimum value is found and proved thirdly. Lastly, the greedy algorithm is applied to solve the model. The simulation result shows that the greedy algorithm is more than 90% of the upper threshold of optimum value.
展开▼
