A 2-Approximation Algorithm for the Online Tethered Coverage Problem.
Gokarna SharmaPavan PoudelAyan DuttaVala ZeinaliTala Talaei KhoeiJong-Hoon KimPublished in: Robotics: Science and Systems (2019)
Keyphrases
- detection algorithm
- learning algorithm
- optimal solution
- high accuracy
- experimental evaluation
- dynamic programming
- cost function
- computational complexity
- improved algorithm
- worst case
- monte carlo
- segmentation algorithm
- theoretical analysis
- convergence rate
- computationally efficient
- expectation maximization
- randomized algorithm
- probabilistic model
- k means
- preprocessing
- objective function
- classification algorithm
- real time
- approximation ratio
- polygonal approximation
- online algorithms
- decision trees
- recognition algorithm
- closed form
- matching algorithm
- input data
- search space
- significant improvement
- computational cost
- particle swarm optimization
- online learning