Daily imaging scheduling of an Earth observation satellite

Authors:
Wei-Cheng Lin;Da-Yin Liao;Chung-Yang Liu;Yong-Yao Lee
Affiliations:
Electr. Eng. Dept., Nat. Taiwan Univ., Taipei, Taiwan;-;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Year:
2005

Citing 0
Cited 6

A multi-objective imaging scheduling approach for earth observing satellites

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Simulation based multi-objective extremal optimization algorithm for electronic reconnaissance satellites scheduling problem

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Strong formulation for the spot 5 daily photograph scheduling problem

Journal of Combinatorial Optimization
A Lagrangian heuristic for satellite range scheduling with resource constraints

Computers and Operations Research
Mobile user data mining: mining relationship patterns

EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
A two-phase scheduling method with the consideration of task clustering for earth observing satellites

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents the development of a daily imaging scheduling system for a low-orbit, Earth observation satellite. The daily imaging scheduling problem of satellite considers various imaging requests with different reward opportunities, changeover efforts between two consecutive imaging tasks, cloud-coverage effects, and the availability of the spacecraft resource. It belongs to a class of single-machine scheduling problems with salient features of sequence-dependent setup, job assembly, and the constraint of operating time windows. The scheduling problem is formulated as an integer-programming problem, which is NP-hard in computational complexity. Lagrangian relaxation and linear search techniques are adopted to solve this problem. In order to demonstrate the efficiency and effectiveness of our solution methodology, a Tabu search-based algorithm is implemented, which is modified from the algorithm in Vasquez and Hao, 2001. Numerical results indicate that the approach is very effective to generate a near-optimal, feasible schedule for the imaging operations of the satellite. It is efficient in applications to the real problems. The Lagrangian-relaxation approach is superior to the Tabu search one in both optimality and computation time.