.png){kind=icon}
.png){kind=icon}
Return
An approximation method for GNSS quadratically constrained integer least-squares adjustment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.measurement.2025.118397.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• In GNSS direction finding, attitude determination, and landslip motioning, the problem is precise relative positioning with baseline length known as a priori. One of the most famous and widely used integer ambiguity resolution (IAR) in GNSS direction finding is quadratically constrained integer least-squares (QC-ILS) adjustment. However, the complexity of QC-ILS adjustment is much higher than the unconstraint ILS adjustment. Motivated by reducing the computational complexity of the QC-ILS adjustment for the low-cost platform, we modify the QC-ILS principle from three aspects: (i) approximating the OF, (ii) limiting the search region and (iii) giving a simple approach for solving the constrained baseline problem. These modifications greatly reducing the computational burden at the expense of a little decrement in success-rate.
Keywords:
GNSS
integer ambiguity resolution
QC-ILS adjustment
baseline length
computational complexity
Journal
IF:
5.6
Papers:
2.0W
Citations:
5.4W