## Abstract

Robots working in human environments often encounter a wide range of articulated objects, such as tools, cabinets, and other jointed objects. Such articulated objects can take an infinite number of possible poses, as a point in a potentially high-dimensional continuous space. A robot must perceive this continuous pose to manipulate the object to a desired pose. This problem of perception and manipulation of articulated objects remains a challenge due to its high dimensionality and multimodal uncertainty. Here, we describe a factored approach to estimate the poses of articulated objects using an efficient approach to nonparametric belief propagation. We consider inputs as geometrical models with articulation constraints and observed RGBD (red, green, blue, and depth) sensor data. The described framework produces object-part pose beliefs iteratively. The problem is formulated as a pairwise Markov random field (MRF), where each hidden node (continuous pose variable) is an observed object-part’s pose and the edges denote the articulation constraints between the parts. We describe articulated pose estimation by a “pull” message passing algorithm for nonparametric belief propagation (PMPNBP) and evaluate its convergence properties over scenes with articulated objects. Robot experiments are provided to demonstrate the necessity of maintaining beliefs to perform goal-driven manipulation tasks.

## INTRODUCTION

Robots working in human environments often encounter a wide range of articulated objects, such as tools, cabinets, and other kinematically jointed objects. For example, the cabinet with three drawers shown in Fig. 1 functions as a storage container. To accomplish storage and retrieval tasks on this container, a robot would need to perform a sequence of open and close actions on the various drawers. Executing such tasks involves repeated sense-plan-act phases, which occur under uncertainty in the robot’s observations and demand a pose estimation framework capable of tracking this uncertainty. The presence of observation uncertainty and environmental occlusions poses a challenge for robots attempting to model cluttered human environments.

In addition, the occurrence of partial sensor observation due to self and environmental occlusions makes the inference problem multimodal. Further, as the number of object parts in the environment grows, the inference problem becomes high dimensional.

Pose estimation methods have been proposed that take a generative approach to this problem (*1*, *2*, *3*). These methods aimed to explain an observed scene as a collection of rigid body poses using a particle filter formulation to iteratively maintain belief over possible states. Although these approaches held the power of modeling the world generatively, they have an inherent drawback of scaling inefficiently when the number of rigid bodies being modeled increases. Here, we focus on overcoming this drawback by factoring the state as individual rigid bodies (object parts) constrained by their articulations to create an efficient inference framework for pose estimation.

In existing literature, particular focus has been placed on addressing the task of estimating the kinematic models of articulated objects by a robot through interactive perception (*4*). Hausman *et al*. (*5*) proposed a particle filtering approach to estimate articulation models and plan actions that reduce model uncertainty. In (*6*), Martin *et al.* suggested an online interactive perception technique for estimating kinematic models by incorporating low-level point tracking and mid-level rigid body tracking with high-level kinematic model estimation over time. Sturm *et al*. (*7*, *8*) addressed the task of estimating articulation models in a probabilistic fashion by human demonstration of manipulation examples.

All of these approaches discover the articulated object’s kinematic model by alternating between action and sensing and are important methods for a robot to reliably interact with novel articulated objects. Here, we assumed that such kinematic models, once learned for an object, can be reused to localize their articulated pose under real-world ambiguous observations. The method proposed in this paper could complement the existing body of work toward task completion in unstructured human environments.

Generative methods exploiting articulation constraints are widely used in human pose estimation problems (*9*, *10*, *11*) where human body parts have constrained articulation. We took a similar approach and factored the problem using a Markov random field (MRF) formulation, where each hidden node in the probabilistic graphical model represents an observed object-part’s pose (continuous variable), each observed node indicates the information observed from a particular object part, and each edge in the graph denotes the articulation constraint between a pair of parts. Inference on the graph was performed using a message-passing algorithm that shared information between the parts’ pose variables, to produce their pose beliefs, collectively giving the estimated state of the articulated object.

Many algorithms have been proposed to compute the joint probability of an MRF. For tree-structured graphs, belief propagation algorithms are guaranteed to converge. For graph structures with loops, the loopy belief propagation (*12*) has been empirically proven to perform well for discrete variables. The problem becomes nontrivial when the variables take continuous values. Nonparametric belief propagation (NBP) by Sudderth *et al*. (*13*) and particle message passing (PAMPAS) by Isard (*14*) provided sampling approaches to perform belief propagation with continuous variables. Both approaches approximated a continuous function as a Gaussian mixture and used local Gibbs sampling to approximate the product of mixtures. However, these methods can hardly be generalized to three-dimensional (3D) articulated pose estimation problems because of their high computational expense. Here, we propose a more efficient “pull” message passing algorithm for nonparametric belief propagation (PMPNBP). The key idea of message updating is to evaluate samples taken from the belief of the “pull” receiving node with respect to the densities informing the sending node. The approximation of mixture products can be performed individually per sample and then normalized into a distribution. Our method avoids the computational pitfalls of “push” updating used in NBP (*13*) and PAMPAS (*14*), and we show that our method could be used for 3D articulated pose estimation with compelling examples.

Some recent works have addressed the computational efficiency of NBP. Similar in spirit to our PMPNBP, Ihler and McAllester (*15*) described a conceptual theory of particle belief propagation, where a target node’s samples were used to generate a message going from the source to the target. This work emphasized the advantages of using large number of particles to represent incoming messages, along with theoretical analysis. It used an expensive iterative Markov chain Monte Carlo sampling step, mimicking the Gibbs sampling step in NBP (*14*, *13*). PMPNBP is able to avoid this cost through a resampling step with linear computational cost. Specifically, our complexity is *O*(*DM*) in computing a message mixture of *M* components using *D* incoming mixtures as compared with *O*(*DKM*^{2}) of NBP (*14*, *13*) with *K* Gibbs iterations.

Kernel-based methods have been proposed to improve the efficiency of NBP. Song *et al*. (*16*) proposed a kernel belief propagation method. Messages in this work were represented as functions in a reproducing Kernel Hilbert space (RKHS), and message updates are linear operations in RKHS. Results presented in this work claimed to be more accurate and faster than NBP with Gibbs sampling (*14*, *13*) and particle belief propagation (*15*) over applications such as image denoising, depth prediction, and angle prediction in a protein-folding problem. Their complexity was *O*(*D*_{max}*L*^{2}) with *L* being the number of basis vectors in kernel space and *D*_{max} being maximum degree of a node in the graphical model. We consider comparisons with kernel-based approximators a direction for future work.

Han *et al*. (*17*) introduced sequential density approximation by mode propagation to approximate the slow sampling-based products in NBP (*14*, *13*). The complexity of the sequential density approximation was *O*(*M*^{4}(*D* − 1)). However, their approach was limited to non-occluded observations unlike the NBP methods (*14*, *13*). We evaluated our PMPNBP algorithm’s convergence characteristics and computational gain over PAMPAS (*14*) on their 2D articulated pattern estimation. We empirically show that PMPNBP enabled faster convergence to comparable convergence characteristics. This greater scaling of message mixture components for improved accuracy makes PMPNBP applicable to 3D articulated object pose estimation for robot manipulation tasks.

For estimating the pose of the 3D articulated objects, our system took a 3D point cloud from sensor measurement and an object geometry model in the form of a URDF (Unified Robot Description Format) as input and outputs belief samples in the continuous pose domain. We used these belief samples to compute a maximum likelihood estimate (MLE) of an object-part’s pose enabling the robot to act on the object. The performance of the system was evaluated by articulated object pose estimation experiments and comparisons with a traditional particle filter baseline. This baseline is similar to the iterative generative inference methods (*1*, *2*, *3*) used in object pose estimation. The quantitative evaluation in comparison to particle filter baseline shows that PMPNBP has better convergence characteristics under various occlusion scenarios. The MRF-based factored formulation of PMPNBP let the observed parts of the articulated objects maintain reasonable belief over the parts that were occluded. In addition to this comparison, we qualitatively show the scalability of the PMPNBP to articulated objects with a large number of nodes and edges by estimating the pose of a Fetch robot.

A simple task is illustrated to show how the belief propagation informs a task planner to choose an information gain action and overcome uncertainty in the perceptual estimation. This task shows the benefit of the belief propagation approach toward manipulation tasks.

Contributions of this paper include (i) proposal of an efficient belief propagation algorithm (PMPNBP), (ii) qualitative and quantitative comparisons of PMPNBP with PAMPAS (*14*), (iii) articulated object pose estimation experiments and comparisons with traditional particle filter baseline, and (iv) a belief representation from perception to inform a task planner.

## RESULTS

In this section, we show the results on pose estimation of articulated objects, followed by robot experiment illustrating the benefits of belief propagation. We then show the comparison of the proposed PMPNBP algorithm with PAMPAS (*14*) and discuss the computational gain obtained.

### Articulated cabinet pose estimation

We first show pose estimation results of the cabinet in Fig. 1 using the PMPNBP algorithm proposed in this paper. Because three drawers are prismatically jointed with the cabinet frame, the whole cabinet could be abstracted using an MRF with four hidden nodes and four observed nodes (Fig. 2). Messages between each pair of connected hidden nodes were represented in 400 particles, where each particle represented the pose of the receiving node. The RGB (red, green, and blue) observation (Fig. 3A) was only used for illustrative purpose here, whereas the corresponding point cloud (Fig. 3B) observed by the sensor was used as input without any segmentation. Belief particles for each part of the cabinet, which were uniformly initialized on the entire point cloud, gradually converged close to the ground truth (Fig. 3C) after 100 iterations. We used the MLE of each part to compose the final pose of the cabinet (Fig. 1D). PMPNBP is an iterative message-passing algorithm, and the belief particles propagate to match the observation while maintaining the articulation constraint.

We compared our PMPNBP method with a standard particle filter method, which is a commonly used iterative algorithm for pose estimation problems (*1*, *2*, *3*). We implemented a Monte Carlo localization (particle filter) method that included an object-specific state representation. For example, the cabinet with three drawers has a state representation of (*x*, *y*, *z*, φ, ψ, χ, *t _{a}*,

*t*,

_{b}*t*), where the first six elements describe the 6D pose of the object in the world and

_{c}*t*,

_{a}*t*,

_{b}*t*represent the prismatic articulation. The measurement model in the implementation used the unary potential described in the “Potential functions” section. Instead of rendering a point cloud of each object part, the entire object in the hypothesized pose was rendered for measuring the likelihood in the particle filter. Because the observations were static, the action model in the standard particle filter was replaced with a Gaussian diffusion over the object poses. With the same number of particles (400) for both the proposed PMPNBP and the baseline Monte Carlo localization, we ran the belief propagation for 100 iterations. The entire point cloud measurement was used as the observation for all object parts. With the same point cloud observation and experiment settings, we ran the inference 10 times to generate the convergence plot. Figure 3E shows the mean and variance in error across iterations. The proposed method has better convergence properties with respect to the particle filter baseline. Especially when the cabinet suffered from external occlusion (blanket on the cabinet frame), the particle filter often fell into local minima and hardly recovered. The state representation of the particle filter was specific to the articulated object (cabinet), and the length of this representation grew polynomially with the number of links. This makes the search space of the particle filter grow exponentially. For the cabinet case, the run time of the particle filter was faster comparable to PMPNBP; however, the convergence was often to a local minima compared with PMPNBP. We point out that, when the scene scales with multiple objects with and without articulations, it will not be feasible to use particle filter due to its exponential growth in search space.

_{c}To calculate the error in the estimation with respect to the ground truth, we used the average distance metric (ADD) proposed in (*18*, *19*). The point cloud model of the object part was transformed to its ground truth pose [dual quaternion (*dq*)] and to the estimated pose [dual quaternion (*dq _{c}*) are the conjugates of the dual quaternions (

*20*,

*21*) and

*m*is the number of 3D points in the model set M. Dual quaternions were used to represent the transformations for efficient implementation. We show that our PMPNBP method achieved better convergence than the particle filter method (Fig. 3D).

### Pose estimation results on partial and incomplete observations

Articulated models often suffer from self-occlusions and environmental occlusions. By exploiting the articulated constraints, our inference method was able to give a physically plausible estimate that could explain the partial observations. We used two compelling examples that show the strength of our PMPNBP method (Fig. 4). In the first example (Fig. 4, A to D), we used the same cabinet as shown in previous sections. This time, half of the cabinet was occluded by a blanket, which made the observed point cloud noisy. The PMPNBP method was able to handle the occlusion and gave a plausible pose estimation within 100 iterations. Additional qualitative results are shown in fig. S3. Estimating the pose of a Fetch robot (Fig. 4, A to D) is a more complicated task. A cabinet only has prismatic joints, whereas the Fetch robot has many revolute joints as well. The abstracted graphical model of the Fetch robot consists of 12 nodes and 11 edges (see fig. S4). Our factored pose estimation method can scale to objects with a large number of links and joints. Although the robot contains self-occlusion, because many parts of the robot overlap with each other, the PMPNBP method was still able to accurately estimate its pose of the robot by passing messages for 1000 iterations. Furthermore, the algorithm was capable of handling complete occlusions of robot links. This is illustrated in fig. S5, where a robot link was completely not visible due to simulated occlusion and the algorithm was still able to estimate the link’s pose.

### Benefits of maintaining belief toward planning actions

One advantage of using a belief propagation method instead of a discriminative pose estimation method is that it maintains the beliefs of the estimation. We show how the beliefs aid in robot planning with an example shown in Fig. 5. The robot was performing a task of storing elements in the bottom drawer. Before taking any action to open the drawer, the robot perceived the scene first. With the initial camera setting (Fig. 5A), the robot estimated the pose of the cabinet (Fig. 5B), along with the covariance of the belief particles for each part (Fig. 5C). The covariance represents the uncertainty of pose estimation. A large covariance means a large uncertainty in the estimation. A maximum threshold (2.5 cm) was set on the standard deviation (SD) of (*x*, *y*, *z*) dimensions to decide whether the robot has to change for a better viewpoint.

In this case, the robot was not certain about the estimation because the SD was greater than the threshold. The robot then took an intermediate action (looking down) to provide a new observation of the cabinet (Fig. 3D). With the new observation, the robot estimated the pose again (Fig. 3E). This time, the robot was certain that the bottom drawer was closed because the SD dropped below the threshold (Fig. 3F), and the robot performed an action to open the bottom drawer (Fig. 3, G and H). This is an illustration of how the maintained beliefs can be used in robot planning. In the future work, we plan to characterize the properties of covariance in the estimation with respect to the algorithm parameters (number of particles and iterations).

### Comparison with an existing nonparametric belief propagation method

Existing message-passing methods (*7*, *8*) represent message as a mixture of Gaussian components and provide Gibbs sampling–based techniques to approximate message products. We compared our proposed PMPNBP method with PAMPAS (*14*) on their 2D illustrative example (Fig. 4). The pattern has a circle node with state variable *X*_{1} = (*x*_{1}, *y*_{1}, *r*_{1}) denoting its position in the 2D image and the radius of the circle. This circle node has four arms with two links each. These links are nodes in the graph with state variables *X _{i}*(

*x*,

_{i}*y*, α

_{i}*,*

_{i}*w*,

_{i}*h*). The links connected to the circle are indexed as 2 ≤

_{i}*i*≤ 5 with their connected outer links as

*j*=

*i*+ 4.

We show the convergence of the PMPNBP on two examples both qualitatively and quantitatively in Fig. 7. The pattern referred in Fig. 6 was placed in a clutter made of 12 circles and 100 rectangles (Fig. 7A). There are 16 messages, i.e., 4 from circle to inner links, 4 from inner links to circle, 4 from inner links to outer links, and 4 from outer to inner links. The initialization of the messages was done with *M* = 75 particles at (*x*, *y*) locations of the image, where the unary potential was greater than 0.4. This was assumed to be the coarse feature detection of the circle and rectangles in the image replicating the initialization in (*14*). In the future iterations, the message had 50% of the samples uniformly sampled in the image to keep exploring, and the other 50% of the samples were sampled from the marginal belief. For the first example with no occlusion (Fig. 7A), the MLE of all the links and circle were close to the pose of the ground truth pattern (Fig. 7D) at the 24th iteration. The second example in Fig. 7E had no circle in the center of the pattern, demonstrating a partial occlusion scenario. The estimation result was similar to the first example but took more iterations to converge (Fig. 7).

In Fig. 7I, we show the convergence of the PMPNBP with respect to PAMPAS (*14*). Convergence here is shown as the average error of the MLE from its ground truth with respect to the number of belief iterations over 10 trials. We plotted this convergence for PMPNBP with *M* = {50,75,100,200} components versus PAMPAS. The convergence of PMPNBP was better than our implementation of PAMPAS. We note that the PMPNBP has decreasing average errors with increasing numbers of particles. This essentially indicates that, with larger *M*, the better the inference will be. To evaluate whether PMPNBP accommodates the use of larger *M* in practice, we plotted the central processing unit (CPU) run time per message update iteration in Fig. 5J. An entire message generation in PAMPAS took *O*(*KDM*^{2}) operations, where *D* is the number of messages to compute product in the “pre-message,” *K* is the number of iterations for the Gibbs sampler, and *M* is the number of Gaussian components used to represent a message. In contrast, PMPNBP only took *O*(*DM*) operations. The linear time complexity with respect to the number of particles enabled us to use more particles for inference and get better convergence. The implementation details on the unary and pairwise potentials for this 2D experiment are provided in the Supplementary Materials. Figures S1 and S2 show illustrations of the potentials and the sampling involved, respectively. In addition, in fig. S7 and S8, we provide the convergence of pose estimation along with the belief samples. The decrease in the variance of the belief samples can be visualized in these additional qualitative results.

In this section, we discussed the convergence properties of PMPNBP on 3D articulated objects, followed by the comparison with existing NBP method. The background on NBP and PMPNBP algorithms is provided in the “Materials and Methods” section.

## DISCUSSION

Here, we discuss some fundamental differences between the methods mentioned in the “Introduction” section and our proposed method. Hausman *et al*. (*5*) focused on estimating articulation models and plan actions, with fiduciary markers (AR tags) to track the pose of the objects. Martin and Brock (*6*) and Katz *et al*. (*22*) focused on estimating kinematic models by incorporating low-level point tracking assuming that objects have visual features. Sturm *et al*. (*7*, *8*) focused on estimating articulation models in a probabilistic fashion by human demonstration of manipulation examples with tracked markers. With the assumptions on the visual features either from markers or textures, these methods primarily focused on kinematic model estimation. In the current study, we focused on estimating the pose of the articulated objects in arbitrary poses with known 3D mesh models of the parts and their articulation constraints. Specifically, the pairwise potential function to be discussed in the “Pairwise potential and sampling” section used limits of articulations from URDF to output compatibility between jointed links. These existing works estimated kinematic models to produce such URDF models of objects. In the process of discovering kinematic models, these existing works tracked the change in the relative poses. However, we focused on estimating the pose of articulated objects at arbitrary poses and challenging configurations, making it a global localization problem as opposed to local localization or tracking problem where the initial configuration was known.

Existing filtering-based articulated object tracking frameworks (*23*, *24*, *25*) were initialized with ground truth object poses. Our method could complement these existing tracking frameworks by providing an initial pose estimate. In addition, belief propagation was applied to articulated pose tracking after initial pose estimation (*9*, *10*), making it suitable for interactive perception. We consider comparisons with the tracking frameworks as a future work.

### Limitations

The key problem toward solving a belief propagation problem with continuous variables is a message product that takes *M* is the number of Gaussian mixture components used to represent the continuous value, and *D* is the number of incoming mixtures used to construct an outgoing mixture in the context of message passing. The methods discussed in Introduction proposed approximations to compute this product to make the nonparametric belief propagation tractable in their respective applications domains. Here, we propose another such approximation (PMPNBP) that is much more efficient and does not grow asymptotically as the other approximations proposed earlier. PMPNBP assumes that the belief of a node generates its incoming message reweighted by the constraints of its neighbors. On the other hand, state-of-the-art methods (*14*, *13*) generated a new message from the source node to the target node by using all the other incoming messages to the source node. When the belief cannot capture samples at the true locations, PMPNBP will fail to generate an incoming message with samples at the true locations. Because PMPNBP can work with large number of samples, it always assumes that samples are available around the true locations that will be exploited in the inference. To avoid this scenario, a percentage of samples from uniform distribution can be used in addition to the samples from the belief. These samples can be considered as exploration samples. We consider this limitation to be reasonable because, computationally, PMPNBP affords to use large number of samples as compared with other methods. In our experiments, for the 2D articulated pattern estimation, we used 50% of the samples to explore, whereas in the 3D cabinet and robot pose estimations, we used only 10% of the samples.

## CONCLUSION

We proposed a new message-passing scheme that uses a “pull” approach to update messages in NBP. We represented messages as weighted particles instead of Gaussian mixtures as proposed in earlier algorithms. The proposed message-passing scheme avoided Gibbs sampling–based message products of the earlier methods and provided faster product approximations. We showed the efficiency of the proposed algorithm both in terms of its convergence properties and the computing time with respect to PAMPAS. We applied PMPNBP to estimate the poses of articulated objects. We showed that the PMPNBP outperformed the baseline Monte Carlo localization method quantitatively. Qualitative results are provided to show the pose estimation accuracy of PMPNBP under a variety of occlusions. We also showed the scalability of the algorithm to articulated objects with higher number of nodes and edges in their probabilistic graphical models. In addition, we illustrated how belief propagation can benefit robot manipulation tasks. The notion of uncertainty in the inference is inevitable in robotic perception. Our proposed PMPNBP algorithm was able to accurately estimate the pose of articulated objects and to maintain belief over possible poses that can benefit a robot in performing a task.

## MATERIALS AND METHODS

### Problem statement

We consider an articulated object *O* to be composed of *N* object parts and *N* − 1 points of articulation. Such an object description conforms with the URDF commonly used in Robot Operating System (ROS) (*26*). Such a URDF-compliant kinematic model can be represented using an undirected graph *G* = (*V*, *E*) with nodes *V* for object-part links and edges *E* for points of articulation. If *G* is an MRF, then it has two types of variables, *X* and *Y*, that are hidden and observed variables, respectively. Let *Y* = {*Y _{s}*∣

*Y*∈

_{s}*V*}, where

*Y*=

_{s}*P*⊆

_{s}*P*, with

*P*being the point cloud observed by the robot’s 3D sensor. Each object part has an observed node in the graph

*G*.

*P*serves as a region of interest if a trained object detector is used to find the object in the scene but is optional in our current approach. Each observed node

_{s}*Y*is connected to a hidden node

_{s}*X*that represents the pose of the underlying object part. Let

_{s}*X*= {

*X*∣

_{s}*X*∈

_{s}*V*}, where

*X*∈

_{s}*H*is a dual quaternion pose of an object part. Dual quaternions (

_{D}*20*,

*21*) are a quaternion equivalent to dual numbers representing a 6D pose

*X*= (

_{s}*x*,

*y*,

*z*,

*q*,

_{w}*q*,

_{x}*q*,

_{y}*q*) as

_{z}*X*=

_{s}*q*+ ε

_{r}*q*, where

_{d}*q*is the real component and

_{r}*q*is the dual component. Alternatively, it is represented as

_{d}*X*= [

_{s}*q*][

_{r}*q*]. Constructing a dual quaternion

_{d}*X*is similar to rotation matrices, with a product of dual quaternions representing translation and orientation as

_{s}*X*=

_{s}*dq*

_{pos}*

*dq*

_{ori}, where * is a dual quaternion multiplication.

*dq*

_{ori}= [

*q*,

_{w}*q*,

_{x}*q*,

_{y}*q*][0,0,0,0] is the dual quaternion representation of pure rotation, and

_{z}*X*, dual quaternions can capture the constraints in the edges

_{s}*E*and represent articulation types such as prismatic, revolute, and fixed effectively. This will be discussed in detail in the “Pairwise potential and sampling” section.

### Overview of nonparametric belief propagation

Let *G* = (*V*, *E*) be an undirected graph with nodes *V* and edges *E*. The nodes in *V* are each random variables that have dependencies with each other in the graph *G* through edges *E*. If *G* is an MRF, then it has two types of variables, *X* and *Y*, denoting the collection of hidden and observed variables, respectively. Each variable is considered to take assignments of continuous-valued vectors. The joint probability of the graph *G*, considering only second-order cliques, is given as_{s,t}(*X _{s}*,

*X*) is the pairwise potential between nodes

_{t}*X*∈

_{s}*R*and

^{d}*X*∈

_{t}*R*(note that dimensionality remains the same,

^{b}*d*=

*b*, in the case of estimating 6-DOF object pose), ϕ

*(*

_{s}*X*,

_{s}*Y*) is the unary potential between the hidden node

_{s}*X*and observed node

_{s}*Y*∈

_{s}*R*, and

^{q}*Z*is a normalizing factor. The problem is to infer belief over possible states assigned to the hidden variables

*X*such that the joint probability is maximized. This inference is generally performed by passing messages between hidden variables

*X*until convergence of their belief distributions over several iterations.

A message is denoted as *m*_{t→s} directed from node *t* to node *s* if there is an edge between the nodes in the graph *G*. The message represents the distribution of what node *t* thinks node *s* should take in terms of the hidden variable *X _{s}*. Typically, if

*X*is in the continuous domain, then

_{s}*m*

_{t→s}(

*X*) is represented as a Gaussian mixture to approximate the real distribution

_{s}*M*is the number of Gaussian components,

*i*th component, and

*i*th component, respectively. We use the terms “components,” “particles,” and “samples” interchangeably in this paper. Hence, a message can be expressed as

*M*triplets

Assuming the graph has a tree or loopy structure, computing these message updates is nontrivial computationally. A message update in a continuous domain at an iteration *n* from a node *t* → *s* is given by*t*) is a set of neighbor nodes of *t*. The marginal belief over each hidden node at iteration *n* is given by*T* is the number of components used to represent the belief.

### “Push” message update

NBP (*13*) provides a Gibbs sampling approach to compute an approximation of the product * _{t}*(

*X*,

_{t}*Y*) is pointwise computable, a “pre-message” (

_{t}*15*) is defined as

NBP (*13*) sample * _{st}*(

*X*,

_{s}*X*) is acting as

_{t}*M*increases.

### “Pull” message update

Given the overview of NBP above, we now describe our “pull” message passing algorithm. We represent message as a set of pairs instead of triplets in Eq. 4, which is

Similarly, the marginal belief is summarized as a sample set*T* is the number of samples representing the marginal belief. We assume that there is a marginal belief over *X _{s}* as

*n*, we initially sample

*t*)\

*s*and compute the weights

*13*) and PAMPAS (

*14*)] and our “pull” approach is the message

*m*

_{t→s}generation. In the “push” approach, the incoming messages to

*t*determine the outgoing message

*t*→

*s*. Whereas, in the “pull” approach, samples representing

*s*are drawn from its belief

*bel*

*from previous iteration and weighted by the incoming messages to*

_{s}*t*. This weighting strategy is computationally efficient. In addition, the product of incoming messages to compute

*bel*

*is approximated by a resampling step as described in Algorithm 2. An illustrative overview of Algorithms 1 and 2 is shown in fig. S6.*

_{s}### Algorithm 1. Message update

Given input messages *u* ∈ ρ(*t*)\*s*, and methods to compute functions ψ* _{ts}*(

*X*,

_{t}*X*) and ϕ

_{s}*(*

_{t}*X*,

_{t}*Y*) pointwise, the algorithm computes

_{t}1) Draw *M* independent samples

a) If *n* = 1, then the

b) If *n* > 1, then the *n* − 1)* ^{th}* iteration using importance sampling.

2) For each

a) Sample

b) Unary weight

c) Neighboring weight

i. For each *u* ∈ ρ(*t*)\*s* compute

ii. Each neighboring weight is computed by

d) The final weights are computed as

3) The weights

### Algorithm 2. Belief update

Given incoming messages *t* ∈ ρ(*s*) and methods to compute functions ϕ* _{s}*(

*x*,

_{s}*y*) pointwise, the algorithm computes

_{s}1) For each *t* ∈ ρ(*s*)

a) Update weights

b) Normalize the weights such that

2) Combine all the incoming messages to form a single set of samples and their weights *T* is the sum of all the incoming number of samples.

3) Normalize the weights such that

4) Perform a resampling step followed by diffusion with Gaussian noise to sample new set *X _{s}*.

Although URDF models are typically tree structured, our algorithm is not limited to tree graphs and can handle loopy graphs. The NBP algorithms are loop belief propagation methods in continuous domain. Similar to (*9*), which allows additional edges to capture physical collision constraints, our algorithm allows additional edges resulting in loopy graphs.

### Potential functions

#### Unary potential

Unary potential ϕ* _{t}*(

*X*,

_{t}*Y*) is used to model the likelihood by measuring how a pose

_{t}*X*explains the point cloud observation

_{t}*P*. The hypothesized object pose

_{t}*X*is used to position the given geometric object model and generate a synthetic point cloud

_{t}*P*. The synthetic point cloud is constructed using the object-part’s geometric model available a priori. The likelihood is calculated as

_{t}*is the scaling factor and*

_{r}*p*∈

*P*and corresponding rendered point

_{t}*1*,

*2*,

*3*).

#### Pairwise potential and sampling

Pairwise potential ψ_{t, s}(*X _{t}*∣

*X*) gives information about how compatible two object poses are given their joint articulation constraints captured by the edge between them. As mentioned in the “Problem statement” section, these constraints are captured using dual quaternions. Most often, the joint articulation constraints have minimum and maximum range in either prismatic or revolute types. We capture this information from URDF to get

_{s}*X*and

_{s}*R*

_{t∣s}, we find the distance between

*X*and the limits as

_{t}_{pos}, σ

_{ori}), we evaluate the pairwise potential as

The pairwise sampling uses the same limits *R*_{t∣s} to sample for *X _{t}* given a

*X*. We uniformly sample a dual quaternion

_{s}*X*’s current frame of reference by

_{s}### Experimental setup

We did experiments using the PMPNBP on both artificial 2D patterns and 3D articulated objects. The hardware platform we used for all the experiments was an Ubuntu 14.04 machine with a Core i7-6700HQ CPU, 16 GB random-access memory, and an NVIDIA GTX 1080 graphics processing unit (GPU). For 2D experiments, we used the same artificial pattern as presented in the PAMPAS (*14*) paper. Both PMPNBP and PAMPAS were implemented in MATLAB without any type of parallelization to avoid bias in comparison. For 3D experiments, we used our Fetch robot, a mobile manipulation platform, for data collection and manipulation experiments. RGBD data were collected using an ASUS Xtion RGBD sensor mounted on the robot. Intrinsic and extrinsic parameters were assumed to be given for rendering synthetic scenes with hypothesized object poses. CUDA-OpenGL interoperation was used to render synthetic scenes (depth images) on a GPU.

## SUPPLEMENTARY MATERIALS

robotics.sciencemag.org/cgi/content/full/4/30/eaaw4523/DC1

Fig. S1. Unary potential illustration.

Fig. S2. Pairwise potential illustration.

Fig. S3. More results on pose estimation of a cabinet under partial occlusion.

Fig. S4. Pose estimation of a Fetch robot.

Fig. S5. Pose estimation of a Fetch robot with simulated occlusion.

Fig. S6. Illustrative overview of Message and Belief update algorithms.

Fig. S7. PMPNBP results with circle node observed in the 2D articulated pattern estimation.

Fig. S8. PMPNBP results with circle node “occluded” in the 2D articulated pattern estimation.

Movie S1. Research summary.

This is an article distributed under the terms of the Science Journals Default License.

**Acknowledgments:**We thank Z. Zeng, Z. Sui, and A. Röfer from the University of Michigan for helpful discussions and feedback.

**Funding:**This work was supported, in part, by NSF award IIS-1638047.

**Author contributions:**K.D. and O.C.J. formulated the presented problem statement, computational methods, and experimental design with the help of S.L. and A.O. K.D. wrote the majority of the paper with contributions from S.L. and A.O. and editing revisions by O.C.J. O.C.J. provided advising to K.D., S.L., and A.O. and funding support to K.D.

**Competing interests:**The authors declare that they have no competing interests.

**Data and materials availability:**All data needed to evaluate the conclusions in the paper are present in the paper or the Supplementary Materials.

- Copyright © 2019 The Authors, some rights reserved; exclusive licensee American Association for the Advancement of Science. No claim to original U.S. Government Works