Planning 3-D Path Networks in Unstructured Environments
Abstract
In this paper, we explore the problem of three-dimensional motion planning in highly cluttered and unstructured outdoor environments. Because accurate sensing and modeling of obstacles is notoriously difficult in such environments, we aim to build computational tools that can handle large point data sets (e.g. LADAR data). Using a priori aerial data scans of forested environments, we compute a network of free space bubbles forming safe paths within environments cluttered with tree trunks, branches and dense foliage. The network (roadmap) of paths is used for efficiently planning paths that consider obstacle clearance information. We present experimental results on large point data sets typical of those faced by Unmanned Aerial Vehicles, but also applicable to ground-based robots navigating through forested environments.
BibTeX
@conference{Vandapel-2005-9150,author = {Nicolas Vandapel and James Kuffner and Omead Amidi},
title = {Planning 3-D Path Networks in Unstructured Environments},
booktitle = {Proceedings of (ICRA) International Conference on Robotics and Automation},
year = {2005},
month = {April},
pages = {4624 - 4629},
}