RBPF-SLAM based on probabilistic geometric planar constraints

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 RaoBlackwilized 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.

Real-time geometric scene estimation for RGBD images using a 3D box shape grammar

“…[13][14][15][16] Much of the effort in this research is to not only discover planar segments in the 3D data, but also to merge these segments into a global map. Hence, much of the focus of these articles is to define parameterizations of the detected planar data that facilitate efficient solutions to downstream SLAM map-building problems which require multiple depth images / surface estimates to be associated and merged.…”