Robot Mapping: Foot-Prints versus Tokens

We are interested in the problem of robot exploration from the approach of competitive analysis, where the cost of an online-strategy is compared with the minimum cost carrying out the same task with perfect information.

[1]  Xiaotie Deng,et al.  Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[2]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[3]  Xiaotie Deng,et al.  How to learn an unknown environment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, ICALP.

[5]  Leonidas J. Guibas,et al.  The robot localization problem in two dimensions , 1992, SODA '92.

[6]  Rolf Klein,et al.  Walking an unknown street with bounded detour , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[7]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[8]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[9]  Benjamin Kuipers,et al.  A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations , 1991, Robotics Auton. Syst..

[10]  Amos Fiat,et al.  Online Navigation in a Room , 1992, J. Algorithms.

[11]  Yuval Rabani,et al.  Competitive algorithms for layered graph traversal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[12]  Bala Kalyanasundaram,et al.  A Competitive Analysis of Algorithms for Searching Unknown Scenes , 1993, Comput. Geom..

[13]  Yuval Rabani,et al.  Lower bounds for randomized k-server and motion-planning algorithms , 1991, STOC '91.

[14]  Ronald L. Rivest,et al.  Inference of finite automata using homing sequences , 1989, STOC '89.

[15]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[16]  Norishige Chiba,et al.  A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[17]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[18]  Michael Jenkin,et al.  Using Multiple Markers In Graph Exploration , 1990, Other Conferences.

[19]  Baruch Schieber,et al.  Navigating in unfamiliar geometric terrain , 1991, STOC '91.

[20]  Tod S. Levitt,et al.  Qualitative Navigation for Mobile Robots , 1990, Artif. Intell..