Optimal Bidirectional Rapidly-Exploring Random Trees
| dc.date.accessioned | 2013-08-16T18:30:03Z | |
| dc.date.accessioned | 2018-11-26T22:27:02Z | |
| dc.date.available | 2013-08-16T18:30:03Z | |
| dc.date.available | 2018-11-26T22:27:02Z | |
| dc.date.issued | 2013-08-15 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/79884 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/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.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 |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| MIT-CSAIL-TR-2013-021.pdf | 225.6Kb | application/pdf | View/ |
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial 3.0 Unported