Daily imaging scheduling of an Earth observation satellite

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, cl...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on systems, man and cybernetics. Part A, Systems and humans man and cybernetics. Part A, Systems and humans, 2005-03, Vol.35 (2), p.213-223
Main Authors: Lin, W.-C., Liao, D.-Y., Liu, C.-Y., Lee, Y.-Y.
Format: Article
Language:English
Subjects:
Algorithms
Artificial satellites
Assembly
Availability
Computation
Computational complexity
Earth
Earth observation satellite
Heuristic
Imaging
Lagrangian functions
Lagrangian relaxation
Processor scheduling
Remote sensing
satellite scheduling
Satellites
Scheduling
Searching
Single machine scheduling
Space vehicles
Studies
Time factors
Windows (intervals)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1083-4427
2168-2216
1558-2426
2168-2232
DOI:10.1109/TSMCA.2005.843380