A Novel GNSS Decentralized Cooperative Positioning Algorithm for Internet of Vehicles

With cooperative positioning (CP) in Internet of Vehicles (IoV), the positioning performance can be improved by utilizing the positioning information provided by neighboring vehicles. However, in urban canyons, the CP performance based on global navigation satellite system (GNSS) is severely degraded by multipath and non-line-of-sight (NLOS) effects, and a robust CP algorithm is required. This article proposes a GNSS decentralized CP (DCP) algorithm based on the generalized extreme studentized deviate test (GESD) filter. Further, a new two-stage CP framework is established, consisting of two modules, the independent and connected modules. The independent module is the first filter layer detection for GNSS pseudorange residual error, operating independently within each vehicle to mitigate the impact of abnormal measurements, such as multipath bias and satellite faults. When receiving data from neighboring vehicles, the connected module is activated to detect shared GNSS pseudorange errors and relative pseudorange measurements, further reducing the impact of anomalous measurements. The outdoor experiments validate the superiority of the DCP algorithm over the single-point positioning (SPP) method based on receiver autonomous integrity monitoring fault detection and exclusion (RAIM-FDE) in both GPS-only and GPS/BDS combination strategies, especially in blocked situations. The positioning root-mean-square error (RMSE) of the DCP algorithm for horizontal positioning is about 1.00 m in static scenes and about 8.00 m in dynamic scenes. Compared with the SPP-RAIM, the DCP algorithm can improve about 25.22%–43.04% and 16.55%–40.17% on average under GPS/BDS combination strategies in the horizontal and 3-D directions, respectively.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2024-12-25
DOI
https://doi.org/10.1109/jiot.2024.3522501
Citations
2
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.50

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Novel GNSS Decentralized Cooperative Positioning Algorithm for Internet of Vehicles

Hexiong Yao, Fei Huang, Zhiqiang Dai, Mingjun Ouyang et al.
2 citations
IEEE Internet of Things Journal
Robotic Path Planning Algorithms
0.50
article

A Novel GNSS Decentralized Cooperative Positioning Algorithm for Internet of Vehicles

Hexiong Yao, Fei Huang, Zhiqiang Dai, Mingjun Ouyang, Fang Li, Xiangwei Zhu, Qianqiang Lin, Ting Xie
article en
2 citations

Abstract

With cooperative positioning (CP) in Internet of Vehicles (IoV), the positioning performance can be improved by utilizing the positioning information provided by neighboring vehicles. However, in urban canyons, the CP performance based on global navigation satellite system (GNSS) is severely degraded by multipath and non-line-of-sight (NLOS) effects, and a robust CP algorithm is required. This article proposes a GNSS decentralized CP (DCP) algorithm based on the generalized extreme studentized deviate test (GESD) filter. Further, a new two-stage CP framework is established, consisting of two modules, the independent and connected modules. The independent module is the first filter layer detection for GNSS pseudorange residual error, operating independently within each vehicle to mitigate the impact of abnormal measurements, such as multipath bias and satellite faults. When receiving data from neighboring vehicles, the connected module is activated to detect shared GNSS pseudorange errors and relative pseudorange measurements, further reducing the impact of anomalous measurements. The outdoor experiments validate the superiority of the DCP algorithm over the single-point positioning (SPP) method based on receiver autonomous integrity monitoring fault detection and exclusion (RAIM-FDE) in both GPS-only and GPS/BDS combination strategies, especially in blocked situations. The positioning root-mean-square error (RMSE) of the DCP algorithm for horizontal positioning is about 1.00 m in static scenes and about 8.00 m in dynamic scenes. Compared with the SPP-RAIM, the DCP algorithm can improve about 25.22%–43.04% and 16.55%–40.17% on average under GPS/BDS combination strategies in the horizontal and 3-D directions, respectively.

IEEE Internet of Things JournalVol. 12(9)
Sun Yat-sen University (CN), National University of Defense Technology (CN), Shenzhen University (CN), Guangdong Polytechnic Normal University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Shandong Province, Basic and Applied Basic Research Foundation of Guangdong Province
Openalex Percentile: Top 32%
Robotic Path Planning Algorithms
0.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.