Factor Graph-Assisted Distributed Cooperative Positioning Algorithm in the GNSS System

The development of smart cities calls for improved accuracy in navigation and positioning services; due to the effects of satellite orbit error, ionospheric error, poor quality of navigation signals and so on, it is difficult for existing navigation technology to achieve further improvements in positioning accuracy. Distributed cooperative positioning technology can further improve the accuracy of navigation and positioning with existing GNSS (Global Navigation Satellite System) systems. However, the measured range error and the positioning error of the cooperative nodes exhibit larger reductions in positioning accuracy. In response to this question, this paper proposed a factor graph-aided distributed cooperative positioning algorithm. It establishes the confidence function of factor graphs theory with the ranging error and the positioning error of the coordinated nodes and then fuses the positioning information of the coordinated nodes by the confidence function. It can avoid the influence of positioning error and ranging error and improve the positioning accuracy of cooperative nodes. In the simulation part, the proposed algorithm is compared with a mainly coordinated positioning algorithm from four aspects: the measured range error, positioning error, convergence speed, and mutation error. The simulation results show that the proposed algorithm leads to a 30&#8315;60% improvement in positioning accuracy compared with other algorithms under the same measured range error and positioning error. The convergence rate and mutation error elimination times are only <inline-formula> <math display="inline"> <semantics> <mrow> <mn>1</mn> <mo>/</mo> <mn>5</mn> </mrow> </semantics> </math> </inline-formula> to <inline-formula> <math display="inline"> <semantics> <mrow> <mn>1</mn> <mo>/</mo> <mn>3</mn> </mrow> </semantics> </math> </inline-formula> of the other algorithms.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.