2011 · 55 citations · 11 references
ComputingComputer Science3D ModelingComputational GeometryGrid ComputingCell DecompositionGeometry ProcessingMappingSpatial PartitioningSpatial ResolutionData Structure GeneralizationOccupancy Grid MappingOctree DecompositionOctreesQuadtree DecompositionQuadtreesRobot MappingThree-dimensional Maps
For robot mapping occupancy grid maps are the most common representation of the environment. However, most existing algorithms for creating such maps assume a fixed resolution of the grid cells. In this paper we present a novel mapping technique that chooses the resolution of each cell adaptively by merging and splitting cells depending on the measurements. The splitting of the cells is based on a statistical measure that we derive in this paper. In contrast to other approaches the adaption of the resolution is done online during the mapping process itself. Additionally, we introduce the Nd-Tree, a generalization of quadtrees and octrees that allows to subdivide any d-dimensional volume recursively with N <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</sup> children per node. Using this data structure our approach can be implemented in a very generic way and allows the creation of 2D, 3D and even higher dimensional maps using the same algorithm. Finally, we show results of our proposed method for 2D and 3D mapping using different kinds of range sensors.
11
Using occupancy grids for mobile robot perception and navigation
Alberto Elfes · Computer · 1989 · 2.2K citations
A Fast Voxel Traversal Algorithm for Ray Tracing
John Amanatides, Andrew Woo · 1987 · 670 citations · Full text
Cyril Crassin, Fabrice Neyret, Sylvain Lefèbvre et al. · 2009 · 276 citations