A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths.
Jonathan BackerDavid G. KirkpatrickPublished in: ISAAC (2008)
Keyphrases
- dynamic programming
- improved algorithm
- path planning
- segmentation algorithm
- learning algorithm
- approximation ratio
- computational complexity
- times faster
- cost function
- np hard
- error bounds
- matching algorithm
- detection algorithm
- optimization algorithm
- theoretical analysis
- expectation maximization
- high accuracy
- worst case
- computational cost
- path length
- significant improvement
- preprocessing
- recognition algorithm
- approximation algorithms
- shortest common supersequence
- monte carlo
- particle swarm optimization
- input data
- experimental evaluation
- optimal solution
- objective function