Fast satellite selection method for multi‐constellation Global Navigation Satellite System under obstacle environments

Peng, Ao; Ou, Gang; Li, Gengmin

doi:10.1049/iet-rsn.2013.0387

Cited by 23 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A. Peng et al proposed a recursive satellite selection method to expand the selected satellites subset sequentially [16]. However, the polynomial time complexity of this method is worthy of improving.…”

Section: Related Workmentioning

confidence: 99%

A Navigation Satellites Selection Method Based on ACO With Polarized Feedback

Hong

Xia

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Selecting the optimal satellite subset for positioning from all satellites in view can not only achieve positioning accuracy but also reduce the computational burden. In this paper, a navigation satellites selection method is proposed based on ant colony optimization with the improvement of polarized feedback (ACO-PF). Firstly, the satellite selection problem is described as a combinatorial optimization problem, and the noise weighted geometric dilution of precision (NWGDOP) is defined as the criterion for satellite selection. Then the ant colony optimization (ACO) is incorporated to solve the problem, and a polarized feedback mechanism is presented to improve the convergence speed of algorithm. Meanwhile, a perturbation operator is designed to improve the global searching ability of the algorithm. The numerical experimental results show that ACO-PF can select the superior satellites combination which provides highprecision positioning. And its convergence outperforms the related algorithms by up to 50%. Besides, the achieved NWGDOP of ACO-PF is usually 0.065 smaller than ACO. Therefore, the ACO-PF method can be considered as a promising candidate for satellite selecting in navigation applications.INDEX TERMS Ant colony optimization (ACO), noise weighted, geometric dilution of precision (GDOP), polarized feedback, perturbation operator

show abstract

Section: Related Workmentioning

confidence: 99%

A Navigation Satellites Selection Method Based on ACO With Polarized Feedback

Hong

Xia

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…G Ou and colleagues 17 proposed a recursive satellite selection algorithm to expand the selected satellite subset sequentially. M Wei et al 18 proposed a new algorithm that makes use of two satellites' comparability and the distribution characteristic of satellites with high or low elevation to select satellites.…”

Section: Related Workmentioning

confidence: 99%

A navigation satellite selection algorithm for optimized positioning based on Gibbs sampler

Xia

Zhi

et al. 2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

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.

show abstract

“…Thinking over the timeconsuming and power-saving calculation in GDOP, Teng proposed a closed-form calculation for multi-constellations, which could be adapted for the multi-GNSS constellations including two, three or four single ones [10]. Typical complex electromagnetism environments in urban areas and their effects on fast satellite selection algorithms were heated discussion in [11]. Moreover, with the development of modern GNSS plans, the influence of the multiconstellation had been analyzed theoretically [12].…”

Section: Literature Reviewmentioning

confidence: 99%