Abstract: Disclosed is a method for task planning of a space information network based on resource interchange. The method includes: initializing basic parameters of the space information network; dividing a planning horizon into K time slots of equal length, and constructing a resource time-varying graph for the space information network; sampling a feasible resource combination space of each task, and obtaining a candidate resource combination set comprised of the resource combinations with independence greater than or equal to a threshold n; calculating a conflict relation between resource combinations, and constructing a resource combination conflict graph; obtaining a maximum independent set of the resource combination conflict graph to obtain a global planning result; and searching a neighborhood of the global planning result, and completing a local adjustment of a task planning scheme through the resource interchange, to complete the task planning based on characteristics of the resource interchange.

Abstract: Disclosed is a method for task planning of a space information network based on resource interchange. The method includes: initializing basic parameters of the space information network; dividing a planning horizon into K time slots of equal length, and constructing a resource time-varying graph for the space information network; sampling a feasible resource combination space of each task, and obtaining a candidate resource combination set comprised of the resource combinations with independence greater than or equal to a threshold n; calculating a conflict relation between resource combinations, and constructing a resource combination conflict graph; obtaining a maximum independent set of the resource combination conflict graph to obtain a global planning result; and searching a neighborhood of the global planning result, and completing a local adjustment of a task planning scheme through the resource interchange, to complete the task planning based on characteristics of the resource interchange.