Previous Abstract Return to Session A1 Next Abstract

Session A1: Algorithms for GNSS Processing and Sensor Integration

Improved Ambiguity Searching Method of Ultra-Short Baseline with Nonlinear Constraint
Hang Guo, Baolian Tian, Nanchang University, China; Min Yu, Jiangxi Normal University, China; Linkun Deng, Nanchang University, China; Haitao Wang, State Key Laboratory of Geodesy and Earth’s Dynamics, Institute of Geodesy and Geophysics, Chinese Academy of Science, China
Location: Grand Ballroom G
Date/Time: Tuesday, Jan. 30, 4:30 p.m.

Peer Reviewed

The success rate of the ambiguity solution can be improved with a baseline length constraint. The performance of the traditional ambiguity resolution method may be degraded by the remainder term of linear approximation for ultra-short baselines. In this paper, an algorithm for the nonlinear constraint of baseline length has been proposed. It searches the optional solution for the objective function satisfying the baseline verification in the space constructed with the LAMBDA method. Compared with the algorithm without constraint and the linear constraint of baseline length, the success rate of the proposed algorithm increased significantly. In our tests, the success rates of static ambiguity fixation have been increased by 30% - 40%, while the dynamic example shown the ambiguity fixation success rate increased by 60% -70%.



Previous Abstract Return to Session A1 Next Abstract