Nonprobabilistic anytime algorithm for high-quality trajectories in high-dimensional spaces.
Andrés S. VázquezAntonio AdánPublished in: Robotica (2012)
Keyphrases
- dynamic programming
- high quality
- learning algorithm
- preprocessing
- cost function
- np hard
- experimental evaluation
- computational cost
- estimation algorithm
- improved algorithm
- selection algorithm
- matching algorithm
- theoretical analysis
- computational complexity
- significant improvement
- worst case
- memory requirements
- convex hull
- search space
- clustering method
- optimization algorithm
- computationally efficient
- simulated annealing
- detection algorithm
- classification algorithm
- linear programming
- times faster
- high accuracy
- convergence rate
- probabilistic model
- decision trees
- data sets