Abstract: The development of distributed satellite systems brings challenges to mission planning. The traditional centralized mission planning methods are increasingly difficult to meet the needs of large number of satellites, dynamic mission, and large mission volume. At the same time, centralized methods also have the disadvantage of insufficient robustness. Combining actual engineering constraints and application requirements, this paper designs a dynamic mission planning algorithm for distributed satellite systems based on greedy algorithm and contract network for the limited conditions of communication networks, and evaluates the effectiveness of the algorithm for typical application scenarios. The simulation verification and analysis show that the task completion degree and communication requirements of the algorithm are significantly lower than those of the traditional contract network algorithm.

Key words: distributed satellite system, dynamic network, dynamic mission planning, contract network