TL;DR
This paper evaluates how an incremental graph optimization approach improves the convergence speed of precise point positioning (PPP) for kinematic platforms, using simulations and real data to analyze performance under various conditions.
Contribution
It introduces the application of incremental graph optimization (iSAM2) to PPP, demonstrating potential for faster convergence in real-time kinematic positioning.
Findings
Incremental graph optimization enhances PPP convergence speed.
Simulation results show robustness under varying atmospheric and multipath conditions.
Real data validates simulation trends.
Abstract
Estimation techniques to precisely localize a kinematic platform with GNSS observables can be broadly partitioned into two categories: differential, or undifferenced. The differential techniques (e.g., real-time kinematic (RTK)) have several attractive properties, such as correlated error mitigation and fast convergence; however, to support a differential processing scheme, an infrastructure of reference stations within a proximity of the platform must be in place to construct observation corrections. This infrastructure requirement makes differential processing techniques infeasible in many locations. To mitigate the need for additional receivers within proximity of the platform, the precise point positioning (PPP) method utilizes accurate orbit and clock models to localize the platform. The autonomy of PPP from local reference stations make it an attractive processing scheme for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
