|Dynamic 3-D data is being accumulated by a ladar sensor mounted on an outdoor mobile robot. We introduce a novel data structure which enables efficient processing of such data.|
We consider the problem of the dynamic processing of large amounts of sparse three-dimensional data. It is assumed that computations are performed in a neighborhood defined around each point in order to retrieve local properties. This general kind of processing can be applied to a wide variety of problems. We propose a new, efficient data structure and corresponding algorithms that significantly improve the speed of the range search operation and that are suitable for on-line operation where data is accumulated dynamically. The method relies on taking advantage of overlapping neighborhoods and the reuse of previously computed data as the algorithm scans each data point. To demonstrate the dynamic capabilities of the data structure, we use data obtained from a laser radar mounted on a ground mobile robot operating in complex, outdoor environments. We show that this approach considerably improves the speed of an established 3-D perception processing algorithm.
|Jean-François Lalonde, Nicolas Vandapel, and Martial Hebert. Data Structures for Efficient Dynamic Processing in 3-D. International Journal of Robotics Research, 26(8), 777--796, 2007. [PDF], [BibTeX]|
This work was the focus of my M.S. thesis.
|Jean-François Lalonde. Data Structures for Efficient Dynamic Processing in 3-D. Technical Report CMU-RI-TR-06-22, Robotics Institute, Carnegie Mellon University, May 2006. [PDF], [BibTeX]|
Download the slides from the talk presented at my M.S. talk in the following formats:
Parts of this work previously appeared at Robotics: Science and Systems in 2005.
|Jean-François Lalonde, Nicolas Vandapel, and Martial Hebert. Data Structure for Efficient Processing in 3-D. Robotics: Science and Systems I, 2005. [PDF], [BibTeX]|
Download the slides from the talk presented at RSS'05 in the following formats: