An Approximation Algorithm for the Subpath Planning Problem.
Masoud SafilianS. Mehdi HashemiSepehr EghbaliAliakbar SafilianPublished in: IJCAI (2016)
Keyphrases
- times faster
- dynamic programming
- computational cost
- k means
- np hard
- preprocessing
- detection algorithm
- theoretical analysis
- optimization algorithm
- objective function
- improved algorithm
- convergence rate
- closed form
- path planning
- clustering method
- computationally efficient
- experimental evaluation
- cost function
- significant improvement
- search space
- computational complexity
- motion estimation
- probabilistic model
- convex hull
- recognition algorithm
- learning algorithm
- polygonal approximation
- approximation ratio
- randomized algorithm