A navigation satellite selection algorithm for optimized positioning based on Gibbs sampler
In various applications of satellite navigation and positioning, it is a key topic to select suitable satellites for positioning solutions to reduce the computational burden of the receiver in satellite selection system. Moreover, in order to reduce the processing burden of receivers, the satellite...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-06-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147720929620 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850223107757834240 |
|---|---|
| author | Na Xia Qinan Zhi Menghua He Yunqing Hong Huazheng Du |
| author_facet | Na Xia Qinan Zhi Menghua He Yunqing Hong Huazheng Du |
| author_sort | Na Xia |
| collection | DOAJ |
| description | In various applications of satellite navigation and positioning, it is a key topic to select suitable satellites for positioning solutions to reduce the computational burden of the receiver in satellite selection system. Moreover, in order to reduce the processing burden of receivers, the satellite selection algorithm based on Gibbs sampler is proposed. First, the visible satellites are randomly sampled and divided into a group. The group is regarded as an initial combination selection scheme. Then, the geometric dilution of precision is chosen as an objective function to evaluate the scheme’s quality. In addition, the scheme is updated by the conditional probability distribution model of the Gibbs sampler algorithm, and it gradually approaches the global optimal solution of the satellite combination with better geometric distribution of the space satellite. Furthermore, an “adaptive perturbation” strategy is introduced to improve the global searching ability of the algorithm. Finally, the extensive experimental results demonstrate that when the number of selected satellite is more than 6, the time that the proposed algorithm with the improvement of “adaptive perturbation” takes to select satellite once is 43.7% of the time that the primitive Gibbs sampler algorithm takes. And its solutions are always 0.1 smaller than the related algorithms in geometric dilution of precision value. Therefore, the proposed algorithm can be considered as a promising candidate for satellite navigation application systems. |
| format | Article |
| id | doaj-art-6a6880c520a04b0386bae093bb770f61 |
| institution | OA Journals |
| issn | 1550-1477 |
| language | English |
| publishDate | 2020-06-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-6a6880c520a04b0386bae093bb770f612025-08-20T02:06:05ZengWileyInternational Journal of Distributed Sensor Networks1550-14772020-06-011610.1177/1550147720929620A navigation satellite selection algorithm for optimized positioning based on Gibbs samplerNa Xia0Qinan Zhi1Menghua He2Yunqing Hong3Huazheng Du4School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, Anhui, ChinaState Key Laboratory of Satellite Navigation System and Equipment Technology, Shijiazhuang, ChinaSchool of Computer Science and Information Engineering, Hefei University of Technology, Hefei, Anhui, ChinaSchool of Computer Science and Information Engineering, Hefei University of Technology, Hefei, Anhui, ChinaSchool of Computer Science and Information Engineering, Hefei University of Technology, Hefei, Anhui, ChinaIn various applications of satellite navigation and positioning, it is a key topic to select suitable satellites for positioning solutions to reduce the computational burden of the receiver in satellite selection system. Moreover, in order to reduce the processing burden of receivers, the satellite selection algorithm based on Gibbs sampler is proposed. First, the visible satellites are randomly sampled and divided into a group. The group is regarded as an initial combination selection scheme. Then, the geometric dilution of precision is chosen as an objective function to evaluate the scheme’s quality. In addition, the scheme is updated by the conditional probability distribution model of the Gibbs sampler algorithm, and it gradually approaches the global optimal solution of the satellite combination with better geometric distribution of the space satellite. Furthermore, an “adaptive perturbation” strategy is introduced to improve the global searching ability of the algorithm. Finally, the extensive experimental results demonstrate that when the number of selected satellite is more than 6, the time that the proposed algorithm with the improvement of “adaptive perturbation” takes to select satellite once is 43.7% of the time that the primitive Gibbs sampler algorithm takes. And its solutions are always 0.1 smaller than the related algorithms in geometric dilution of precision value. Therefore, the proposed algorithm can be considered as a promising candidate for satellite navigation application systems.https://doi.org/10.1177/1550147720929620 |
| spellingShingle | Na Xia Qinan Zhi Menghua He Yunqing Hong Huazheng Du A navigation satellite selection algorithm for optimized positioning based on Gibbs sampler International Journal of Distributed Sensor Networks |
| title | A navigation satellite selection algorithm for optimized positioning based on Gibbs sampler |
| title_full | A navigation satellite selection algorithm for optimized positioning based on Gibbs sampler |
| title_fullStr | A navigation satellite selection algorithm for optimized positioning based on Gibbs sampler |
| title_full_unstemmed | A navigation satellite selection algorithm for optimized positioning based on Gibbs sampler |
| title_short | A navigation satellite selection algorithm for optimized positioning based on Gibbs sampler |
| title_sort | navigation satellite selection algorithm for optimized positioning based on gibbs sampler |
| url | https://doi.org/10.1177/1550147720929620 |
| work_keys_str_mv | AT naxia anavigationsatelliteselectionalgorithmforoptimizedpositioningbasedongibbssampler AT qinanzhi anavigationsatelliteselectionalgorithmforoptimizedpositioningbasedongibbssampler AT menghuahe anavigationsatelliteselectionalgorithmforoptimizedpositioningbasedongibbssampler AT yunqinghong anavigationsatelliteselectionalgorithmforoptimizedpositioningbasedongibbssampler AT huazhengdu anavigationsatelliteselectionalgorithmforoptimizedpositioningbasedongibbssampler AT naxia navigationsatelliteselectionalgorithmforoptimizedpositioningbasedongibbssampler AT qinanzhi navigationsatelliteselectionalgorithmforoptimizedpositioningbasedongibbssampler AT menghuahe navigationsatelliteselectionalgorithmforoptimizedpositioningbasedongibbssampler AT yunqinghong navigationsatelliteselectionalgorithmforoptimizedpositioningbasedongibbssampler AT huazhengdu navigationsatelliteselectionalgorithmforoptimizedpositioningbasedongibbssampler |