Abstract
We study the problem of exploring a simple grid polygon using a mobile robot. The robot starts from a location which is adjacent to the boundary of the polygon, and after exploring all the squares, has to return to its starting location. The robot is equipped with memory, but has no prior knowledge of the explored terrain. The view of the terrain is restricted to the four squares directly adjacent to the robot’s current location. The performance of the exploration strategy is measured in terms of the competitive ratio, with respect to the length of the optimal path for an exploration with complete knowledge of the terrain.
We propose a new exploration strategy which achieves a competitive ratio of 5/4, whereas the previously best approach [Icking, Kamphans, Klein, and Langetepe; Proc. COCOON’05] has a competitive ratio of 4/3. The analysis for our algorithm is tight. Moreover, we show that no exploration strategy is ever better than 20/17-competitive, thus improving the previous lower bound of 7/6.
The research was partially funded by the KBN Grant 4 T11C 047 25, by the ANR project “ALADDIN”, and by the INRIA project “CEPAGE”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arkin, E.M., Fekete, S.P., Islam, K., Meijer, H., Mitchell, J.S.B., Nunez-Rodriguez, Y., Polishchuk, V., Rappaport, D., Xiao, H.: Not being (super)thin or solid is hard: A study of grid hamiltonicity. Computational Geometry: Theory and Applications 42(6-7), 582–605 (2009)
Arkin, E.M., Fekete, S.P., Mitchell, J.S.B.: Approximation algorithms for lawn mowing and milling. Computational Geometry: Theory and Applications 17(1-2), 25–50 (2000)
Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM 45(5), 753–782 (1998)
Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theoretical Computer Science 345(2-3), 331–344 (2005)
Gabriely, Y., Rimon, E.: Competitive on-line coverage of grid environments by a mobile robot. Computational Geometry: Theory and Applications 24(3), 197–224 (2003)
Gąsieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 585–594 (2007)
Gordon, V.S., Orlovich, Y.L., Werner, F.: Hamiltonian properties of triangular grid graphs. Discrete Mathematics 308(24), 6166–6188 (2008)
Grigni, M., Koutsoupias, E., Papadimitriou, C.: An approximation scheme for planar graph TSP. In: Proceedings of the Thirty-Sixth Annual IEEE Symposium on the Foundations of Computer Science (FOCS 1995), pp. 387–411 (1995)
Herrmann, D., Kamphans, T., Langetepe, E.: Exploring simple triangular and hexagonal grid polygons online. In: Abstracts of the 24th European Workshop on Computational Geometry, pp. 177–180 (2008)
Icking, C., Kamphans, T., Klein, R., Langetepe, E.: Exploring an unknown cellular environment. In: Abstracts of the 16th European Workshop on Computational Geometry, pp. 140–143 (2000)
Icking, C., Kamphans, T., Klein, R., Langetepe, E.: Exploring simple grid polygons. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 524–533. Springer, Heidelberg (2005)
Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM Journal on Computing 11(4), 676–686 (1982)
Kamphans, T.: Models and Algorithms for Online Exploration and Search. Ph.D. thesis, Rheinischen Friedrich-Wilhelms-Universität Bonn (2005)
Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing 28(4), 1298–1309 (1999)
Reingold, O.: Undirected ST-Connectivity in Log-Space. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 376–385 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kolenderska, A., Kosowski, A., Małafiejski, M., Żyliński, P. (2010). An Improved Strategy for Exploring a Grid Polygon. In: Kutten, S., Žerovnik, J. (eds) Structural Information and Communication Complexity. SIROCCO 2009. Lecture Notes in Computer Science, vol 5869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11476-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-11476-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11475-5
Online ISBN: 978-3-642-11476-2
eBook Packages: Computer ScienceComputer Science (R0)