An Advanced Cooperative Positioning Algorithm Based on Improved Factor Graph and Sum-Product Theory for Multiple AUVs
Bibliographic record
Abstract
In this research, a novel autonomous underwater vehicle (AUV) cooperative positioning algorithm is proposed to solve the implementation problem of multi-sensor-fusion applications. Different from the traditional methods [i.e., the extended Kalman filter (EKF), unscented Kalman filter (UKF), and iteration extended Kalman filter (IEKF)], which have large linearity error under the condition of nonlinear observation equation when multiple AUV are cooperative positioning, the proposed algorithm utilized the Baysis filter to solve the AUV cooperative problem. Factor graph and sum-product (FGS)-based cooperative positioning algorithm is established to mathematically implement the Bayse filter by converting the global function estimation problem into a local function sum-product estimation problem. Furthermore, to improve the performance of the proposed algorithm, a robust data processing method is presented by introducing a transform matrix to the estimated position information. To demonstrate and verify the proposed methods, the simulation and real tests in different scenarios are performed in this research. Compared with the traditional EKF, UKF, and IEKF cooperative positioning algorithm, the positioning error of the proposed improved FGS (IFGS) cooperative positioning algorithm is obviously smaller than that of the other three algorithms. Moreover, the IFGS algorithm can reduce the complexity of the algorithm, available improving the computational speed of the whole system. This proposed algorithm has important theoretical and practical value for the both industry and academic areas.
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.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".