Robot Localization without Depth Perception

Consider the problem of placing reflectors in a 2-D environment in such a way that a robot equipped with a basic laser can always determine its current location. The robot is allowed to swivel at its current location, using the laser to detect at what angles some reflectors are visible, but no distance information is obtained. A polygonal map of the environment and reflectors is available to the robot. We show that there is always a placement of reflectors that allows the robot to localize itself from any point in the environment, and that such a reflector placement can be computed in polynomial time on a real RAM. This result improves over previous techniques which have up to a quadratic number of ambiguous points at which the robot cannot determine its location [1, 9]. Further, we show that the problem of optimal reflector placement is equivalent to an art-gallery problem within a constant factor.

[1]  Gregory Dudek,et al.  Mobile robot localization from learned landmarks , 1998, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190).

[2]  Margrit Betke,et al.  Mobile robot localization using landmarks , 1997, IEEE Trans. Robotics Autom..

[3]  C. J. Keyser The Thirteen Books of Euclid's Elements Translated from the Text of Heiberg with Introduction and Commentary , 1909 .

[4]  Héctor H. González-Baños,et al.  A randomized art-gallery algorithm for sensor placement , 2001, SCG '01.

[5]  J. R. Musselman,et al.  An introduction to modern geometry , 1939 .

[6]  G. M.,et al.  Projective Geometry , 1938, Nature.

[7]  Gregory Dudek,et al.  Localizing a robot with minimum travel , 1995, SODA '95.

[8]  Kokichi Sugihara,et al.  Some location problems for robot navigation using a single camera , 1988, Comput. Vis. Graph. Image Process..