Abstract
In recent years, China has been scheduled to launch an all-sky survey telescope for celestial observation. The meticulous arrangement of observation sequences for this telescope is of paramount importance, given the myriad challenges and constraints inherent to such astronomical survey missions. These challenges encompass factors such as spatial limitations, stray light contamination, as well as constraints related to data storage and energy consumption. This undertaking presents a quintessential NP-hard optimization problem. To address this complexity and enhance in-orbit observation efficiency, this study closely adheres to practical engineering considerations. A comprehensive evaluation of diverse constraints is conducted, culminating in the establishment of an optimization model for systematic planning of sky survey missions. The primary optimization objectives encompass maximizing in-orbit observation duration, augmenting the count of observable celestial points, and minimizing maneuvering angles. To tackle this multifaceted problem, a mission planning algorithm is devised based on NSGA-III, a multi-objective optimization technique. The experimental results indicate that the sky survey planning algorithm proposed in this paper can effectively accomplish sky survey observation tasks, achieving the scientific objective of no fewer than 350 daily observation points. It holds the potential to provide algorithmic support for the sky survey telescope mission on the Chinese space station.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.