arrow
Return

Random Forest-Based Optimization Algorithm for Shipborne GNSS Vector Tracking Loop

delete2025-10-01
delete0
PRE
AI
刘卫 (Wei Liu)
K
Kaiwei Zhu
胡媛 cover
胡媛 (Yuan Hu) *
N
Naiyuan Lou
T
Tsung-Hsuan Hsieh
S
Shengzheng Wang
DOI:10.1080/01490419.2025.2575974delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Global Navigation Satellite System (GNSS) serves as a pivotal technology for achieving global positioning. Within GNSS receivers, the Vector Tracking Loop (VTL) stands out as an advanced signal processing method, offering enhanced anti-interference capabilities and robustness in dynamic environments compared to the Scalar Tracking Loop (STL). However, traditional VTL face significant challenges under conditions of low signal-to-noise ratio (SNR), signal blockage, multipath effects, and non-line-of-sight scenarios. These challenges can compromise the stability and reliability of the system, leading to substantial positioning errors or navigation failures. To address this issue, this paper proposes an optimization method for shipborne GNSS VTL based on Random Forest (RF). Initially, satellite signal SNR, satellite elevation angle, and coordinate information are identified as key features. The pseudorange and pseudorange rate errors, derived from the VTL under favorable signal conditions, serve as output variables. By employing an improved ensemble bagging decision tree learning approach, predictive models for pseudorange and pseudorange rate errors are developed. A shipborne experiment found that in locations with signal blockage, the proposed RF-based VTL (RFVTL) optimization method enhanced horizontal positioning accuracy by 94% and 72% compared to traditional VTL and VTL with loop filters, respectively.
Keywords:
random forest
vector tracking loop
ship navigation system

Journal

M
Marine Geodesy
IF:
1.4
Papers:
20
Citations:
0

Organization

S
Shanghai Maritime University
Scholars:
4.8K
Papers: 4.2K
Citations: 4.7K
S
shanghai ocean university
Scholars:
2.3K
Papers: 684
Citations: 0