Abstract
Positioning information is the cornerstone of a new generation of electronic information technology applications represented by the Internet of Things and smart city. However, due to various environmental electromagnetic interference, building shielding, and other factors, the positioning source can fail. Cooperative positioning technology can realize the sharing of positioning information and make up for the invalid positioning source. When one node in the cooperative positioning network has error, the positioning stability of all nodes in the whole cooperative network will be significantly reduced, but the positioning probability information technology can effectively reduce the impact of mutation error. Based on this idea, this paper proposes an information-geometry-assisted distributed algorithm for probabilistic cooperative fusion positioning (IG-CP) of navigation information. The position information of different types of navigation sources is utilized to establish a probability density model, which effectively reduces the influence of a single position error on the whole cooperative position network. Combined with the nonlinear fitting characteristics of the information geometric manifold, mapping and fusion of the ranging information between cooperative nodes on the geometric manifold surface are conducted to achieve cooperative positioning, which can effectively improve the stability of the positioning results. The proposed algorithm is simulated and analyzed in terms of the node positioning error, ranging error, convergence speed, and distribution of the cooperative positioning network. The simulation results show that our proposed cooperative positioning algorithm can effectively improve the positioning stability and display better positioning performance.
Funder
National Natural Science Foundation of China
the Natural Science Basic Research Plan in Shaanxi Province of China
China Postdoctoral Science Foundation
Subject
General Earth and Planetary Sciences
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献