A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation

Wang, Pei; Reinelt, Gerhard; Gao, Peng; Yue-jin, Tan

doi:10.1016/j.cie.2011.02.015

Cited by 162 publications

(80 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Wang (2010) [18] proposed a heuristic method for the earth observing satellite constellation scheduling problem, taking download operation into consideration. Chen et al (2012) [5] have researched a multi-satellite observation scheduling algorithm using Particle Swarm Optimization (PSO).…”

Section: Introductionmentioning

confidence: 99%

Mission scheduling optimization of SAR satellite constellation for minimizing system response time

Kim

Chang

2015

Aerospace Science and Technology

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Mission scheduling optimization of SAR satellite constellation for minimizing system response time

Kim

Chang

2015

Aerospace Science and Technology

View full text Add to dashboard Cite

“…The intelligent optimization algorithms, such as the Tabu search algorithm (Bianchessi et al, 2007), the genetic algorithm (Mansour and Dessouky, 2010;Niu et al, 2015), the evolutionary algorithm (Wang et al, 2007), simulated annealing, the Lagrangian relaxation technique (Lin et al, 2005), and the hybrid ant colony optimization method (Wu et al, 2013;Zhang et al, 2014), can be used to obtain near-optimal solutions for large size problems. In addition, rulebased heuristic algorithms were also designed to solve the satellite scheduling (Hall and Magazine, 1994;Wang et al, 2011;Zhai et al, 2015). The rule-based heuristic methods are more flexible to obtain satisfactory solutions.…”

Section: Introductionmentioning

confidence: 99%

Multi-Satellite Scheduling Approach for Dynamic Areal Tasks Triggered by Emergent Disasters

Niu

Zhai

Tang

et al. 2016

Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci.

View full text Add to dashboard Cite

ABSTRACT:The process of satellite mission scheduling, which plays a significant role in rapid response to emergent disasters, e.g. earthquake, is used to allocate the observation resources and execution time to a series of imaging tasks by maximizing one or more objectives while satisfying certain given constraints. In practice, the information obtained of disaster situation changes dynamically, which accordingly leads to the dynamic imaging requirement of users. We propose a satellite scheduling model to address dynamic imaging tasks triggered by emergent disasters. The goal of proposed model is to meet the emergency response requirements so as to make an imaging plan to acquire rapid and effective information of affected area. In the model, the reward of the schedule is maximized. To solve the model, we firstly present a dynamic segmenting algorithm to partition area targets. Then the dynamic heuristic algorithm embedding in a greedy criterion is designed to obtain the optimal solution. To evaluate the model, we conduct experimental simulations in the scene of Wenchuan Earthquake. The results show that the simulated imaging plan can schedule satellites to observe a wider scope of target area. We conclude that our satellite scheduling model can optimize the usage of satellite resources so as to obtain images in disaster response in a more timely and efficient manner.

show abstract

“…Most of the literature on satellite mission planning is divided into two categories: optical satellites [1][2][3][4] and Synthetic Aperture Radar (SAR) satellites [5][6][7][8][9][10][11][12]. The satellite image acquisition and image downlink are two main scheduling problems in satellite mission planning.…”

Section: Introductionmentioning

confidence: 99%

“…Downlink also can be classified into two ways: (1) the observed images are transmitted to the ground station in real time when the observation target and the ground station are simultaneously visible to the satellite; (2) first store observed images in the onboard memory and then transmit data to the ground station when the satellite is passing. Discrete Dynamics in Nature and Society SIDSP and its variations have been studied by many authors, mainly divided into single-satellite problems [10][11][12] and multisatellite problems [1,3,[5][6][7][8][9]. Single-satellite problem deals with the resource contention for satellite internal requests, while multisatellite problem should also take the resource contention for requests from different satellites into consideration.…”

Section: Introductionmentioning

confidence: 99%

“…The solving methods are mainly divided into three categories: (1) exact solution algorithms (e.g., mixed integer programming [13], dynamic programming [14], and branch and bound algorithm [15]); (2) heuristic algorithms (e.g., a priority-based heuristic [3], an ejection-chain heuristic [11], and a Lagrangian heuristic [16]); (3) metaheuristic algorithms (e.g., simulated annealing [12], tabu search [12,17], and genetic algorithm [18]). The performance of these solving methods is measured through the instances with varied size and complexity.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Hybrid Genetic Algorithm for Satellite Image Downlink Scheduling Problem

Song

Yao

Chen

et al. 2018

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

The satellite image downlink scheduling problem (SIDSP) is included in satellite mission planning as an important part. A customer demand is finished only if the corresponding images are eventually downloaded. Due to the growing customer demands and the limited ground resources, SIDSP is an oversubscribed scheduling problem. In this paper, we investigate SIDSP with the case study of China's commercial remote sensing satellite constellation (SuperView-1) and exploit the serial scheduling scheme for solving it. The idea is first determining a permutation of the downlink requests and then producing a schedule from the given ordered requests. A schedule generation algorithm (SGA) is proposed to assign the downlink time window for each scheduled request according to a given request permutation. A hybrid genetic algorithm (HGA) combined with neighborhood search is proposed to optimize the downlink request permutation with the purpose of maximizing the utility function. Experimental results on six groups of instances with different density demonstrate the effectiveness of the proposed approach.

show abstract

A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation

Cited by 162 publications

References 12 publications

Mission scheduling optimization of SAR satellite constellation for minimizing system response time

Mission scheduling optimization of SAR satellite constellation for minimizing system response time

Multi-Satellite Scheduling Approach for Dynamic Areal Tasks Triggered by Emergent Disasters

A Hybrid Genetic Algorithm for Satellite Image Downlink Scheduling Problem

Contact Info

Product

Resources

About