Journal of System Simulation ›› 2018, Vol. 30 ›› Issue (8): 2900-2907.doi: 10.16182/j.issn1004731x.joss.201808011

Previous Articles     Next Articles

Message Passing Algorithm through Particles on Factor Graph in Cooperative Positioning Network

Fan Xinyue, Wang Guan, Zhou Fei   

  1. Chongqing Key Laboratory of Optical Communication and Networks, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
  • Received:2016-09-23 Online:2018-08-10 Published:2019-01-08

Abstract: Combining the sum-product algorithm with the factor graph can achieve cooperative positioning by a distributed manner. The sum-product algorithm is a message passing algorithm. However, the parameter method cannot meet the positioning needs because of the large error in the non-linear non-Gaussian environment. Therefore, this paper presents an algorithm to achieve message passing in the form of particle. The calculation of the message in the factor consists of summation and quadrature processes. The proposed method obtains the sum of messages by importance sampling, obtains the product of messages using Gibbs sampling. Particle-based information passing algorithm can simplify the complex joint posterior probability distribution. Compared with message passing algorithm based on parameters, themethod based on particles improves the positioning accuracy in non-linear, non-Gaussian environments.

Key words: distributed algorithms, factor graph, sum-product algorithm, message passing algorithm, particle

CLC Number: