The relative power of immovable markers in topological mapping

The fundamental problem in robotic exploration and mapping of an unknown environment is answering the question ‘have I been here before?’, which involves disambiguating the robot's current location from previously visited or known locations. One approach to answering this problem in embedded topological worlds is to resort to the use of an external aid that can help the robot disambiguate places. Here we investigate the power of different marker-based aids in exploring undirected topological graphs. We demonstrate that for undirected graphs, certain marker aids are insufficient, while others have powers that are sufficient to develop asymptotically optimal exploration algorithms.

[1]  Sebastian Thrun,et al.  Simultaneous Localization and Mapping , 2008, Robotics and Cognitive Approaches to Spatial Mapping.

[2]  Hugh Durrant-Whyte,et al.  Simultaneous localization and mapping (SLAM): part II , 2006 .

[3]  Michael Jenkin,et al.  Robotic exploration as graph construction , 1991, IEEE Trans. Robotics Autom..

[4]  Hugh F. Durrant-Whyte,et al.  Simultaneous localization and mapping: part I , 2006, IEEE Robotics & Automation Magazine.

[5]  Hui Wang,et al.  Using a string to map the world , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[6]  Wolfram Burgard,et al.  Probabilistic Robotics (Intelligent Robotics and Autonomous Agents) , 2005 .

[7]  Michael R. M. Jenkin,et al.  Map Validation and Self-location in a Graph-like World , 1993, IJCAI.

[8]  SahaiAmit,et al.  The Power of a Pebble , 2002 .

[9]  Michael A. Bender,et al.  The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.

[10]  Andrzej Pelc,et al.  Optimal graph exploration without good maps , 2002, Theor. Comput. Sci..

[11]  Hui Victor Wang Exploring Topological Environments , 2010 .

[12]  Xiaotie Deng,et al.  Competitive robot mapping with homogeneous markers , 1996, IEEE Trans. Robotics Autom..

[13]  Emanuele Menegatti,et al.  Bayesian inference in the space of topological maps , 2006, IEEE Transactions on Robotics.

[14]  Sebastian Thrun,et al.  Robotic mapping: a survey , 2003 .

[15]  Andrzej Pelc,et al.  Graph exploration by a finite automaton , 2005, Theor. Comput. Sci..

[16]  Jean-Arcady Meyer,et al.  Incremental vision-based topological SLAM , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Michael A. Bender,et al.  The power of team exploration: two robots can learn unlabeled directed graphs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[18]  Manuel Blum,et al.  On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[19]  Jason M. O'Kane,et al.  Comparing the Power of Robots , 2008, Int. J. Robotics Res..

[20]  Xiaotie Deng,et al.  Robot Map Verification of a Graph World , 1999, WADS.