Published 2006
| Published
Book Section - Chapter
Open
Solving Swath Problems Optimally
- Creators
-
Knight, Russell
Abstract
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.
Additional Information
© 2006 IEEE. Date of Current Version: 14 August 2006. This research was carried out at the Jet Propulsion Laboratory, California Institute of Technology, under a contract with the National Aeronautics and Space Administration. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise, does not constitute or imply its endorsement by the United States Government or the Jet Propulsion Laboratory, California Institute of Technology.Attached Files
Files
Knight2006p9448Smc-It_2006_2Nd_Ieee_International_Conference_On_Space_Mission_Challenges_For_Information_Technology_Proceedings.pdf
Files
(966.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:2a2e75ab46e94bcab53837bc729df985
|
966.9 kB | Preview Download |
Additional details
- Eprint ID
- 22515
- Resolver ID
- CaltechAUTHORS:20110225-092249748
- NASA
- Created
-
2011-02-25Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 9076272