Optimal Bidirectional Rapidly-Exploring Random Trees

Name

MIT-CSAIL-TR-2013-021.pdf

Size

220.32 KB

Format

Adobe PDF

Checksum (MD5)

ffbe67a0a5b647c74df7eee80986308b

Download all files submitted through automated deposit

Author(s)

Jordan, Matthew

•

Perez, Alejandro

Advisor(s)

Leslie Kaelbling

Date Issued

August 15, 2013

Series/Report no.

MIT-CSAIL-TR-2013-021

Abstract

In this paper we present a simple, computationally-efficient, two-tree variant of the RRT* algorithm along with several heuristics.

Terms of Use

Creative Commons Attribution-NonCommercial 3.0 Unported

Persistent DSpace Link