A near-tight approximation lower bound and algorithm for the kidnapped robot problem.
Sven KoenigApurva MudgalCraig A. ToveyPublished in: SODA (2006)
Keyphrases
- lower bound
- worst case
- optimal solution
- np hard
- upper bound
- optimization algorithm
- preprocessing
- learning algorithm
- objective function
- matching algorithm
- computational cost
- randomized algorithm
- path planning
- detection algorithm
- theoretical analysis
- approximation algorithms
- linear programming
- approximation ratio
- competitive ratio
- branch and bound algorithm
- humanoid robot
- autonomous robots
- lower and upper bounds
- expectation maximization
- vision system
- probabilistic model
- mobile robot
- cost function
- convergence rate
- particle swarm optimization
- obstacle avoidance
- linear programming relaxation
- configuration space
- k means
- computational complexity
- clustering algorithm