44
32

CDDT: Fast Approximate 2D Ray Casting for Accelerated Localization

Abstract

Localization is an essential component for autonomous robots. A well-established localization approach combines ray casting with a particle filter, leading to a computationally expensive algorithm that is difficult to run on resource-constrained mobile robots. We present a novel data structure called the Compressed Directional Distance Transform for accelerating ray casting in two dimensional occupancy grid maps. Our approach has near constant time ray casting performance for a fixed size map, in contrast with other methods which display long tail query time distributions. Our experimental results show that the proposed algorithm approximates the performance characteristics of reading from a three dimensional lookup table of ray cast solutions while requiring two orders of magnitude less memory and precomputation. This results in a particle filter algorithm which can maintain 2500 particles with 61 ray casts per particle at 40Hz, using only a single CPU thread onboard a mobile robot.

View on arXiv
Comments on this paper