Research on Task Planning Problem of Satellite-Ground Time Synchronization

摘要

The task planning of satellite-ground time synchronization (SGTSTP) is a complex multi-objective ground station scheduling problem. In this paper, we establish the problem formulation and analyze the optimization objectives. Based on the complexity analysis, we design a solving framework based on decomposition, which divides the plan horizon into many un-interactional plan periods and execute task planning in each period. In algorithm selection, the MOGA and NSGA2 are selected. At last, two different scale scenarios are designed and the computational result shows that more periods can get better result but spend more time, besides, the MOGA has better performance in efficiency and effect than NSGA2, however NSGA2 can get more solutions in solving SGTSTP.