Randomized Algorithms for Minimum Distance Localization

We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-similar polygonal environment ¥ . The robot has a map of ¥ and can compute visibility data through sensing. However, the self-similarities in the environment mean that the same visibility data may correspond to several different locations. The goal, therefore, is to determine the robot’s true initial location while minimizing the distance traveled by the robot. We present two randomized approximation algorithms that solve the problem of minimum distance localization. The performance of our algorithms is evaluated empirically.

• Type: Journal
• Year: 2007
• Where: IJRR
• Authors: Malvika Rao, Gregory Dudek, Sue Whitesides
• Keywords: IJRR 2007, Minimum Distance Localization, Self-similar Polygonal Environment, Visibility Data