Abstract
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.
Our world model is restricted to graph maps. Within this model, there are several differences dealing with different robot sensors. Most often robots are assumed to have perfect vision. In this paper, however, we consider two different sensors: tokens and foot-prints. For the former, robots cannot recognize nodes or edges of the unknown graph under exploration but can drop some tokens which can be recognized if it returns to nodes where tokens are dropped. In the latter case, the robot has the power of knowing whether a node or an edge has been visited before, though it may not remember exactly when and where it was visited (similar to a traveler lost in the desert who recognizes its foot-print, or a robot smells its own trace).
With competitive analysis, we want to minimize the ratio of the total number of edges traversed for mapping the graph divided by the optimum number of edge traversais for verifying the map. In particular, we call a strategy competitive if this ratio is constant. As a first step, we have developed a competitive strategy to map an unknown embedded planar graph with pure foot-prints. Then we apply this technique to obtain an algorithm using n identical tokens to competitively map unknown planar embedded graphs. We also give a lower bound of competitive ratio Ω(n) for mapping general embedded graphs with a single token, when robot strategies are slightly restricted. This is tight since there is an algorithm of competitive ratio O(n) [DJMW].
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Authors' research was partly supported by NSERC grants.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E. Bar-Eli, P. Berman, A. Fiat, and P. Yan, “Online Navigation in a Room,” SODA 1992, pp. 237–249.
R.A. Baeza-Yates, J.C. Culberson, and G.J.E. Rawlins, “Searching in the Plane,” To appear in Information and Computation.
K.S.Booth, G.S.Lueker [1976] “Testing the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms” J.CSS. 13 (1976), 335–379.
B. Bollobas, “Extremal Graph Theory,” Academic Press, San Francisco, 1978.
A. Blum, P. Raghavan and B. Schieber, “Navigating in Unfamiliar Geometric Terrain,” STOC 1991, pp.494–504.
N.Chiba, T.Nishizeki, S.Abe [1985] “A linear algorithm for embedding planar graphs using PQ-trees” J.CSS. 30 (1985), 54–76.
G.Dudek, M. Jenkin, E. Milios, D. Wilkes, “Using Multiple markers in graph exploration,” SPIE Vol. 1195 Mobile Robots IV(1989), pp.77–87.
X. Deng, T. Kameda and C. H. Papadimitriou, “How to Learn an Unknown Environment,” FOCS 1991, pp.298–303.
X. Deng, and C. H. Papadimitriou, “Exploring an Unknown Graph,” FOCS 1990, pp.355–361.
A. Fiat, D.P. Foster, H. Karloff, Y. Rabani, Y. Ravid, and S. Vishwanathan, “Competitive Algorithms for Layered Graph Traversal,” FOCS 1991, pp.288–297.
L.J. Guibas and R. Motwani and P. Raghavan, “ The Robot Localization Problem in Two Dimensions”, SODA 1992, pp. 259–268.
J.E.Hopcroft, R.E.Tarjan [1973] “Efficient planarity testing”, JACM 21(4), 1973, 549–568.
B. Kuipers, and Y. Byun, “A Robot Exploration and Mapping Strategy Based on a Semantic Hierarchy of Spatial Representatinos,” Robotics and Autonomous Systems 8 (1991) 47–63.
R. Klein, “Walking an Unknown Street with Bounded Detour,” FOCS 1991, pp. 304–313.
B. Kalyanasundaram, and K. Pruhs, “A Competitive Analysis of Algorithms for Search Unknown Scenes,” manuscripts, 1991.
H. Karloff, Y. Rabani, and Y. Ravid, “Lower Bounds for Randomized k-Server and Motion-Planning Algorithms,” STOC 1991, pp. 278–288.
T.S. Levitt, and D. T. Lawton, “Qualitative Navigation for Mobile Robots,” Artificial Intelligence 44 (1990), 305–360.
C. Papadimitriou and M. Yannakakis, “Shortest paths without a map,” Proc. 16th ICALP, 1989, pp.610–620.
R. L. Rivest and R. E. Schapire, “Inference of Finite Automata Using Homing Sequences,” STOC 1989, pp.411–420.
Sleator, D.D. and Tarjan, R.E., Amortized efficiency of list update and paging rules,” Communications of the ACM 28(2), 1985, pp. 202–208.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deng, X., Mirzaian, A. (1993). Robot mapping: Foot-prints vs tokens. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_266
Download citation
DOI: https://doi.org/10.1007/3-540-57568-5_266
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57568-9
Online ISBN: 978-3-540-48233-8
eBook Packages: Springer Book Archive