A Novel Approach for Improved Vehicular Positioning Using Cooperative Map Matching and Dynamic Base Station DGPS Concept
Bibliographic record
Abstract
In this paper, a novel approach for improving vehicular positioning is presented. This method is based on the cooperation of the vehicles by communicating their measured information about their position. This method consists of two steps. In the first step, we introduce our cooperative map matching method. This map matching method uses the V2V communication in a vehicular ad hoc network (VANET) to exchange global positioning system (GPS) information between vehicles. Having a precise road map, vehicles can apply the road constraints of other vehicles in their own map matching process and acquire a significant improvement in their positioning. After that, we have proposed the concept of a dynamic base station DGPS (DDGPS), which is used by vehicles in the second step to generate and broadcast the GPS pseudorange corrections that can be used by newly arrived vehicles to improve their positioning. The DDGPS is a decentralized cooperative method that aims to improve the GPS positioning by estimating and compensating the common error in GPS pseudorange measurements. It can be seen as an extension of DGPS where the base stations are not necessarily static with an exact known position. In the DDGPS method, the pseudorange corrections are estimated based on the receiver's belief on its positioning and its uncertainty and then broadcasted to other GPS receivers. The performance of the proposed algorithm has been verified with simulations in several realistic scenarios.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".