Moon Search Algorithms for NASA's Dawn Mission to Asteroid Vesta
Nargess Memarsadeghi, Lucy A. McFadden, David Skillman, Brian McLean,, Max Mutchler, Uri Carsenty, Eric E. Palmer, and the Dawn Mission's Satellite, Working Group

TL;DR
This paper discusses computational methods and tools used in searching for natural satellites around asteroid Vesta during NASA's Dawn mission, aiming to enhance satellite detection techniques for future missions.
Contribution
It introduces the satellite search problem, reviews computational challenges and approaches, and shares applications of image processing algorithms for satellite detection in space missions.
Findings
Development of image processing algorithms for satellite detection
Identification of computational challenges in satellite search
Application of tools to improve satellite search accuracy
Abstract
A moon or natural satellite is a celestial body that orbits a planetary body such as a planet, dwarf planet, or an asteroid. Scientists seek understanding the origin and evolution of our solar system by studying moons of these bodies. Additionally, searches for satellites of planetary bodies can be important to protect the safety of a spacecraft as it approaches or orbits a planetary body. If a satellite of a celestial body is found, the mass of that body can also be calculated once its orbit is determined. Ensuring the Dawn spacecraft's safety on its mission to the asteroid (4) Vesta primarily motivated the work of Dawn's Satellite Working Group (SWG) in summer of 2011. Dawn mission scientists and engineers utilized various computational tools and techniques for Vesta's satellite search. The objectives of this paper are to 1) introduce the natural satellite search problem, 2) present…
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.
