A robust and fast algorithm that solves the lost-in-space problem for star trackers is presented in this paper. The algorithm is based on an image-processing technique, the shortest distance transform, which transforms the camera image into a two-dimensional lookup table. The information from the database can then be efficiently inserted into this table to compare the camera image with the database. This approach results in an algorithm that is robust to false stars, distortions on star positions, and failure of registration of bright stars. As an example, the algorithm determines over 99% of camera images correctly when 400 false stars are added, distortions of 300 () arcseconds are present, and the brightest star is missing in the image. In case of incorrect determination, a very reliable criterion indicates that the determination step has to be repeated. The robustness of this algorithm can allow the use of star trackers in hostile environments. Furthermore, the algorithm is a valuable contribution to the expanding field of small satellite projects where the low-cost camera components are more prone to error and registration of false stars. Small satellites using this algorithm can acquire great functionality at low component costs.
Highly Robust Lost-in-Space Algorithm Based on the Shortest Distance Transform
Journal of Guidance, Control, and Dynamics ; 36 , 2 ; 476-484
2013-01-22
9 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Highly Robust Lost-in-Space Algorithm Based on the Shortest Distance Transform
Online Contents | 2013
|A Highly Robust Lost In Space Algorithm Based On The Shortest Distance Transform
British Library Conference Proceedings | 2011
|Online Contents | 1994
|An outer approximation algorithm for the robust shortest path problem
Elsevier | 2013
|