Recursive mode star identification algorithms

Star identification can be accomplished by several different available algorithms that identify the stars observed by a star tracker. However, efficiency and reliability remain key issues and the availability of new active pixel cameras requires new approaches. Two novel algorithms for recursive mode star identification are presented here. The first approach is derived by the spherical polygon search (SP-search) algorithm, it was used to access all the cataloged stars observed by the sensor field-of-view (FOV) and recursively add/remove candidate cataloged stars according to the predicted image motion induced by camera attitude dynamics. Star identification is then accomplished by a star pattern matching technique which identifies the observed stars in the reference catalog. The second method uses star neighborhood information and a catalog neighborhood pointer matrix to access the star catalog. In the recursive star identification process, and under the assumption of "slow" attitude dynamics, only the stars in the neighborhood of previously identified stars are considered for star identification in the succeeding frames. Numerical tests are performed to validate the absolute and relative efficiency of the proposed methods.     

Flower Constellation Set Theory Part II: Secondary Paths and Equivalency

In our previous research, the Flower Constellation set theory was introduced but specific details left out. In this work, the particular phasing theory that we have adopted is discussed in full. As a consequence of this choice of parametrization, a new class of orbit theory has emerged: secondary paths (SPs). The theory of SPs is developed and proved in this work. Examples of SPs are presented and discussed. Furthermore, we discuss the equivalency of Flower Constellations and resolve how certain disparate choices of integer parameters can generate identical satellite distributions.