Pith. sign in

REVIEW

Recursive Star-Identification Algorithm using an Adaptive SVD-based Angular Velocity Estimator

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.11684 v2 pith:YZ5V2EUJ submitted 2020-03-26 eess.SP

classification eess.SP
keywords algorithmrecursiveangularsatellitevelocityadaptivedynamicsestimator
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper describes an algorithm obtained by merging a recursive star identification algorithm with a recently developed adaptive SVD-based estimator of the angular velocity vector (QuateRA). In a recursive algorithm, the more accurate the angular velocity estimate, the quicker and more robust to noise the resultant recursive algorithm is. Hence, combining these two techniques produces an algorithm capable of handling a variety of dynamics scenarios. The speed and robustness of the algorithm are highlighted in a selection of simulated scenarios. First, a speed comparison is made with the state-of-the-art lost-in-space star identification algorithm, Pyramid. This test shows that in the best case the algorithm is on average an order of magnitude faster than Pyramid. Next, the recursive algorithm is validated for a variety of dynamic cases including a ground-based "Stellar Compass" scenario, a satellite in geosynchronous orbit, a satellite during a re-orientation maneuver, and a satellite undergoing non-pure-spin dynamics.

Discussion (0). Sign in to comment.

Pith tools