PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
There will be 70-90 navigation satellites in the sky at the same time when GALILEO and BD reach full operation
capability, and the visible satellite number can reach 30. Then satellite selection will be very important to decrease
computing time for many applications whose processing capability and time are limited such as aviation. The classical
optimal algorithm selects a n-satellite subset from m visible satellites with the minimum GDOP. It requires a long time
for computing especially for much many satellites. This paper proposes a quickly satellite selection algorithm which is
more adaptive when the number of visible satellites is very large. The computer simulation results show that the quickly
satellite selection algorithm has much lower computation load, shortens the computation time greatly than the optimal
algorithm and the increased GDOP is less than 10%.
Miaoyan Zhang,Jun Zhang, andYong Qin
"A new quick algorithm for GPS/Galileo/BD satellite selection", Proc. SPIE 6795, Second International Conference on Space Information Technology, 67957I (10 November 2007); https://doi.org/10.1117/12.775523
ACCESS THE FULL ARTICLE
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
The alert did not successfully save. Please try again later.
Miaoyan Zhang, Jun Zhang, Yong Qin, "A new quick algorithm for GPS/Galileo/BD satellite system," Proc. SPIE 6795, Second International Conference on Space Information Technology, 67957I (10 November 2007); https://doi.org/10.1117/12.775523