TL;DR
This paper presents a globally optimal, certifiable solver for aligning local frames to GNSS references using convex relaxation of the problem, effective even with minimal satellite data.
Contribution
It introduces a novel convex relaxation approach for frame alignment that guarantees optimality verification, addressing limitations of existing local optimization methods.
Findings
The method achieves certifiably optimal solutions with as few as 2 satellites.
It outperforms traditional methods that may fail or get stuck in local optima.
Experiments validate effectiveness in both simulation and real-world scenarios.
Abstract
Estimating the absolute orientation of a local system relative to a global navigation satellite system (GNSS) reference often suffers from local minima and high dependency on satellite availability. Existing methods for this alignment task rely on abundant satellites unavailable in GNSS-degraded environments, or use local optimization methods which cannot guarantee the optimality of a solution. This work introduces a globally optimal solver that transforms raw pseudo-range or Doppler measurements into a convexly relaxed problem. The proposed method is certifiable, meaning it can numerically verify the correctness of the result, filling a gap where existing local optimizers fail. We first formulate the original frame alignment problem as a nonconvex quadratically constrained quadratic program (QCQP) problem and relax the QCQP problem to a concave Lagrangian dual problem that provides a…
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.
Taxonomy
TopicsGNSS positioning and interference · Inertial Sensor and Navigation · Robotics and Sensor-Based Localization
