Optimal satellite selecting algorithm in GPS/BDS navigation system and its implementation

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As the Global Navigation Satellite System (GNSS) steps into a new era of multiple constellations, multiple constellations bring opportunities for navigation and positioning services. Under the condition of the existence of multiple constellations, the number of observable satellite number will increase sharply in single epoch. Because of the limitation of computing source, too much redundant information brought by redundant satellites can not greatly improve the accuracy of positioning, however, it may actually increase the computational burden of receiver. Therefore, optimizing the satellite selection algorithm is of great significance. Based on the relations of constellation’s geometry and the principle of GDOP, this paper proposed a satellite selection algorithm suitable for multiple constellations. Furthermore, a satellite selection strategy applied to 5–7 satellites is considered. The experimental results show that on the premise of positioning accuracy, the improved satellite selection satellite can significantly reduce the calculation time and has good real-time performance and reliability.

Cite

CITATION STYLE

APA

Ma, Z., Yang, L., Jia, X., Zhang, D., & Liu, S. (2015). Optimal satellite selecting algorithm in GPS/BDS navigation system and its implementation. In Lecture Notes in Electrical Engineering (Vol. 340, pp. 117–127). Springer Verlag. https://doi.org/10.1007/978-3-662-46638-4_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free