摘要
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.
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.
