Localization: approximation and performance bounds to minimize travel distance

  • Authors:

  • Craig Tovey;Sven Koenig

  • Affiliations:

  • Department of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA;Department of Computer Science, University of Southern California, Los Angeles, CA

  • Venue:
  • IEEE Transactions on Robotics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Localization, which is the determination of one's location in a known terrain, is a fundamental task for autonomous robots. This paper presents several new basic theoretical results about localization.We show that, even under the idealized assumptions of accurate sensing and perfect actuation, it is intrinsically difficult to localize a robot with a travel distance that is close to minimal. Our result helps to theoretically justify the common use of fast localization heuristics, such as greedy localization, which always moves the robot to a closest informative location (where the robot makes an observation that decreases the number of its possible locations). We show that the travel distance of greedy localization is much larger thanminimal in some terrains because the closest informative location can distract greedy localization from a slightly farther, but much more informative, location. However, we also show that the travel distance of greedy localization can be larger, but not much larger, than the terrain size n. Thus, the travel distance of greedy localization scales well with the terrain size and is much larger than minimal in some terrains, not because it is large with respect to the terrain size, but because the minimal travel distance is exceptionally small in these terrains. As a corollary to our analysis, we show that the travel distance of greedy mapping (which always moves the robot to a closest location, where it makes an observation that increases its knowledge of the terrain) cannot be much larger than the terrain size. In theoretical terms, we prove the NP-hardness of minimization of travel distance for localization to within a logarithmic factor of the terrain size. We prove that the travel distance of greedy localization is at least order n/ log2 n larger than minimal in some terrains and that it is at least order n log n/ log log n in the worst case. Finally, we prove that the travel distance of both greedy localization and greedy mapping is at most order n log n. Previously, it was only known that it is NP-hard to localize with minimal travel distance and that the travel distances of greedy localization and greedy mapping are at most order n3/2.