A method of improving ambiguity fixing rate for post-processing kinematic GNSS data
Bibliographic record
Abstract
Abstract Global Navigation Satellite System precise positioning using carrier phase measurements requires reliable ambiguity resolution. It is challenging to obtain continuous precise positions with a high ambiguity fixing rate under a wide range of dynamic scenes with a single base station, thus the positioning accuracy will be degraded seriously. The Forward–Backward Combination (FBC), a common post-processing smoothing method, is simply the weighted average of the positions of forward and backward filtering. When the ambiguity fixing rate of the one-way (forward or backward) filter is low, the FBC method usually cannot provide accurate and reliable positioning results. Consequently, this paper proposed a method to improve the accuracy of positions by integrating forward and backward AR, which combines the forward and backward ambiguities instead of positions—referred to as ambiguity domain-based integration (ADBI). The purpose of ADBI is to find a reliable correct integer ambiguities by making full use of the integer nature of ambiguities and integrating the ambiguities from the forward and backward filters. Once the integer ambiguities are determined correctly and reliably with ADBI, then the positions are updated with the fixing ambiguities constrained, in which more accurate positions with high confidence can be achieved. The effectiveness of the proposed approach is validated with airborne and car-borne dynamic experiments. The experimental results demonstrated that much better accuracy of position and higher ambiguity-fixed success rate can be achieved than the traditional post-processing method.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".