Search Results for author: Jonathan D. Gammell

Found 3 papers, 1 papers with code

Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs

no code implementations22 May 2014 Jonathan D. Gammell, Siddhartha S. Srinivasa, Timothy D. Barfoot

In this paper, we present Batch Informed Trees (BIT*), a planning algorithm based on unifying graph- and sampling-based planning techniques.

Robotics

Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic

1 code implementation8 Apr 2014 Jonathan D. Gammell, Siddhartha S. Srinivasa, Timothy D. Barfoot

We present the algorithm as a simple modification to RRT* that could be further extended by more advanced path-planning algorithms.

Robotics

Cannot find the paper you are looking for? You can Submit a new open access paper.