咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Rapid Ambiguity Resolution Alg... 收藏
Rapid Ambiguity Resolution Algorithm for Multi-constellation...

Rapid Ambiguity Resolution Algorithm for Multi-constellation between Reference Stations Based on Ambiguity Tight Constraint

作     者:Ruicheng Zhang Chengfa Gao Shuguo Pan Zhiyue Yan Qing Zhao 

作者单位:School of Transportation Southeast University School of Instrument Science and Engineering Southeast University 

会议名称:《第九届中国卫星导航学术年会》

会议日期:2018年

学科分类:08[工学] 0804[工学-仪器科学与技术] 

关 键 词:Rapid Ambiguity Resolution Multi-GNSS Reference Station Tight Constraint Partial Ambiguity Resolution(PAR) 

摘      要:The development of multi-GNSS remarkably increased the number of available satellites, but how to solve the multi-dimensional ambiguity parameters quickly and accurately in network RTK technology is still an issue full of perplexity and significance. To ensure the virtual station have more available satellites under the occlusion environment, a fast ambiguity resolution method for base station based on ambiguity tight constraint was proposed in this paper. Firstly, the optimal subset of ambiguity is selected by partial ambiguity resolution(PAR) strategy, and then impose strong constraints on the ambiguities of these satellites. Finally, update the filter equation and assist in fixing the ambiguity of other satellites. The real measured baseline data which contain GPS, BDS and GLONASS from Tianjin CORS and Curtin University was used in the experiments, and the results illustrated that this method could significantly shorten the initialization time of ambiguity between base stations, accelerate the convergence speed of newly-arisen satellites, and increase the number of available satellites of RTK virtual observations(especially low-elevation angle satellites), that providing a reliable guarantee for high-precision positioning in the occlusion environment, such as the roads in cities.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分