An Evaluation of Optimization Algorithms for the Optimal Selection of GNSS Satellite Subsets

Alluhaybi, Abdulaziz; Psimoulis, Panos; Remenyte-Prescott, Rasa

Abstract

Continuous advancements in GNSS systems have led, apart from the broadly used GPS, to the development of other satellite systems (Galileo, BeiDou, GLONASS), which have significantly increased the number of available satellites for GNSS positioning applications. However, despite GNSS satellites’ redundancy, a potential poor GNSS satellite signal (i.e., low signal-to-noise ratio) can negatively affect the GNSS’s performance and positioning accuracy. On the other hand, selecting high-quality GNSS satellite signals by retaining a sufficient number of GNSS satellites can enhance the GNSS’s positioning performance. Various methods, including optimization algorithms, which are also commonly adopted in artificial intelligence (AI) methods, have been applied for satellite selection. In this study, five optimization algorithms were investigated and assessed in terms of their ability to determine the optimal GNSS satellite constellation, such as Artificial Bee Colony optimization (ABC), Ant Colony Optimization (ACO), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Simulated Annealing (SA). The assessment of the optimization algorithms was based on two criteria, such as the robustness of the solution for the optimal satellite constellation and the time required to find the solution. The selection of the GNSS satellites was based on the weighted geometric dilution of precision (WGDOP) parameter, where the geometric dilution of precision (GDOP) is modified by applying weights based on the quality of the satellites’ signal. The optimization algorithms were tested on the basis of 24 h of tracking data gathered from a permanent GNSS station, for GPS-only and multi-GNSS data (GPS, GLONASS, and Galileo). According to the comparison results, the ABC, ACO, and PSO algorithms were equivalent in terms of selection accuracy and speed. However, ABC was determined to be the most suitable algorithm due it requiring the fewest number of parameters to be set. To further investigate ABC’s performance, the method was applied for the selection of an optimal GNSS satellite subset according to the number of total available tracked GNSS satellites (up to 31 satellites), leading to more than 300 million possible combinations of 15 GNSS satellites. ABC was able to select the optimal satellite subsets with 100% accuracy.

Citation

Alluhaybi, A., Psimoulis, P., & Remenyte-Prescott, R. (2024). An Evaluation of Optimization Algorithms for the Optimal Selection of GNSS Satellite Subsets. Remote Sensing, 16(10), Article 1794. https://doi.org/10.3390/rs16101794

• Journal Article Type: Article
• Acceptance Date: May 15, 2024
• Online Publication Date: May 18, 2024
• Publication Date: May 18, 2024
• Deposit Date: May 21, 2024
• Publicly Available Date: May 21, 2024
• Electronic ISSN: 2072-4292
• Publisher: MDPI
• Peer Reviewed: Peer Reviewed
• Volume: 16
• Issue: 10
• Article Number: 1794
• DOI: https://doi.org/10.3390/rs16101794
• Public URL: https://nottingham-repository.worktribe.com/output/35148280
• Publisher URL: https://www.mdpi.com/2072-4292/16/10/1794