An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles.
Pankaj K. AgarwalKyle FoxOren SalzmanPublished in: CoRR (2017)
Keyphrases
- learning algorithm
- times faster
- cost function
- high quality
- worst case
- detection algorithm
- np hard
- theoretical analysis
- optimization algorithm
- objective function
- dynamic programming
- experimental evaluation
- segmentation algorithm
- high accuracy
- search space
- preprocessing
- selection algorithm
- improved algorithm
- matching algorithm
- path finding
- mobile robot
- significant improvement
- optimal solution
- computationally efficient
- computational cost
- computational complexity
- similarity measure
- highly efficient
- image segmentation