Look-ahead proposals for robust grid-based SLAM

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Simultaneous Localization and Mapping (SLAM) is one of the classical problems in mobile robotics. The task is to build a map of the environment using on-board sensors while at the same time localizing the robot relative to this map. Rao-Blackwellized particle filters have emerged as a powerful technique for solving the SLAM problem in a wide variety of environments. It is a well-known fact for sampling-based approaches that the choice of the proposal distribution greatly influences the robustness and efficiency achievable by the algorithm. In this paper, we present a significantly improved proposal distribution for grid-based SLAM, which utilizes whole sequences of sensor measurements rather than only the most recent one. We have implemented our system on a real robot and evaluated its performance on standard data sets as well as in hard outdoor settings with few and ambiguous features. Our approach improves the localization accuracy and the map quality. At the same time, it substantially reduces the risk of mapping failures. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Grzonka, S., Plagemann, C., Grisetti, G., & Burgard, W. (2008). Look-ahead proposals for robust grid-based SLAM. In Springer Tracts in Advanced Robotics (Vol. 42, pp. 329–338). https://doi.org/10.1007/978-3-540-75404-6_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free