Dense mapping for range sensors: Efficient algorithms and sparse representations

6Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

Abstract

This paper focuses on efficient occupancy gridbuilding based on wavelet occupancy grids, a new sparse gridrepresentation and on a new update algorithm for range sensors.The update algorithm takes advantage of the natural multiscaleproperties of the wavelet expansion to update only parts of theenvironement that are modified by the sensor measurements andat the proper scale. The sparse wavelet representation coupledwith an efficient algorithm presented in this paper providesefficient and fast updating of occupancy grids. It leads to realtimeresults especially in 2D grids and for the first time in 3Dgrids. Experiments and results are discussed for both real andsimulated data.

Cite

CITATION STYLE

APA

Yguel, M., Keat, C. T. M., Braillon, C., Laugier, C., & Aycard, O. (2008). Dense mapping for range sensors: Efficient algorithms and sparse representations. In Robotics: Science and Systems (Vol. 3, pp. 129–136). MIT Press Journals. https://doi.org/10.7551/mitpress/7830.003.0018

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