Agile earth observation satellite scheduling: An orienteering problem with time-dependent profits and travel times

Peng, Guansheng; Dewil, Reginald; Verbeeck, Cédric; Gunawan, Aldy; Xing, Lining; Vansteenwegen, Pieter

doi:10.1016/j.cor.2019.05.030

Cited by 64 publications

(45 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, we prove that the "time slack" can only be used when the transition time follows the FIFO rule which will be explained in detail in Section III-B1. In a recent work [1], a "minimal transition time" is introduced to replace the actual transition time based on the condition of the FIFO rule. On this basis, they present an Iterative Local Search algorithm to address the scheduling problem with the time-dependent profits, which is different with our scheduling problem with constant profits.…”

Section: Literature Reviewmentioning

confidence: 99%

“…These results motivate us to design an effective heuristic for the scheduling problem. We develop a hybrid heuristic based on the "minimal transition time" [1] to address the time-dependent transition time, and embed an assignment procedure to tackle the multiorbit uniqueness constraint. The presented algorithm is compared with the state-of-the-art algorithm, the ALNS algorithm [5], on single satellite instances.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Generally, if the angular velocity is constant, the triangle inequalities are always satisfied since ∆g ij ≤ (∆g im + ∆g mj ), where ∆g ij are the change of look angles from i to j. However, in practice, the angular velocity varies depending on the absolute value of the change of look angles, as can be seen in equation (1). The utilization of different angular velocities relative to different changes of look angles stems from the design of the maneuvering system that a larger change of look angles can be transited by a faster maneuvering engine in order to reduce the transition time.…”

Section: B Modeling Of Transition Timementioning

confidence: 99%

“…3) Minimal transition time: Based on the analysis of the time-dependent transition time, the "minimal transition time" [1] can be used to replace the actual transition time. The minimal transition time allows the next observation to happen as early as possible when the start time of the previous observation is given.…”

Section: B Modeling Of Transition Timementioning

confidence: 99%

“…T HE mission of an Earth Observation Satellite (EOS) is to photograph targets on the surface of the Earth, according to the requests from users. EOSs play an increasingly crucial role in many applications, such as resource exploration, disaster alerts, climate change analysis and so on [1]. Due to the huge cost of satellites, the scheduling of EOSs is of great importance for the effectiveness of the observation systems.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Solving the Agile Earth Observation Satellite Scheduling Problem With Time-Dependent Transition Times

Peng

Song

et al. 2022

IEEE Trans. Syst. Man Cybern, Syst.

Self Cite

View full text Add to dashboard Cite

The scheduling of Agile Earth Observation Satellites is to select a subset of candidate targets each associated with a profit during their visible time windows in order to maximize the collected profits, under some operational constraints. For each pair of two consecutive observations, a transition time is required to perform a rotating movement of the camera, depending on the start times of the two observations. This time-dependency significantly increases the complexity of the scheduling problem. To solve this problem efficiently, we model the time-dependent transition time and prove that it satisfies the First-In-First-Out rule and the triangle inequalities rule. On this basis, we develop a novel hybrid heuristic, called "Greedy Randomized Iterated Local Search" (GRILS). A specific insert operator including a fast feasibility check and an assignment procedure are specifically designed to address the operational constraints of the scheduling. Extensive experiments on the single satellite instances and multi-satellite instances demonstrate that our algorithm outperforms the state-of-the-art algorithms with respect to solution quality and computation time. Index Terms-time-dependent transition time, satellite scheduling, GRILS heuristic.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: B Modeling Of Transition Timementioning

confidence: 99%

Section: B Modeling Of Transition Timementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations