Abstract
In the map verification problem, a robot is given a (possibly incorrect) map M of the world G with its position and orientation indicated on the map. The task is to find out whether this map, for the given robot position and its orientation in the map, is correct for the world G. We consider the world model of a graph G = (V G, E G) in which, for each vertex, edges incident to the vertex are ordered cyclically around that vertex. (This also holds for the map M = (V M, E M.) The robot can traverse edges and enumerate edges incident on the current vertex, but it cannot distinguish vertices (and edges) from each other. To solve the verification problem, the robot uses a portable edge marker, that it can put down at an edge of the graph world G and pick up later as needed. The robot can recognize the edge marker when it encounters it in the world G. By reducing the verification problem to an exploration problem, verification can be completed in O(|V G| × |E G|) edge traversals (the mechanical cost) with the help of a single vertex marker which can be dropped and picked up at vertices of the graph world (G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, IEEE Trans. on Robotics and Automation, vol. 7, pp. 859–865, 1991; Robotics and Autonomous Systems, vol. 22(2), pp. 159–178, 1997). In this paper, we show a strategy that verifies a map in O(|V M|) edge traversals only, using a single edge marker, when M is a plane embedded graph, even though G may not be planar (e.g., G may contain overpasses, tunnels, etc.).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley: Reading, MA, 1976.
S. Albers and M.R. Henzinger, “Exploring unknown environments,” in Proc. of the 29th Annual ACM Symposium on Theory of Computing (STOC'97), 1997, pp. 416–425.
R.A. Baeza-Yates, J.C. Culberson, and G.J.E. Rawlins, “Searching in the plane,” Information and Computation, vol. 106, pp. 234–252, 1993.
A. Blum, P. Raghavan, and B. Schieber, “Navigating in unfamiliar geometric terrain,” in Proc. of the 23rd Annual ACM Symposium on Theory of Computing, (STOC'91), 1991, pp. 494–504.
X. Deng, T. Kameda, and C.H. Papadimitriou, “How to learn an unknown environment,” Journal of the ACM, vol. 45(2), pp. 215–245, 1998.
X. Deng and A. Mirzaian, “Competitive robot mapping with homogeneous markers,” IEEE Trans. on Robotics and Automation, vol. 12(4), pp. 532–542, 1996.
X. Deng and C.H. Papadimitriou, “Exploring an unknown graph,” in Proc. of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS'90), 1990, pp. 355–361.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, “Robotic exploration as graph construction,” IEEE Trans. on Robotics and Automation, vol. 7, pp. 859–865, 1991.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, “Map validation and self-location for a robot with a graph-like map,” Robotics and Autonomous Systems, vol. 22(2), pp. 159–178, 1997.
J. Edmonds, “A combinatorial representation for polyhedral surfaces,” Not. Am. Math. Soc., vol. 7, p. 646, 1960.
J.L. Gross and T.W. Tucker, Topological Graph Theory, John Wiley and Sons: New York, 1987.
L.J. Guibas, R. Motwani, and P. Raghavan, “The robot localization problem,” SIAM Journal on Computing, vol. 26(4), pp. 1120–1138, 1997.
N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press: New York, 1990.
B. Kuipers and Y. Byun, “A robot exploration and mapping strategy based on a semantic hierarchy of spatial representatinos,” Robotics and Autonomous Systems, vol. 8, pp. 47–63, 1991.
B. Kuipers and T. Levitt, “Navigation and mapping in large-scale space,” AI Mag., pp. 61–74, Summer 1988.
S. Kwek, “On a simple depth-first search strategy for exploring unknown graphs,” in Proc. of the 6th International Workshop on Algorithms and Data Structures (WADS'97), Halifax, Nova Scotia, Canada, August 6–8, 1997, pp. 345–353.
T.S. Levitt and D.T. Lawton, “Qualitative navigation for mobile robots,” Artificial Intelligence, vol. 44, pp. 305–360, 1990.
Petrisor Panaite and Andrzej Pelc, “Exploring unknown undirected graphs,” in Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98), 1998, pp. 316–322.
C. Papadimitriou and M. Yannakakis, “Shortest paths without a map,” Theoretical Comp. Science, vol. 84, pp. 127–150, 1991.
R.L. Rivest and R.E. Schapire, “Inference of finite automata using homing sequences,” Information and Computation, vol. 103, pp. 299–347, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Deng, X., Milios, E. & Mirzaian, A. Robot Map Verification of a Graph World. Journal of Combinatorial Optimization 5, 383–395 (2001). https://doi.org/10.1023/A:1011688823715
Issue Date:
DOI: https://doi.org/10.1023/A:1011688823715