Regular Space TT&C Mission Planning Based on Hierarchical Progress in Space Information Networks

With the development of space missions and the diversity of satellites, space information networks have become more complex. Space TT&C (Tracking Telemetry and Command) missions are faced with shortage of resources and complex demand characteristics. In view of these challenges, we propose a hierarchical progressive TT&C mission planning algorithm. Firstly, we model the TT&C mission planning problem as a mixed integer linear programming problem with aiming at maximizing the network reward, i.e., the weighted number of completed TT&C missions. Then, we decompose this problem into multiple levels of optimization sub-problems according to the types of constraints and use time buckets and binary conflict trees to reduce the complexity of the algorithm. Finally, we use the binary conflict tree to perform local disturbances Simulation results show that, compared with the existing planning algorithms, the proposed algorithm not only guarantees the efficiency of the algorithm, but also improves the total reward of TT&C mission planning.