The Satellite Mission Scheduling problem (SMS) involves scheduling tasks to be performed by a satellite, where new task requests can arrive at any time, non-deterministically, and must be scheduled in real-time. This paper describes a new Satellite Mission Scheduling problem based on Genetic Algorithm (SMSGA). In this paper, it investigates algorithmic approaches for determining an optimal or near-optimal sequence of tasks, allocated to a satellite payload over time, with dynamic tasking considerations. The simulation results show that the proposed approach is effective and efficient in applications to the real problems.

Date Published: 10 November 2007
PDF: 6 pages
Proc. SPIE 6795, Second International Conference on Space Information Technology, 67950U (10 November 2007); doi: 10.1117/12.772982

Published in SPIE Proceedings Vol. 6795:
Second International Conference on Space Information Technology
Cheng Wang; Shan Zhong; Jiaolong Wei, Editor(s)