Synergy factor graph aided single-satellite positioning algorithm

2017 ◽  
Author(s):  
Huanhuan Lin ◽  
Baowang Lian ◽  
Yi He
Keyword(s):  
Factor Graph ◽  
Satellite Positioning ◽  
Positioning Algorithm

scholarly journals Factor-graph-aided three-dimensional faster cooperative positioning algorithm

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Chengkai Tang ◽  
Jiaqi Liu ◽  
Yi Zhang ◽  
Xingxing Zhu ◽  
Lingling Zhang
Keyword(s):  
Three Dimensional ◽  
Factor Graph ◽  
Cooperative Positioning ◽  
Positioning Algorithm

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

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3748 ◽  
Author(s):  
Chengkai Tang ◽  
Lingling Zhang ◽  
Yi Zhang ◽  
Houbing Song
Keyword(s):  
Smart Cities ◽  
Factor Graph ◽  
Positioning Error ◽  
Positioning Accuracy ◽  
Cooperative Positioning ◽  
Measured Range ◽  
Ranging Error ◽  
Positioning Algorithm ◽  
Range Error ◽  
Cooperative Nodes

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–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 1 / 5 to 1 / 3 of the other algorithms.

scholarly journals Research on BeiDou Satellite Positioning Algorithm Based on GPRS Technology

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Li Yang ◽  
Yunhan Zhang ◽  
Haote Ruan
Keyword(s):  
Real Time ◽  
Navigation System ◽  
Satellite Navigation ◽  
Positioning Systems ◽  
Time Dynamic ◽  
Satellite Navigation System ◽  
Satellite Positioning ◽  
Error Elimination ◽  
Wireless Module ◽  
Positioning Algorithm

The BeiDou Satellite Navigation System of China can provide users with high precision, as well as all-weather and real-time positioning and navigation information. It can be widely used in many applications. However, new challenges appear with the expansion of the 5G communication system. To eradicate or weaken the influence of various errors in BeiDou positioning, a BeiDou satellite positioning algorithm based on GPRS technology is proposed. According to the principles of the BeiDou Satellite navigation system, the navigation and positioning data are obtained and useful information are extracted and sent to the communication network through the wireless module. The error is corrected by establishing a real-time kinematic (RTK) mathematical model, and the pseudorange is calculated by carrier phase to further eliminate the relativistic and multipath errors. Based on the results of error elimination, the BeiDou satellite positioning algorithm is improved and the positioning error is corrected. The experimental results show that the positioning accuracy and efficiency of the algorithm can meet the actual needs of real-time dynamic positioning systems.

scholarly journals Factor Graph Weight Particles aided Distributed Underwater Cooperative Positioning Algorithm

2021 ◽  
Author(s):  
lingling zhang ◽  
baoguo yu ◽  
Chengkai Tang ◽  
yi zhang ◽  
Houbing Song
Keyword(s):  
Power Efficiency ◽  
High Efficiency ◽  
Low Complexity ◽  
Factor Graph ◽  
Network Nodes ◽  
Cooperative Positioning ◽  
Underwater Localization ◽  
Positioning Algorithm ◽  
Marine Exploration ◽  
Real Test

Abstract The growing scale of marine exploration requires high-resolution underwater localization, which necessitates cooperation among underwater network nodes, considering the channel complexity and power efficiency. In this paper, we proposed factor graph weight particles aided distributed underwater nodes cooperative positioning algorithm (WP-DUCP). It capitalized on the factor graph and sum-product algorithm to decompose the global optimization to the product of several local optimization functions. Combined with the Gaussian parameters to construct the weighted particles and to realize the belief transfer, it shows low complexity and high efficiency, suitable to the energy-restricted and communication distance-limited underwater networks. In terms of convergence, localization resolution, and computation complexity, we conducted the simulation and real-test with comparison to the existing co-localization methods. The results verified a higher resolution of the proposed method with no extra computation burden.

scholarly journals An Advanced Cooperative Positioning Algorithm Based on Improved Factor Graph and Sum-Product Theory for Multiple AUVs

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 67006-67017 ◽  
Author(s):  
Shiwei Fan ◽  
Ya Zhang ◽  
Chunyang Yu ◽  
Minghong Zhu ◽  
Fei Yu
Keyword(s):  
Factor Graph ◽  
Cooperative Positioning ◽  
Positioning Algorithm

scholarly journals Inertial-Navigation-Aided Single-Satellite Highly Dynamic Positioning Algorithm

Sensors ◽  
2019 ◽  
Vol 19 (19) ◽  
pp. 4196 ◽  
Author(s):  
Lingling Zhang ◽  
Chengkai Tang ◽  
Yi Zhang ◽  
Houbing Song
Keyword(s):  
Target Location ◽  
Unscented Kalman Filter ◽  
Inertial Navigation ◽  
Satellite System ◽  
Global Navigation Satellite Systems ◽  
Positioning System ◽  
Position Change ◽  
Satellite Positioning ◽  
Initial Location ◽  
Positioning Algorithm

Nowadays, research on global navigation satellite systems (GNSS) has reached a certain level of maturity to provide high-precision positioning services in many applications. Nonetheless, there are challenging GNSS-denial environments where a temporarily deployed single-satellite positioning system is a promising choice. To further meet the emergency call of highly dynamic targets in such situations, an augmented single-satellite positioning algorithm is proposed in this paper. First, the initial location of the highly dynamic target is found by real-time displacement feedback from the inertial navigation system (INS). Then, considering the continuity of position change, and taking advantage of the high accuracy and robustness of the unscented Kalman filter (UKF), target location is through iteration and fusion. Comparing this proposed method with the least-squares Newton-iterative Doppler single-satellite positioning system and the pseudorange rate-assisted method under synthetic error conditions, the positioning error of our algorithm was 10 % less than the other two algorithms. This verified the validation of our algorithm in the single-satellite system with highly dynamic targets.

Sign in / Sign up

Export Citation Format

Share Document