Optimal Bidirectional Rapidly-Exploring Random Trees

dc.contributor.advisor	Leslie Kaelbling
dc.contributor.author	Jordan, Matthew	en_US
dc.contributor.author	Perez, Alejandro	en_US
dc.contributor.other	Learning and Intelligent Systems	en
dc.date.accessioned	2013-08-16T18:30:03Z
dc.date.available	2013-08-16T18:30:03Z
dc.date.issued	2013-08-15
dc.identifier.uri	http://hdl.handle.net/1721.1/79884
dc.description.abstract	In this paper we present a simple, computationally-efficient, two-tree variant of the RRT* algorithm along with several heuristics.	en_US
dc.format.extent	12 p.	en_US
dc.relation.ispartofseries	MIT-CSAIL-TR-2013-021
dc.rights	Creative Commons Attribution-NonCommercial 3.0 Unported	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc/3.0/	en_US
dc.title	Optimal Bidirectional Rapidly-Exploring Random Trees	en_US
dc.date.updated	2013-08-16T18:30:03Z