BIT*: Batch Informed Trees for Optimal Sampling-based Planning via Dynamic Programming on Implicit Random Geometric Graphs.
Jonathan D. GammellSiddhartha S. SrinivasaTimothy D. BarfootPublished in: CoRR (2014)
Keyphrases
- dynamic programming
- optimal control
- motion planning
- decision trees
- linear programming
- locally optimal
- state space
- markov decision processes
- stereo matching
- graph theoretical
- planning problems
- randomized trees
- piecewise linear
- greedy algorithm
- exhaustive search
- graph theoretic
- pseudorandom
- edit distance
- batch processing
- binary search trees
- tree structured data
- optimal solution