<p>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.</p> <p> </p>
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.