A New Satellite Selection Algorithm for a Multi-constellation GNSS Receiver

Ershen Wang, Chaoying Jia, Shaojun Feng, Gang Tong, He He, Pingping Qu, Yuxia Bie, Chuanyun Wang, Yi Jiang

Peer Reviewed

Abstract: The number of visible satellites has significantly increased, which provides a possibility for high-precision positioning of global navigation satellite systems (GNSSs). However, GNSS receivers with higher computing power will be required owing to the usage of a large number of visible satellites, and selection of partial satellites with better spatial geometry is required for obtaining high positioning precision schemes for a variety of applications. The geometric dilution of precision (GDOP) is related to the geometrical arrangement of the user and the satellites and computationally intensive, involving matrix multiplication and inversion operations. Various intelligent algorithms for satellite selection have been suggested recently, such as genetic algorithms (GAs). the computation number of GDOP was reduced, owing to the adoption and optimization of these algorithms. However, the algorithms suffer from two issues: 1) the computation process is complex, and significant parametric tuning is required. 2) the algorithms may fall into local optima, instead of the global optimum, owing to the stochasticity of the optimization process. In the paper, we have proposed a novel algorithm for satellite selection, based on chaotic particle swarm optimization (CPSO), which has the advantages of faster convergence, a smaller number of adjustable parameters, and stronger adaptability, compared with the existing algorithms. Firstly, the visible satellites received by the GNSS receiver are continuously encoded and randomly grouped, form the initial population. Afterward, the positions of the particles are updated by the PSO’s velocitydisplacement model. Finally, the CPSO-based algorithm for selection of satellites is designed to replace poor-performing particles with particles in the initial population, which helps to effectively avoid sub-optimal solutions. The proposed algorithm was compared with the traversal method. The simulation results demonstrated that if more than five satellites are selected, the satellite selection time amounts to 37.5% of the time required by the traversal method, and the GDOP error is in the 0.7 range. The proposed algorithm was further validated on the BDS/GPS integrated navigation satellite selection, suggesting the effectiveness of the application in the multiple GNSSs integrated navigation.
Published in: Proceedings of the 31st International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2018)
September 24 - 28, 2018
Hyatt Regency Miami
Miami, Florida
Pages: 3802 - 3811
Cite this article: Wang, Ershen, Jia, Chaoying, Feng, Shaojun, Tong, Gang, He, He, Qu, Pingping, Bie, Yuxia, Wang, Chuanyun, Jiang, Yi, "A New Satellite Selection Algorithm for a Multi-constellation GNSS Receiver," Proceedings of the 31st International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2018), Miami, Florida, September 2018, pp. 3802-3811.
Full Paper: ION Members/Non-Members: 1 Download Credit
Sign In