DocumentCode
3532915
Title
RBPF-SLAM based on probabilistic geometric planar constraints
Author
Barron-Gonzalez, Hector ; Dodd, Tony J.
Author_Institution
Autom. Control & Syst. Eng., Univ. of Sheffield, Sheffield, UK
fYear
2010
fDate
7-9 July 2010
Firstpage
260
Lastpage
265
Abstract
Recent advances in visual SLAM have focused on improving estimation of sparse 3D points or patches that represent parts of surroundings. In order to establish an adequate scene understanding, inference of spatial relations among landmarks must be part of the SLAM processing. A novel Rao-Blackwilized PF-SLAM algorithm is proposed to utilize geometric relations of landmarks with respect to high level features, such as planes, for improving estimation. These geometric relations are defined as a set of geometric constraint hypotheses inferred during the mapping task. In each prediction-update cycle of estimation, probabilistic constraints are created and applied to update landmarks based on a hierarchical inference process. Based on experiments, improvement over estimation and completeness of the scene description is achieved using the proposal of this paper.
Keywords
SLAM (robots); particle filtering (numerical methods); robot vision; sparse matrices; spatial reasoning; RBPF-SLAM; Rao-Blackwilized particle filter; geometric constraint hypotheses; hierarchical inference process; prediction update cycle; probabilistic geometric planar constraint; simultaneous localization and mapping; sparse 3D point; Automatic control; Filters; Image sequences; Inference algorithms; Layout; Noise measurement; Noise robustness; Robots; Simultaneous localization and mapping; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems (IS), 2010 5th IEEE International Conference
Conference_Location
London
Print_ISBN
978-1-4244-5163-0
Electronic_ISBN
978-1-4244-5164-7
Type
conf
DOI
10.1109/IS.2010.5548374
Filename
5548374
Link To Document