A Mixed Integer Least-Squares Formulation of the GNSS Snapshot Positioning Problem
This paper presents a formulation of Snapshot Positioning as a mixed-integer least-squares problem. In snapshot positioning one estimates a position from code-phase and possibly Doppler observations of a Global Navigation Satellite Systems (GNSS) without knowing the time of departure (timestamp) of the codes. Solving the problem allows a receiver to determine a fix from short radio-frequency snapshots missing the time-stamp information embedded in the GNSS data stream. This is used to reduced the time to first fix in some receivers, and it is used in certain wildlife trackers. This paper presents two new formulations of the problem and an algorithm that solves the resulting mixed-integer least-squares problems. We also show that the new formulations can produce fixes even with huge initial errors, much larger than permitted in Van Diggelen's widely-cited coarse-time navigation method.
Code (1)
Tasks
PositionSimilar Papers 제목 키워드 기반
Algorithms for Nonlinear Mixed-Integer Location Estimation
For three decades, carrier-phase observations have been used to obtain the most accurate location estimates using global navigation satellite systems (GNSS). These estimates are computed by minimizing a nonlinear mixed-i…
Low-Cost Inertial Aiding for Deep-Urban Tightly-Coupled Multi-Antenna Precise GNSS
A vehicular pose estimation technique is presented that tightly couples multi-antenna carrier-phase differential GNSS (CDGNSS) with a low-cost MEMS inertial sensor and vehicle dynamics constraints. This work is the first…
Pose EstimationConstrained Wrapped Least Squares: A Tool for High Accuracy GNSS Attitude Determination
Attitude determination is a popular application of Global Navigation Satellite Systems (GNSS). Many methods have been developed to solve the attitude determination problem with different performance offerings. We develop…
Training Recurrent Neural Networks by Sequential Least Squares and the Alternating Direction Method of Multipliers
This paper proposes a novel algorithm for training recurrent neural network models of nonlinear dynamical systems from an input/output training dataset. Arbitrary convex and twice-differentiable loss functions and regula…
Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements
We study computational aspects of a key problem in robust statistics -- the penalized least trimmed squares (LTS) regression problem, a robust estimator that mitigates the influence of outliers in data by capping residua…