Abstract Existing literature has provided several different suboptimal algorithms for the Satellite Range Scheduling problem. The authors present a precise mathematical definition of the problem, and provide a detailed classification of different variants of the problem. Compared to previous publications by the authors, this chapter provides better definitions of a number of the classification terms, additional examples for illustrating the mathematical model, and new results on the complexity of some of the variants of the problem. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)
The Satellite Range Scheduling Problem
2015-01-01
27 pages
Article/Chapter (Book)
Electronic Resource
English
Noncooperative Satellite Range Scheduling
Springer Verlag | 2015
|Reactive Satellite Range Scheduling
Springer Verlag | 2015
|Robust Satellite Range Scheduling
Springer Verlag | 2015
|Optimal Satellite Range Scheduling
Springer Verlag | 2015
|Robust fixed interval satellite range scheduling
IEEE | 2015
|