当前位置: X-MOL 学术Int. J. Distrib. Sens. Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A navigation satellite selection algorithm for optimized positioning based on Gibbs sampler
International Journal of Distributed Sensor Networks ( IF 1.9 ) Pub Date : 2020-06-01 , DOI: 10.1177/1550147720929620
Na Xia 1, 2 , Qinan Zhi 1 , Menghua He 2 , Yunqing Hong 2 , Huazheng Du 2
Affiliation  

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.

中文翻译:

基于Gibbs采样器的优化定位导航卫星选择算法

在卫星导航定位的各种应用中,选择合适的卫星进行定位解决方案以减轻选星系统中接收机的计算负担是一个关键课题。此外,为了减轻接收机的处理负担,提出了基于Gibbs采样器的选星算法。首先,对可见卫星进行随机采样并分成一组。该组被视为初始组合选择方案。然后,选择精度的几何稀释作为目标函数来评估方案的质量。另外,该方案通过Gibbs采样器算法的条件概率分布模型进行更新,并逐渐逼近空间卫星几何分布较好的卫星组合全局最优解。此外,引入了“自适应扰动”策略以提高算法的全局搜索能力。最后,广泛的实验结果表明,当所选卫星的数量超过6时,所提出的算法随着“自适应扰动”的改善需要选择卫星的时间是43.7%的基本GIBBS采样器算法的时间需要。并且它的解在精度值的几何稀释上总是比相关算法小0.1。因此,所提出的算法可以被认为是卫星导航应用系统的一个有希望的候选者。引入了“自适应扰动”策略来提高算法的全局搜索能力。最后,广泛的实验结果表明,当所选卫星的数量超过6时,所提出的算法随着“自适应扰动”的改善需要选择卫星的时间是43.7%的基本GIBBS采样器算法的时间需要。并且它的解在精度值的几何稀释上总是比相关算法小0.1。因此,所提出的算法可以被认为是卫星导航应用系统的一个有希望的候选者。引入了“自适应扰动”策略来提高算法的全局搜索能力。最后,广泛的实验结果表明,当所选卫星的数量超过6时,所提出的算法随着“自适应扰动”的改善需要选择卫星的时间是43.7%的基本GIBBS采样器算法的时间需要。并且它的解在精度值的几何稀释上总是比相关算法小0.1。因此,所提出的算法可以被认为是卫星导航应用系统的一个有希望的候选者。提出的“自适应扰动”改进算法选择卫星一次所需的时间是原始吉布斯采样器算法所需时间的43.7%。并且它的解在精度值的几何稀释上总是比相关算法小0.1。因此,所提出的算法可以被认为是卫星导航应用系统的一个有希望的候选者。提出的“自适应扰动”改进算法选择卫星一次所需的时间是原始吉布斯采样器算法所需时间的43.7%。并且它的解在精度值的几何稀释上总是比相关算法小0.1。因此,所提出的算法可以被认为是卫星导航应用系统的一个有前途的候选者。
更新日期:2020-06-01
down
wechat
bug