Aiming at the problems of high time-consuming and insufficient guarantee of high-priority task completion in the large-scale multi-satellite multi-observation mission planning application, a multi-satellite multi-mission planning model based on preemptive priority model is proposed. Combined with the whole-neighborhood greedy search strategy, an improved tabu search algorithm is designed, taking the combination of satellite observation windows as the decision variables. The designed algorithm realizes an efficient solver to the proposed mission planning model. The simulation results show that the average solving time of the algorithm is 144s under the problem scale of 100 satellites and 3000 tasks. Compared with the existing algorithm, the calculation time is shortened by at least 75% under the premise that the total number of planning tasks is comparable, which is more in line with the high time efficiency requirements for satellite mission planning in engineering applications.
本站僅提供期刊文獻檢索。
