The concept of ground station networks evolved in the recent years in many different fields as a reasonable tool for satellite applications. Especially in the field of academic ground station networks, grown from small satellite projects at universities all over the world, new innovative ideas were developed to enhance the operation of small low earth orbit satellites. One important aspect, which has not been considered so far, is an essential difference between academic networks and classical ground station networks with respect to scheduling requirements . These differences are mainly conducted by the architecture and non-commercial character of academic networks, resulting in different scheduling requirements like flexibility and redundant scheduling. This work defines a mathematical description of the scheduling problem appearing in academic ground station networks, referred as the Redundant Request Satellite Scheduling (RRSS) problem. Furthermore important differences compared to the classical problem formulation are elaborated. Additionally the paper introduces a new scheduling approach tailored for the special needs of this problem.
[1]
L. Darrell Whitley,et al.
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
,
2004,
J. Sched..
[2]
Adele E. Howe,et al.
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
,
2006,
J. Artif. Intell. Res..
[3]
T. L. Reguianski.
The Air Force Institute of Technology
,
1962
.
[4]
Shinichi Nakasuka,et al.
Ground Station Network to Improve Operation Efficiency of Small Satellites and Its Operation Scheduling Method
,
2006
.
[5]
L. Darrell Whitley,et al.
Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search
,
2002,
PPSN.
[6]
Al Globus,et al.
A Comparison of Techniques for Scheduling Earth Observing Satellites
,
2004,
AAAI.
[7]
S. M. Schalck.
Automating Satellite Range Scheduling
,
1993
.