Space-filling trees: A new perspective on incremental search for motion planning

  • Kuffner J
  • LaValle S
  • 48

    Readers

    Mendeley users who have this article in their library.
  • 10

    Citations

    Citations of this article.

Abstract

This paper introduces space-filling trees and analyzes them in the context of sampling-based motion planning. Space-filling trees are analogous to space-filling curves, but have a branching, tree-like structure, and are defined by an incremental process that results in a tree for which every point in the space has a finite-length path that converges to it. In contrast to space-filling curves, individual paths in the tree are short, allowing any part of the space to be quickly reached from the root. We compare some basic constructions of space-filling trees to Rapidly-exploring Random Trees (RRTs), which underlie a number of popular algorithms used for sampling-based motion planning. We characterize several key tree properties related to path quality and the overall efficiency of exploration and conclude with a number of open mathematical questions.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text

Authors

  • James J. Kuffner

  • Steven M. LaValle

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free