Abstract | ||
---|---|---|
Purpose - The purpose of this paper is to describe a new satellite mission scheduling (SMS) problem based on an genetic algorithm (GA). Design/methodology/approach - The SMS involves scheduling tasks to be performed by a satellite, where new task requests can arrive non-deterministically (i.e. at any time) and must be scheduled in real-time. This paper investigates algorithmic approaches for determining an optimal or near-optimal sequence of tasks, allocated to a satellite payload over time, with dynamic tasking considerations. Findings - Simulation results show that the proposed approach is effective and efficient when utilized in actual cases. Originality/value - This paper shows how to adopt the GA search approach to generate an SMS within allowable computation time. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1108/03684921011063538 | KYBERNETES |
Keywords | Field | DocType |
Artificial satellites,Programming and algorithm theory,Real time scheduling,Task analysis,Cybernetics | Satellite,Task analysis,Computer science,Scheduling (computing),Real-time computing,Cybernetics,Genetic algorithm,Computation,Payload,Distributed computing | Journal |
Volume | Issue | ISSN |
39 | 8 | 0368-492X |
Citations | PageRank | References |
16 | 0.88 | 10 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Baolin Sun | 1 | 67 | 11.74 |
Wenxiang Wang | 2 | 18 | 1.28 |
Xing Xie | 3 | 16 | 0.88 |
Qianqing Qin | 4 | 58 | 10.53 |