Journal of Software Engineering and Applications

Volume 3, Issue 1 (January 2010)

ISSN Print: 1945-3116   ISSN Online: 1945-3124

Google-based Impact Factor: 1.22  Citations  h5-index & Ranking

A Polar Coordinate System Based Grid Algorithm for Star Identification

HTML  Download Download as PDF (Size: 581KB)  PP. 34-38  
DOI: 10.4236/jsea.2010.31004    5,773 Downloads   10,759 Views  Citations

Affiliation(s)

.

ABSTRACT

In Cartesian coordinate systems, the angular separation-based star identification algorithms involve much trigon- ometric function computing. That delays the algorithm process. As in a polar coordinate system, the coordinates are denoted by angular values, it is potential to speed up the star identification process by adopting a polar coordinate sys-tem. An angular polar coordinate system is introduced and a grid algorithm based on the coordinate system is proposed to enhance the performances of the star identification process. The simulations demonstrate that the algorithm in the angular polar coordinate system is superior to the grid algorithm in the rectangle Cartesian coordinate system in com-puting cost and identification rate. It can be used in the star sensors for high precision and high reliability in spacecraft navigation.

Share and Cite:

H. ZHANG, H. SANG and X. SHEN, "A Polar Coordinate System Based Grid Algorithm for Star Identification," Journal of Software Engineering and Applications, Vol. 3 No. 1, 2010, pp. 34-38. doi: 10.4236/jsea.2010.31004.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.