{'fraction_non_alphanumeric': 0.019507186858316223, 'fraction_numerical': 0.0, 'mean_word_length': 5.543624161073826, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A brief survey of the deterministic solution for satellite attitude estimation

There are mainly two methods to solve the problem of satellite attitude determination: one is state estimation algorithm; the other is deterministic solution. Along with the rapid development of small satellite technology, deterministic solution gains more and more attention due to its small computational cost and fast convergence speed. The article presents Wahba's problem, from which deterministic solution is originated. The situation of two vector measurements is specifically addressed and discussed. Then, the batch attitude determination algorithm is presented. The importance and emphasis will be on the difference and comparison of various solutions. In order to achieve the algorithm in practice, many authors make efforts to extend the solution from point-by-point to recursive algorithms. In addition, necessary extension is carried out to estimate other non-attitude parameters.