An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization.
Hanna SumitaYuma YonebayashiNaonori KakimuraKen-ichi KawarabayashiPublished in: IJCAI (2017)
Keyphrases
- np hard
- learning algorithm
- computational cost
- k means
- dynamic programming
- worst case
- search space
- detection algorithm
- efficient computation
- classification algorithm
- improved algorithm
- high accuracy
- experimental evaluation
- input data
- cost function
- significant improvement
- times faster
- particle swarm optimization
- error bounds
- approximation algorithms
- multi robot
- polynomial time approximation
- path planning
- matching algorithm
- optimization algorithm
- segmentation algorithm
- computationally efficient
- support vector machine
- objective function
- similarity measure