Login / Signup

A Near-Tight Approximation Algorithm for the Robot Localization Problem.

Sven KoenigJoseph S. B. MitchellApurva MudgalCraig A. Tovey
Published in: SIAM J. Comput. (2009)
Keyphrases
  • learning algorithm
  • dynamic programming
  • worst case
  • np hard
  • optimal solution
  • lower bound
  • search space
  • mobile robot
  • robot localization
  • computational complexity
  • dynamic environments