论文部分内容阅读
With the flourish development of GNSS community,the number of available navigation satellites is increasing rapidly.Benefiting from the super constellation consisting of satellites from various systems,the availability and reliability of positioning service are improved for multi-constellation GNSS receivers.Meanwhile,the complexity and uncertainty in satellite-searching process are multiplied as well,which significantly increasesthe receiver’s time to first fix (TTFF) and decreases its performance.Dynamic satellite-searching algorithms can be employed to reduce TTFF.However,existing dynamic satellite-searching algorithm is not robust and efficient enough when masking problem exists.In this paper,a robust dynamic satellite-searching algorithm is proposed.Theoretical analysis and numeric simulations in masking situation are presented,and proves the efficiency and robustness of the new algorithm.In conclusion,the new dynamic satellite-searching algorithm provides an efficient and robust solution to practical multi-constellation GNSS receivers.