Integrated agile observation satellite scheduling problem considering different memory environments: a case study

Abstract

This paper presents an experimental study on an integrated agile earth observation satellite (AEOS) scheduling problem involving the satellite memory environments of the partially erasable memory (PEM) and the holistically erasable memory (HEM). The integrated AEOS scheduling problem simultaneously considers the satellite observation and transmission events, in which the onboard memory functions as a very important connective resource. To address the memory constraints in the AEOS scheduling problem, an integrated AEOS scheduling model that is suitable for both the PEM and HEM environments is proposed in this paper. Based on commonly used construction heuristic and meta-heuristics, two hybrid approaches, Tabusimulated annealing (TSA) and Tabu late acceptance (TLA) algorithms, are adopted to solve this problem. The highlights in this paper are the formulation of novel adaptive memory constraints for the AEOS scheduling and the quantitatively scheduling comparison of separated and integrated modeling methods. Experimental results indicate that (1) the memory environment has a direct influence on the AEOS integrated scheduling results, where the PEM environment sufficiently utilizes memory resources and advances the efficiency of the AEOS a lot. (2) The integrated scheduling method enables the reduction in resource consumption and obtains a better result than the separated scheduling method, especially in the HEM environment, (3) and the hybrid meta-heuristics TLA and TSA that show better overall performance are suggested for addressing the studied AEOS integrated scheduling problem.

Multi-satellite Mission Planning Algorithm Based on Preemptive Priority Model

“…Moreover, the increase in the dimensionality of the search space as the problem size increases leads to a sharp increase in the model solving time [15]. Heuristic algorithms are widely used for solving satellite mission planning problems owing to their excellent complex state-space seeking capability [16][17][18][19][20][21]. Among them, the tabu search algorithm has the characteristic of fast optimization and is one of the common heuristics used in recent years in the field of mission planning [22][23][24].…”

A reverse chain search algorithm for the resource constraint in deep space detectors

“…Nonetheless, the absence of comparative analysis with other algorithms limits the extent to which the superiority of the proposed algorithm's performance can be demonstrated. Du et al (2020) established satellite scheduling models based on partial and whole erasable memories and proposed combining tabu simulated annealing integrated with taboo late acceptance to improve the accuracy of the solutions for the algorithm. Chen et al (2021) established a multi-objective mathematical model based on maximizing benefits and efficiency, simplifying the expression of problems.…”

Tourism route optimization based on improved knowledge ant colony algorithm

“…To be specific, the concentration of the route planning of tourist attractions is designed to search the set of tourist groups corresponding to each tourism route, which aims to maximize tourist satisfaction. The exploration of the problem can solve a series of route planning problems, for example, routes entailing irregular travel, turning back, and repeating routes such as are found in logistics distribution [3], military command, satellite scheduling [4], robot travel, and propagation and navigation exercises. Therefore, solving the route planning problem for tourist attractions exerts practical and guidance significance on other similar problems.…”