Abstract:

It is important to improve the efficiency of electronic reconnaissance satellites by means of tasks merging and detecting together. The condition and correlative character of tasks merging and detecting are analyzed, and the corresponding mixed integer programming model for satellites scheduling problems is formulated. Then an optimization algorithm based on model decomposition is proposed for solving the scheduling problem. The model is decomposed into a task assignment main problem and a dynamic tasks merging sub-problem. In task assignment phase, the tasks are allocated to the satellites by a genetic algorithm,and each satellite would schedule the task respectively in dynamic tasks merging phase to construct a complete schedule. Computation results show that the approach is effective to the electronic reconnaissance satellites scheduling problem.