We present the first optimal algorithms for swath segment scheduling for orbiting spacecraft. We present a comparison between an integer program formulation and a branch and bound formulation that makes use of a flow network transformation, each capable of solving instances of these problems optimally. We also compare our techniques with the current state of the practice: the Aster scheduling algorithm. No technique strictly dominates all others, and we characterize their respective advantages and disadvantages. Note that this problem is NP-complete. The primary goal of our work is to solve the largest swath problems possible, both quickly, and where feasible, optimally.
Solving swath problems optimally
2006-01-01
964910 byte
Conference paper
Electronic Resource
English
Optimally Solving Nadir Observation Scheduling Problems
British Library Conference Proceedings | 2005
|Optimally solving nadir observation scheduling programs
NTRS | 2005
|Automotive engineering | 1985
|SCHIFFBAU - SWATH-Schiffe - Entwurf von SWATH-Schiffen
Online Contents | 2003