Competitive robot mapping with homogeneous markers

We consider the robot exploration problem of graph maps with homogeneous markers. The graph consists of nodes and edges, where the robot can navigate from one node to another through an edge connecting these two nodes. However, the robot may not distinguish one node (or edge) from another in the unknown graph. All the nodes (edges) look the same. However, at each node, the robot can observe a consistent local relative orientation of its incident edges, that is, a cyclic order of edges incident to the node. To assist the robot's task of mapping the environment, it can put homogeneous marks on nodes or edges which can be recognized later. The total number of edges traversed when constructing a map of the graph is often used as a performance measure for robot strategies. However, since the graph is unknown, a strategy may be efficient in one situation but not in others. Thus, there is a conceptual question about what is an optimal strategy. In this paper, we apply the competitive analysis method for robot explorations. In particular, we compare the cost for constructing a map with the cost for verifying the same map; their ratio is the competitive ratio. A strategy is optimal if it minimizes the worst-case ratio of the total number of edges traversed when constructing a map of the graph to the optimum number of edges traversed in verifying the correctness of a given map of the same graph. If this competitive ratio is bounded above by a constant, we say the strategy is competitive.

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

[2]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

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

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

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

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

[7]  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..

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

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

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

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

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

[13]  Baruch Schieber,et al.  Navigating in Unfamiliar Geometric Terrain , 1997, SIAM J. Comput..

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

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

[16]  Bruce Randall Donald,et al.  On the complexity of kinodynamic planning , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[18]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

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

[20]  Rolf Klein.  Walking an Unknown Street with Bounded Detour , 1991, Comput. Geom..

[21]  Benjamin Kuipers,et al.  Navigation and Mapping in Large Scale Space , 1988, AI Mag..

[22]  John F. Canny,et al.  A new algebraic method for robot motion planning and real geometry , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

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

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

[25]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

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

[27]  René Schott,et al.  Parallel Searching in the Plane , 1995, Comput. Geom..

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