Improving science yield for NASA Swift with automated planning technologies
Aaron Tohuvavohu

TL;DR
This paper formalizes the scheduling challenge of the Swift mission as a dynamic fuzzy constraint satisfaction problem and explores advanced optimization, machine learning, and neural network methods to automate and improve scheduling quality.
Contribution
It introduces a formal model for the Swift scheduling problem and investigates novel algorithmic and machine learning approaches to surpass human scheduling performance.
Findings
Formalized Swift scheduling as a DF-CSP
Explored classical and machine learning optimization techniques
Discussed potential for increased scientific yield
Abstract
The Swift Gamma-Ray Burst Explorer is a uniquely capable mission, with three on-board instruments and rapid slewing capabilities. It serves as a fast-response satellite observatory for everything from gravitational-wave counterpart searches to cometary science. Swift averages 125 different observations per day, and is consistently over-subscribed, responding to about one-hundred Target of Oportunity (ToO) requests per month from the general astrophysics community, as well as co-pointing and follow-up agreements with many other observatories. Since launch in 2004, the demands put on the spacecraft have grown consistently in terms of number and type of targets as well as schedule complexity. To facilitate this growth, various scheduling tools and helper technologies have been built by the Swift team to continue improving the scientific yield of the Swift mission. However, these tools have…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
