2010 IEEE International Conference on Robotics and Automation 2010
DOI: 10.1109/robot.2010.5509626
|View full text |Cite
|
Sign up to set email alerts
|

Rao-Blackwellised PHD SLAM

Abstract: Abstract-This paper proposes a tractable solution to feature-based (FB) SLAM in the presence of data association uncertainty and uncertainty in the number of features. By modeling the feature map as a random finite set (RFS), a rigorous Bayesian formulation of the FB-SLAM problem that accounts for uncertainty in the number of features and data association is presented. As such, the joint posterior distribution of the set-valued map and vehicle trajectory is propagated forward in time as measurements arrive. A … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
19
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 28 publications
(19 citation statements)
references
References 22 publications
0
19
0
Order By: Relevance
“…The method in which this is performed is the focus of this paper, and we will explore this in greater details in section III. 5) Merging and Pruning of the Map: Gaussians with small weights are eliminated from the intensity function, while Gaussians that are close to each other are merged together [2,13]. This approximation is critical in limiting the computational requirement of the RB-PHD filter.…”
Section: B the Rb-phd Filtermentioning
confidence: 99%
“…The method in which this is performed is the focus of this paper, and we will explore this in greater details in section III. 5) Merging and Pruning of the Map: Gaussians with small weights are eliminated from the intensity function, while Gaussians that are close to each other are merged together [2,13]. This approximation is critical in limiting the computational requirement of the RB-PHD filter.…”
Section: B the Rb-phd Filtermentioning
confidence: 99%
“…The smoothed features are then clustered based on nearby pixels and pruned according to a minimum and maximum area constraints. seminal developments in the tracking community [16], [17], recent SLAM investigations suggest that a feature map is more appropriately represented as a set of features, requiring the tools of random finite set (RFS) theory [9], [18], [19]. This approach is also adopted in this paper.…”
Section: B Clustering and Feature Extractionmentioning
confidence: 99%
“…where a Rao-Blackwellised implementation implies the mapping recursion is approximated by a Gaussian Mixture PHD Filter, and the trajectory recursion by a Particle Filter [18]. The calculation of the particle weighting likelihood however, requires the evaluation of,…”
Section: The Filtermentioning
confidence: 99%
See 1 more Smart Citation
“…A Gaussian mixture implementation for the CPHD has also been proposed [11]. Recently, Mullane, Vo and Adams proposed a SLAM algorithm which combines a Rao-Blackwellized particle filter with the Gaussian mixture PHD filter for estimation of map landmarks [12]- [14]. In comparison to more established SLAM methods, it is most similar to the FastSLAM family of algorithms [15], but performs much better when faced with increased levels of measurement clutter.…”
mentioning
confidence: 99%