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

Authors:
Pei Wang;Gerhard Reinelt;Peng Gao;Yuejin Tan
Affiliations:
College of Information Systems and Management, National University of Defense Technology, 47 Yanzheng Street, Changsha 410073, Hunan, China and Group of Discrete and Combinatorial Optimization, Un ...;Group of Discrete and Combinatorial Optimization, University of Heidelberg, Im Neuenheimer Feld 368, 69120 Heidelberg, Germany;College of Information Systems and Management, National University of Defense Technology, 47 Yanzheng Street, Changsha 410073, Hunan, China;College of Information Systems and Management, National University of Defense Technology, 47 Yanzheng Street, Changsha 410073, Hunan, China
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 6
Cited 3

A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite

Computational Optimization and Applications
Earth Observation Satellite Management

Constraints
An Autonomous Earth-Observing Sensorweb

IEEE Intelligent Systems
An earth watching satellite constellation: how to manage a team of watching agents with limited communications

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Graph colouring approaches for a satellite range scheduling problem

Journal of Scheduling
AFSCN scheduling: How the problem and solution have evolved

Mathematical and Computer Modelling: An International Journal

A two-phase scheduling method with the consideration of task clustering for earth observing satellites

Computers and Operations Research
Consensus-based decision support for multicriteria group decision making

Computers and Industrial Engineering
Genetic algorithms for satellite scheduling problems

Mobile Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

China plans to launch four small optical satellites and four small SAR satellites to form a natural disaster monitoring constellation. Data can be obtained by the constellation in all weather conditions for disaster alert and environmental damage analysis. The scheduling problem for the constellation consists of selecting and timetabling the observation activities to acquire the requested images of the earth surface and scheduling the download activities to transmit the image files to a set of ground stations. The scheduling problem is required to be solved every day in a typical 1-day horizon and it must respect complex satellite operational constraints as well as request preferences, such as visibility time windows, transition time between consecutive observations or downloads, memory capacity, energy capacity, polygon target requests and priorities. The objective is to maximize the rewards of the images taken and transmitted. We present a nonlinear model of the scheduling problem, develop a priority-based heuristic with conflict-avoided, limited backtracking and download-as-needed features, which produces satisfactory feasible plans in a very short time. A decision support system based on the model and the heuristic is also provided. The system performance shows a significant improvement with respect to faster and better scheduling of an earth observing satellite constellation.