Optimal Bidirectional Rapidly-Exploring Random Trees
In this paper we present a simple, computationally-efficient, two-tree variant of the RRT* algorithm along with several heuristics.
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Published: |
2013
|
| Online Access: | http://hdl.handle.net/1721.1/79884 |
| Summary: | In this paper we present a simple, computationally-efficient, two-tree variant of the RRT* algorithm along with several heuristics. |
|---|