We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Optimal Bidirectional Rapidly-Exploring Random Trees

Thumbnail Image
Download
Name

MIT-CSAIL-TR-2013-021.pdf

Size

220.32 KB

Format

Adobe PDF

Checksum (MD5)

ffbe67a0a5b647c74df7eee80986308b

Download all files submitted through automated deposit
aperez@CSAIL.MIT.EDU-520d8de1.29807.zip (196.1 KB)
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
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.