Satellite mission scheduling algorithm based on GA

Sun, Baolin; Mao, Lifei; Wang, Wenxiang; Xie, Xing; Qin, Qianqing

doi:10.1117/12.772982

Cited by 3 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Numerous studies have been developed on scheduling EOSs, and most of them concentrated on the single-satellite problem. This problem can be generalized or converted to more common problems, such as a single-machine scheduling problem [16,17], a network flow problem [18], the knapsack problem [19][20][21][22], dynamic programming [10,23], or constraint programming [7,10,24,25]. Many previous studies use suboptimal algorithms.…”

Section: Literature Reviewmentioning

confidence: 99%

“…If θ jw j;s;k is 1, the task is scheduled to be completed before the end time of a time window and 0 otherwise. Constraints (16) variable x O j;s;k equals 1 both support variables θ wj j;s;k and θ jw j;s;k should be true. Figure 5 shows a simple example of a situation with three observation tasks having different processing times for the model described previously.…”

Section: Observation Task Scheduling: Unrestricted Data and Energy Constraints From Constellation Mission Schedulingmentioning

confidence: 99%

“…For simplicity, every i s ∈ I s is sorted in a time-ascending order, i.e., t i s ≤ t i s 1 , ∀i s , s ∈ S. There is a one-to-one correspondence between the end time of i s and one of the due times δ O j;s;k , δ D s;k , or δ E s;k . The constellation mission scheduling can be structured based on the observation scheduling model and adding the constraints (10)(11)(12)(13)(14)(15)(16)…”

Section: Constellation Mission Schedulingmentioning

confidence: 99%

See 2 more Smart Citations

Optimization-Based Scheduling Method for Agile Earth-Observing Satellite Constellation

Cho

Kim

Choi

et al. 2018

Journal of Aerospace Information Systems

View full text Add to dashboard Cite

This Paper proposes a two-step binary linear programming formulation for task scheduling of a constellation of low-Earth-orbit satellites and demonstrates its applicability and scalability to obtain high-quality solutions using a standard mixed-integer linear programming solver. In this instance, the goal of satellite constellation task scheduling is to allocate each task for the satellites and to determine the task starting times in order to maximize the overall mission performance metric. The scheduling problem is formulated to find the solution by first finding a set of candidate communication time intervals for each satellite/ground-station pair as one of the key constraints and time tabling the observation task to acquire the user-requested data, with the incorporation of key constraints for satellite constellation operation. Numerical experiments are designed for investigating the trends, sensitivity, and characteristics of scheduling outputs based on multiple representative instances. The performance of the scheduling solutions by the proposed two-step binary linear programming method exhibits significant improvement of up to 35% in the number of assignments and the sum of profits over the general greedy algorithm.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Observation Task Scheduling: Unrestricted Data and Energy Constraints From Constellation Mission Schedulingmentioning

confidence: 99%

Section: Constellation Mission Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

Optimization-Based Scheduling Method for Agile Earth-Observing Satellite Constellation

Cho

Kim

Choi

et al. 2018

Journal of Aerospace Information Systems

View full text Add to dashboard Cite

show abstract

“…Chu et al [11] have used branch demarcation to effectively solve the real-time scheduling problem of the dual agile satellite system, and the autonomous scheduling method of clustering is likely to be a research direction in the future. Some other studies have analyzed the online scheduling problem from the theoretical level, developed the scheduling framework, and proposed corresponding methods [12,13]. These studies have taken into account the online scheduling of routine observation tasks, but they paid less attention to the reprogramming of emergency tasks [14,15].…”

Section: Introductionmentioning

confidence: 99%

An emergency task autonomous planning method of agile imaging satellite

Song

Huang

Zhou

et al. 2018

J Image Video Proc.

View full text Add to dashboard Cite

As the number of satellite emergency imaging tasks grows, the main goal of satellites becomes putting forward solutions and meeting users' demands in a relatively short time. This study aims to investigate the problem of emergency task planning for agile satellites. Through the analysis of the problem and its constraints, a model of emergency task autonomous planning was implemented. According to the characteristics of emergency tasks, a strategy to deal with the tasks of different emergency levels and various quantities was proposed. We put forward three algorithms for quick insertion of emergency tasks, i.e., emergency task insertion algorithm (ETIA), general emergency task insertion algorithm (GETIA), and general emergency task planning &insertion algorithm (GETPIA). The experimental result showed that the strategy and algorithms can not only respond quickly to observation tasks but also produce effective planning programs to ensure the successful completion of observation tasks.

show abstract