MS2MP: A Min-Sum Message Passing Algorithm for Motion Planning

03/07/2022
by   Salman Bari, et al.
0

Gaussian Process (GP) formulation of continuoustime trajectory offers a fast solution to the motion planning problem via probabilistic inference on factor graph. However, often the solution converges to in-feasible local minima and the planned trajectory is not collision-free. We propose a message passing algorithm that is more sensitive to obstacles with fast convergence time. We leverage the utility of min-sum message passing algorithm that performs local computations at each node to solve the inference problem on factor graph. We first introduce the notion of compound factor node to transform the factor graph to a linearly structured graph. We next develop an algorithm denoted as Min-sum Message Passing algorithm for Motion Planning (MS2MP) that combines numerical optimization with message passing to find collision-free trajectories. MS2MP performs numerical optimization to solve non-linear least square minimization problem at each compound factor node and then exploits the linear structure of factor graph to compute the maximum a posteriori (MAP) estimation of complete graph by passing messages among graph nodes. The decentralized optimization approach of each compound node increases sensitivity towards avoiding obstacles for harder planning problems. We evaluate our algorithm by performing extensive experiments for exemplary motion planning tasks for a robot manipulator. Our evaluation reveals that MS2MP improves existing work in convergence time and success rate.

READ FULL TEXT VIEW PDF

Authors

page 1

page 5

06/19/2018

Multi-agent Gaussian Process Motion Planning via Probabilistic Inference

This paper deals with motion planning for multiple agents by representin...
11/18/2013

A message-passing algorithm for multi-agent trajectory planning

We describe a novel approach for computing collision-free global traject...
05/23/2018

Distributed Approximation Algorithms for the Combinatorial Motion Planning Problem

We present a new 4-approximation algorithm for the Combinatorial Motion ...
12/12/2012

Distributed Planning in Hierarchical Factored MDPs

We present a principled and efficient planning algorithm for collaborati...
01/22/2017

Correct Convergence of Min-Sum Loopy Belief Propagation in a Block Interpolation Problem

This work proves a new result on the correct convergence of Min-Sum Loop...
04/29/2018

Learning Data Dependency with Communication Cost

In this paper, we consider the problem of recovering a graph that repres...
02/03/2016

A Probabilistic Modeling Approach to Hearing Loss Compensation

Hearing Aid (HA) algorithms need to be tuned ("fitted") to match the imp...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

This work has been accepted to the IEEE 2021 International Conference on Robotics and Automation (ICRA).    The published version may be found at https://doi.org/10.1109/ICRA48506.2021.9561533.

Kinematic motion planning focuses on finding a trajectory in a robot’s configuration space from start state to goal state while satisfying multiple performance criteria such as collision avoidance, joint limit constraints and trajectory smoothness. There are several motion planning approaches that have been proposed so far. These approaches can be roughly divided into two broad categories: sampling-based algorithms and optimization-based algorithms. Sampling-based algorithms [1, 2, 3] efficiently find collision free trajectories by probing the configuration space and checking the feasibility of robot’s configuration. However, trajectories produced by sampling-based algorithms are not smooth and therefore require further post processing.

Trajectory optimization algorithms [4, 5, 6] start with an initial trajectory that may not be collision-free and then minimize an objective function that penalizes collisions and non-smooth configurations. A drawback of these approaches is that they only tend to find locally optimal solutions and need fine-discritization of trajectory into way points for collision checking in complex environments. GP formulation of continuous-time trajectories [7] can overcome this challenge.

(a)
(b)
(c)
(d)
Fig. 1: Different Robot configurations during MS2MP planning phase for an autonomous disassembly setup: (a) at , (b) at , (c) at , (d) at .

Recently, the GPMP2 framework [8] has been proposed that represents trajectory as a GP and finds collision-free trajectories with fast, structure-exploiting inference. It fuses all the planning problem objectives which are represented as factors and solves non-linear least square optimization problem via numerical (Gauss-Newton or Levenberg-Marquardt) methods. Although, GPMP2 is fast but the batch non-linear least square optimization approach makes it vulnerable to converging to in-feasible local minima. The approach to combine all the factors of the graph makes it faster than state of the art motion planning algorithms but it comes at the cost of being more prone to getting stuck in local minima. Graph re-optimization could naively help to get out of the in-feasible local minima but it increases the computation time.

In this work, we explore the min-sum algorithm for finding the MAP estimation of a motion planning problem on factor graph. However, min-sum cannot be efficiently adopted due to the non-linear factors of probabilistic motion models. So, we propose a hybrid algorithm called MS2MP that combines numerical optimization methods with min-sum message passing algorithm to solve non-linear factors for MAP estimation. MS2MP combines all the factors attached to the same variable node to form a compound factor node. Then, the messages are passed among adjacent factor and variable nodes to find the MAP estimation of complete graph that generates collision-free trajectories.

Ii Related Work

The probabilistic inference view on motion planning is introduced by Toussaint et al. [9, 10]. The motion planning problem is formulated as a probabilistic model which represents the performance criteria (e.g. avoiding obstacles, reaching a goal) as objectives and use probabilistic inference to compute a posterior distribution over possible trajectories. Belief propagation is proposed to solve the approximate inference problem of finding feasible trajectories while factor graphs are used to represent the planning problem.

The GP formulation of continuous-time trajectories [7] made the probabilistic view on motion planning problem more lucrative because it offers sparse parametrization of the trajectory. Here, a GP is used to represent trajectories as functions that map time to the robot state which provides the benefit of querying the trajectory at arbitrary time steps by exploiting the Markov property of GP priors produced from LTV-SDE. Recently, B-spline [11] and kernel methods [12] have been used in a similar manner to represent trajectories with fewer states in motion planning problems.

The formulation of continuous-time trajectory as GP paved the way to consider an alternative approach for solving the inference problem on factor graph. The GPMP2 algorithm combines all the factor nodes and solves the inference problem using batch numerical optimization approach. Simultaneous Localization and Mapping (SLAM) problems [13] have been also solved in the similar manner. The algorithm often converges to in-feasible local minima due to the holistic approach of solving factor graph and results in trajectories that are not collision-free. In case of batch optimization, several ideas like random initializations and graph-based initialization [14] exist to improve results but they do not deal with the inherent approach of combining all factors and optimizing it at once.

Intuitively, the better approach is to evaluate each node of the factor graph separately to obtain improved results. This is the standard characteristic of message passing algorithms, which in its purest form, allows in-place inference on a factor graph with entirely local processing at graph nodes. Over the past few years, there has been an increased interest in a message passing based optimization algorithm for graphical models, called min-sum message passing algorithm [15, 16]

. Message passing algorithms have been used to solve NP-hard combinatorial optimization problems 

[17, 18]. The min-sum algorithm is equivalent to the max-product algorithm, and is closely related to belief propagation also known as sum-product algorithm [19].

We build upon the success of min-sum message passing algorithm for general factor graphs and thus give an outline how this method can be adopted for GP-based motion planning problems. We transform the factor graph by introducing compound factor nodes and then optimize each node locally to generate messages to compute MAP estimation of the factor graph.

Iii Problem Formulation

Suppose a trajectory is represented by , where D is the dimensionality of the state. is the prior on that actually encourages smooth trajectories and fixes start and goal states, is the likelihood of states representing collision-free events on the trajectory. For example, could be a binary event with if trajectory is collision-free and if trajectory is in collision. Given the prior and likelihood, the optimal trajectory is found by the MAP estimation, which generates the trajectory that maximizes the conditional posterior ,

(1)

The posterior distribution can be equivalently formulated as MAP inference problem on a factor graph. Factor graph formulation for motion planning problem (1) is described in detail in the following section.

Iii-a Factor Graph Formulation

Fig. 2: An example trajectory planning problem formulation on a factor graph. White circles show support states and square boxes show factors.

The motion planning problem formulation in (1) consists of two components, prior and likelihood. Our objective is to find a trajectory parameterized by that satisfies collision-free events ‘’.

The continuous-time trajectory prior is represented as functions sampled from GP [7]. GP based trajectory priors offer the benefit of representing the full trajectory by means of support states

. Given these, a trajectory can be efficiently interpolated between two consecutive support states through Gaussian Process regression (GPR). Similar to prior work

[8], we assume

to follow a joint Gaussian distribution

(2)

for a set of times , where

is a mean vector and

is the covariance kernel. The kernel induces smoothness and puts constraints on start and goal states. We follow [7] by considering a structured kernel generated from LTV-SDE, such that the GP prior of results in

(3)

where

is the Mahalanobis distance. The likelihood function which specifies the probability of avoiding obstacles is also defined as a distribution in the exponential family. The collision-free likelihood is

(4)

where represents the obstacle cost, and

is a hyperparameter matrix.

In the context of GP-based motion planning, we need to model a belief over continuous, multivariate random variables

. It can be formulated on a factor graph using conditional PDF over the variables , given the constraints . The bipartite graph factorizes the conditional distribution over as

(5)

given a subset of factor nodes on an adjacent subset of variable nodes , that are set in relation via the edges of the factor graph. Fig. 2 shows an example factor graph for a motion planning problem with support states that describe a collision-aware motion planning problem. Thus, the prior is factorized as

(6)

where and put constraints on fixing the start state and goal state . Constraining the deviation from the prior is included via

(7)

in case they are not colliding with obstacles, while the GP prior of the trajectory is incorporated via

(8)

using state transition matrix and power spectral density matrix as introduced in [7].

The collision-free likelihood is factorized with two types of factors, unary obstacle factors and interpolated binary obstacle factors as

(9)

where is the number of interpolated states between two consecutive support states , and is the interpolation time. The unary obstacle factor at each support state is defined according to (4). The interpolated binary obstacle factor is defined as

(10)

The interpolated binary obstacle factor accumulates the collision cost at interpolated states . This cost information is utilized to update the associated support states by solving MAP inference problem on the factor graph.

Iv MAP Inference via Min-Sum Message passing

Given as a set of Gaussians, (5) results in a product of Gaussians. Thus, finding the most probable values for

is equivalent to minimizing the negative log of the probability distribution via

(11)

As the individual factors are nonlinear, it is in-feasible to apply min-sum directly to solve the optimization problem in (11). It requires to linearize factors at each step resulting high computation cost. However, we propose to explicitly alter the factor graph structure by introducing compound factor nodes and then adopt the min-sum algorithm in which a local node objective function is optimized using the Gauss-Newton method. Our proposed algorithm decreases the tendency of converging to local minima due to distributed approach, while containing the convergence properties, as shown in Appendix A. In the following, the concept of compound factor nodes is outlined in detail.

Iv-a Factor Graph with Compound Factor Nodes

(a)
(b)
(c)
Fig. 3: (a) Complete factor graph structure (b) Factors attached to same variable nodes are combined together to form a compound factor nodes. Then, in (c), a linear graph structure is shown. Unary factors attached to variable nodes are not shown explicitly for clarity. Instead, we show that graph consists of self-potentials and edge-potentials .

The goal of introducing compound factor nodes is to reshape general factor graphs into a linear representation with unique edges between nodes by combining individual factors as exemplarily shown in Fig. 3 for the graph from Sec. III-A.

Assumption 1

A motion planning problem can be fully described by a factor graph with consisting of two types of factors, unary factors and binary factors connected to two consecutive variables , where and .

Definition 1 (Compound factor node)

Based on assumption 1, a compound unary factor node is defined as

(12)

also denoted as self-potential and binary compound node

(13)

as the edge-potential of the current graph.

Given Definition 1,  (11) results in

(14)

The particular linear representation of factor graph, shown on the right hand side of Fig. 3 is a pair-wise factor graph. Here, min-sum algorithm allows to solve the pair-wise factor graph by iteratively passing messages among nodes.

Iv-B Min-sum Messages Equations

Data: trajectory prior , factor graph , number of support states
Result: optimized trajectory
Init()
  Initialize messages from prior
/* Compound Factor Node Formation (Def. 1) */
for  do
      
for  do
      
/* Min-sum messages calculation */
for  do
       /* get variable to factor messages */
       /* get factor to variable messages */
      
        see (16)
       /* update (belief) state */
      
      
return
Algorithm 1 MS2MP: Min-Sum Message Passing Algorithm for Motion Planning

In the min-sum algorithm, each node solves a local optimization problem and traverses messages to the adjacent nodes. Namely, we differentiate between messages passed from variables to factor nodes, denoted as , and messages passed form factor nodes to variable nodes, denoted as . Denoting the adjacent nodes of a factor node as and the adjacent nodes of a variable node as , the messages are iteratively updated according to

(15)
(16)

where notates the set-theoretic difference, i.e. the set of factor nodes except the factor . From Algorithm 1, at time-step , all the messages from variable nodes to factor nodes are initialized according to the prior in (15). In the next step, the min-marginal of is calculated in (16). Given the messages from adjacent factor nodes, the belief of a variable node is approximated via

(17)

The minima of decision variable at iteration is

(18)

At each iteration , each node optimizes a local objective function by merging incoming messages into the node.

We use numerical optimization similar to [8, 13] to solve the local non-linear objective function. Since, each local objective function is composed of multiple factors, (16) and  (18) take the form of non-linear least-square problem as

(19)
(20)

We use the Gauss-Newton algorithm to solve the optimization problems in (19) and (20). Note that our proposed algorithm is different in two aspects from GPMP2 [8]: first, the batch optimization of complete graph is replaced by an iterative local optimization of each node, secondly, message passing is performed to achieve the optimization of the complete factor graph. This behaviour is in fact helpful in avoiding collisions for planning problems when robot has to find its way out of obstacle-rich environment as we empirically show in the experimental validation in the following section.

Fig. 4: Planned trajectory using MS2MP for a 6 DOF COMAU Racer 5 robot.

V Evaluation

We evaluated our algorithm on an exemplary motion planning task in a lab environment. Precisely, a 6 DOF COMAU Racer 5 robot is tasked to find collision-free trajectory from the inside of the body of a PC-tower as part of an autonomous disassembly process of Electrical and Electronic equipment. The applicability of the proposed algorithm is also evaluated on the robot platform visualized in Fig. 1. We ran benchmark evaluations against GPMP2 in a simulated scenario. 111For a detailed comparison of GPMP2 against recent state-of-the-art motion planners, we refer the reader to [8], where an extensive benchmark comparison has been outlined already. The simulation scenario is shown in Fig. 4, where the PC-tower is approximated by an occupancy mesh. In this section, we discuss the implementation and evaluation details of our algorithm.

V-a GP Prior

We use a constant-velocity prior similar to [8] with the Markovian state consisting of configuration position and velocity. The trajectory is generated from LTV-SDE [7]. The prior factors for the experiment are presented in (6).

V-B Collision-free likelihood

Similar to recent state-of-the art motion planning algorithms, e.g. [4, 8], the robot collision body is represented by a set of spheres. We formulate the collision-free unary and binary factors following (9). The obstacle cost function is then obtained by computing the hinge loss

(21)

for the spheres. In (21) represents the signed distance from the sphere to the closest obstacle surface in the workspace, and is a safety distance. increases the sensitivity of the obstacle constraint before collision can occur. Non-zero obstacle-cost addition enables the robot to not reach too close to the obstacles. For likelihood in (4), the parameter is defined as

(22)

where the parameter is used to add weight to the obstacle cost.

V-C Experiment Setting

Prior trajectory is initialized by a constant velocity straight line from start state to goal state. We initialized the trajectory with support states and 4 additional interpolated states between two consecutive support states. In our benchmarks we set for COMAU Racer arm. The term puts weight on observing the obstacles and it is set according to the planning problem. we set for our manipulator planning tasks.

We evaluated the proposed algorithm for 24 unique planning problems for different start configurations inside the PC tower. To make the planning problem much harder the start configurations have been kept very close to the body of PC tower. MS2MP extends the Matlab toolbox from GPMP2 and has thus been benchmarked using identical framework. The benchmarks have been run on a 3.90GHz Intel Core i3-7100 CPU.

V-D Discussion

Success (%) Average time () Max. time ()
MS2MP 83.3 0.1028 0.1751
MS2MP-no-comp 91.6 0.5625 0.8213
GPMP2 70.8 0.3772 0.3962
GPMP2-no-intp 66.7 0.2724 0.2873
TABLE I: Results of 24 planning problems for 6-DOF COMAU Racer robot

Table I summarizes results for 24 planning problems where a robot has to find its way out of an obstacle-rich environment. MS2MP is more successful in finding collision-free trajectories compared to GPMP2 with only approximately a third of the run-time. GPMP2 leads to an early termination of the optimization algorithm due to an increase in absolute error. In this case, a re-optimization of the graph is required in order to naively overcome in-feasible local minima. It results in increased run-time for finding collision-free trajectories. However, GPMP2 will still be faster with less success rate if we do not consider the re-optimization step.

We observe that local optimization step at each compound node increases the sensitivity of obstacle avoidance resulting in better success rate in case of MS2MP. A drawback of this approach is that the increased sensitivity towards obstacles affects the trajectory smoothness. In order to overcome this drawback, an additional unary prior factor is introduced in (6) that induces smoothness in case of MS2MP. MS2MP-no-comp has the highest success rate because each non-linear factor is linearized at every message passing step. It results in high computation cost, almost double the run-time as compared to GPMP2 and the output trajectory is not very smooth. We also benchmarked our algorithm against GPMP2 without interpolation (GPMP2-no-intp) with the same number of support states and no interpolated states. Although, its faster than GPMP2, the success rate is lowest among all the evaluated algorithms. We refer the reader to the accompanying video that shows a trajectory planned by MS2MP.

Vi Conclusions

Formulation of motion planning problems on factor graphs has set the stage for applying different approaches to generate feasible and smooth trajectories. We build upon the idea of GPMP2 using factor graphs in order to represent a motion planning inference problem. However, a drawback of existing work is that by fusing all factors in the graph and solving a global nonlinear least square problem tends to converge to in-feasible local minima. This tendency increases with the complexity of motion planning problem. We believe that this problem can be avoided using message passing techniques.

Message passing is a strong algorithmic framework for solving MAP estimation problem on factor graphs by performing local computations at each node. We proposes an algorithm called MS2MP for finding collision-free trajectories. It performs local computations at individual nodes, thus decreases the chances of converging to in-feasible local minima. A major benefit of MS2MP is that it can be extended to an incremental method that allows planning in dynamic environments, where each node is optimized online. An added benefit of message passing approach is the possibility of performing parallel computation acorss the graph nodes that can further reduce planning time significantly. For future work, we are considering to investigate the incremental planning and parallel computation of the proposed algorithm.

Appendix A

Vi-a Convergence Analysis

The min-sum algorithm converges to the global optimum for tree-structured graphs. However, in our proposed algorithm min-sum message passing differs in two aspects. First, we introduce compound factor nodes by merging factors connected to same variable node(s). Secondly, we have non-linear factors. The crucial point in solving the inference problem for non-linear factors is that at each iteration , and form local objective functions by combining incoming messages into the node. The MAP estimation using the min-sum algorithm often fails to converge if the single node local optimization fails to find a unique solution. Its not possible to construct directly if the local node objective function has more than one optimal solution [20]. For this reason, we assume that the local node objective function has a unique minimum.

Assumption 2

For each node with self-potential and edge-potential , where and , the solution produced by numerical optimization of local node objective function always converges to a unique optimum point.

Based on Assumption 2, the obtained beliefs are the min-marginals of the function . Similar to max-marginal local optimality condition [20], we can also define local optimality for the compound factor nodes in the graph.

Definition 2 (Local optimality - compound factor nodes)

Solution obtained from a local node objective function is locally optimal (min-consistent) according to [21] if for all nodes ,

(23)
Remark 1

For a factor graph , if the local node optimization converges to unique solution , then the node is eliminated from the overall graph with the remaining graph [20, proposition 1]. Proceeding in the same manner will result in the the optimized .

Proposition 1

For a linear-structured factor graph with compound factor nodes, if there exists a unique which is the optimum point for node then for the global objective function (14), the min-sum message passing algorithm converges to a together which optimizes entire graph.

Proof.

In order for the full graph converging to a solution, the set of open nodes in the graph needs to hold , where is initialized by all nodes in the graph. Thus, given the linear-structured factor graph , where each node possesses self and egde-potential functions, the iterative optimization of the min-sum algorithm is run in a monotonically increasing or decreasing manner. Based on Remark 1, individual nodes are removed from in an ordered sequence, thus eventually obtaining for for . Referring to Definition 2, the obtained graph directly allows to obtain the converged trajectory. ∎

Acknowledgment

The research leading to these results has received funding from the Horizon 2020 research and innovation programme under grant agreement 820742 of the project ”HR-Recycler - Hybrid Human-Robot RECYcling plant for electriCal and eLEctRonic equipment”.

References

  • [1] L. E. Kavraki, P. Svestka, J. Latombe, and M. H. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE Trans. Robotics Autom., vol. 12, no. 4, pp. 566–580, 1996.
  • [2] J. J. K. Jr. and S. M. LaValle, “RRT-connect: An efficient approach to single-query path planning,” in Proceedings of the 2000 IEEE International Conference on Robotics and Automation, ICRA 2000, San Francisco, CA, USA, April 24-28, 2000.   IEEE, 2000, pp. 995–1001.
  • [3] S. M. LaValle, Planning Algorithms.   Cambridge University Press, 2006.
  • [4] N. D. Ratliff, M. Zucker, J. A. Bagnell, and S. S. Srinivasa, “CHOMP: gradient optimization techniques for efficient motion planning,” in 2009 IEEE International Conference on Robotics and Automation, ICRA 2009, Kobe, Japan, May 12-17, 2009.   IEEE, 2009, pp. 489–494.
  • [5] M. Kalakrishnan, S. Chitta, E. A. Theodorou, P. Pastor, and S. Schaal, “STOMP: stochastic trajectory optimization for motion planning,” in IEEE International Conference on Robotics and Automation, ICRA 2011, Shanghai, China, 9-13 May 2011.   IEEE, 2011, pp. 4569–4574.
  • [6] C. Park, J. Pan, and D. Manocha, “ITOMP: incremental trajectory optimization for real-time replanning in dynamic environments,” in Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012, Atibaia, São Paulo, Brazil, June 25-19, 2012.   AAAI, 2012, pp. 207–215.
  • [7] T. D. Barfoot, C. H. Tong, and S. Särkkä, “Batch continuous-time trajectory estimation as exactly sparse Gaussian process regression,” in Robotics: Science and Systems X, University of California, Berkeley, USA, July 12-16, 2014, D. Fox, L. E. Kavraki, and H. Kurniawati, Eds., 2014.
  • [8] M. Mukadam, J. Dong, X. Yan, F. Dellaert, and B. Boots, “Continuous-time Gaussian process motion planning via probabilistic inference,” Int. J. Robotics Res., vol. 37, no. 11, pp. 1319–1340, 2018.
  • [9] M. Toussaint, “Robot trajectory optimization using approximate inference,” in

    Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009

    , ser. ACM International Conference Proceeding Series, A. P. Danyluk, L. Bottou, and M. L. Littman, Eds., vol. 382.   ACM, 2009, pp. 1049–1056.
  • [10] M. Toussaint and C. Goerick, “A bayesian view on motor control and planning,” in From Motor Learning to Interaction Learning in Robots, ser. Studies in Computational Intelligence, O. Sigaud and J. Peters, Eds.   Springer, 2010, vol. 264, pp. 227–252.
  • [11] M. Elbanhawi, M. Simic, and R. N. Jazar, “Randomized bidirectional b-spline parameterization motion planning,” IEEE Trans. Intell. Transp. Syst., vol. 17, no. 2, pp. 406–419, 2016.
  • [12] Z. Marinho, B. Boots, A. D. Dragan, A. Byravan, G. J. Gordon, and S. S. Srinivasa, “Functional gradient motion planning in reproducing kernel hilbert spaces,” in Robotics: Science and Systems XII, University of Michigan, Ann Arbor, Michigan, USA, June 18 - June 22, 2016, D. Hsu, N. M. Amato, S. Berman, and S. A. Jacobs, Eds., 2016.
  • [13] F. Dellaert and M. Kaess, “Square root SAM: simultaneous localization and mapping via square root information smoothing,” Int. J. Robotics Res., vol. 25, no. 12, pp. 1181–1203, 2006.
  • [14] E. Huang, M. Mukadam, Z. Liu, and B. Boots, “Motion planning with graph-based trajectories and Gaussian process inference,” in 2017 IEEE International Conference on Robotics and Automation, ICRA 2017, Singapore, Singapore, May 29 - June 3, 2017.   IEEE, 2017, pp. 5591–5598.
  • [15] C. C. Moallemi and B. V. Roy, “Convergence of min-sum message passing for quadratic optimization,” IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 2413–2423, 2009.
  • [16] J. Yedidia, “Message-passing algorithms for inference and optimization,” J. Stat. Phys., vol. 145, no. 4, pp. 860–890, 11 2011.
  • [17] R. G. Gallager, “Low-density parity-check codes,” IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 21–28, 1962.
  • [18] T. J. Richardson and R. L. Urbanke, “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599–618, 2001.
  • [19] J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Generalized belief propagation,” in Advances in Neural Information Processing Systems 13, Papers from Neural Information Processing Systems (NIPS) 2000, Denver, CO, USA, T. K. Leen, T. G. Dietterich, and V. Tresp, Eds.   MIT Press, 2000, pp. 689–695.
  • [20] M. J. Wainwright, T. S. Jaakkola, and A. S. Willsky, “Tree consistency and bounds on the performance of the max-product algorithm and its generalizations,” Stat. Comput., vol. 14, no. 2, pp. 143–166, 2004.
  • [21] N. Ruozzi and S. Tatikonda, “Message-passing algorithms: Reparameterizations and splittings,” IEEE Trans. Inf. Theory, vol. 59, no. 9, pp. 5860–5881, 2013.