Abstract
A new star recognition method based on the Adaptive Ant Colony (AAC) algorithm has been developed to increase the star recognition speed and success rate for star sensors. This method draws circles, with the center of each one being a bright star point and the radius being a special angular distance, and uses the parallel processing ability of the AAC algorithm to calculate the angular distance of any pair of star points in the circle. The angular distance of two star points in the circle is solved as the path of the AAC algorithm, and the path optimization feature of the AAC is employed to search for the optimal (shortest) path in the circle. This optimal path is used to recognize the stellar map and enhance the recognition success rate and speed. The experimental results show that when the position error is about 50″, the identification success rate of this method is 98% while the Delaunay identification method is only 94%. The identification time of this method is up to 50 ms.
Highlights
In order to supply precise attitude for control systems, almost all spacecrafts need to obtain the attitudes
This method employs an Adaptive Ant Colony (AAC) algorithm to search optimal angular distance of star points set, completes the angular distance optimization of star points set, and achieves quick identification of a star map. This identification method calculates the angular distance of any pair of star points by the parallel processing ability of the AAC algorithm to improve the speed of identification
The angular distance of two star points is solved as the path of the AAC algorithm
Summary
Novel Inertial Instrument and Navigation System Technology Laboratory, School of Instrumentation. Science and Optoelectronics Engineering, Beijing University of Aeronautics and Astronautics, Beijing. Received: 23 December 2009; in revised form: 13 January 2010 / Accepted: 23 February 2010 /
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.