Share Email Print
cover

Proceedings Paper

Satellite mission scheduling algorithm based on GA
Author(s): Baolin Sun; Lifei Mao; Wenxiang Wang; Xing Xie; Qianqing Qin
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

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
Show Author Affiliations
Baolin Sun, Wuhan Univ. (China)
Hubei Univ. of Economics (China)
Lifei Mao, Huazhong Univ. of Science and Technology (China)
Wenxiang Wang, Wuhan Univ. (China)
Xing Xie, Wuhan Univ. (China)
Qianqing Qin, Wuhan Univ. (China)


Published in SPIE Proceedings Vol. 6795:
Second International Conference on Space Information Technology

© SPIE. Terms of Use
Back to Top