Article
Version 1
Preserved in Portico This version is not peer-reviewed
Fast Screening Algorithm for Satellites Based on Multi‐Constellation System
and
*
Version 1
: Received: 13 June 2024 / Approved: 13 June 2024 / Online: 13 June 2024 (12:08:12 CEST)
How to cite: Zhou, W.; Wu, Z. Fast Screening Algorithm for Satellites Based on Multi‐Constellation System. Preprints 2024, 2024060916. https://doi.org/10.20944/preprints202406.0916.v1 Zhou, W.; Wu, Z. Fast Screening Algorithm for Satellites Based on Multi‐Constellation System. Preprints 2024, 2024060916. https://doi.org/10.20944/preprints202406.0916.v1
Abstract
The number of visible navigation satellites in a multi-constellation system increases exponentially compared to a single constellation, significantly increasing the complexity of the system state equations in the data fusion algorithm of a tightly coupled navigation system. This results in an exponential increase in the computation volume for navigation and positioning, seriously affecting real-time performance. To address this, a low-cost, low-computation satellite screening algorithm is proposed. It adaptively changes the number of constellation satellites by setting different screening thresholds and adjusting the number of remaining satellites. The algorithm then sorts and differentiates the azimuth and elevation angles of the screened satellites to form a selection strategy that divides the space region multiple times, enabling fast satellite selection. This approach greatly reduces the calculation amount while ensuring positioning accuracy. Experimental results show that the proposed algorithm maintains positioning differences within 5 meters compared to traditional satellite selection algorithms, and the time consumed for selecting a single epoch is greatly reduced. This indicates that the algorithm is suitable for low-cost multi-constellation satellite positioning systems.
Keywords
satellite screening; elevation angle; GDOP value
Subject
Engineering, Automotive Engineering
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
