Abstract
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √2, thus matching the best lower bound known before. This finally settles an interesting open problem in the area of competitive path planning many authors have been working on.
This work was supported by the Deutsche Forschungsgemeinschaft, grant Kl 655/8-3.
This is a preview of subscription content, log in via an institution to check access.
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
D. Angluin, J. Westbrook, and W. Zhu. Robot navigation with range queries. In Proc. 28th Annu. ACM Sympos. Theory Comput., pages 469–478, May 1996.
R. Baeza-Yates, J. Culberson, and G. Rawlins. Searching in the plane. Inform. Comput., 106:234–252, 1993.
P. Berman. On-line searching and navigation. In A. Fiat and G. Woeginger, editors, Competitive Analysis of Algorithms. Springer-Verlag, 1998.
A. Blum, P. Raghavan, and B. Schieber. Navigating in unfamiliar geometric terrain. SIAM J. Comput., 26(1):110–137, Feb. 1997.
G. Das, P. Heffernan, and G. Narasimhan. LR-visibility in polygons. Comput. Geom. Theory Appl., 7:37–57, 1997.
S. K. Ghosh and S. Saluja. Optimal on-line algorithms for walking with minimum number of turns in unkn. streets. Comput. Geom. Theory Appl., 8:241–266, 1997.
C. Icking. Motion and Visibility in Simple Polygons. PhD thesis, FernUniversität Hagen, 1994.
C. Icking, A. López-Ortiz, S. Schuierer, and I. Semrau. Going home through an unknown street. Technical Report 228, Dep. of Comp. Science, FernUniversität Hagen, 1998. http://wwwpi6.fernuni-hagen.de/Publikationen/tr228.pdf, submitted.
R. Klein. Walking an unknown street with bounded detour. Comput. Geom. Theory Appl., 1:325–351, 1992.
J. M. Kleinberg. On-line search in a simple polygon. In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pages 8–15, 1994.
A. López-Ortiz and S. Schuierer. Going home through an unknown street. In Proc. 4th Workshop Algorithms Data Struct., volume 955 of Lecture Notes Comput. Sci., pages 135–146. Springer-Verlag, 1995.
A. López-Ortiz and S. Schuierer. Walking streets faster. In Proc. 5th Scand. Workshop Algorithm Theory, volume 1097 of Lecture Notes Comput. Sci., pages 345–356. Springer-Verlag, 1996.
J. S. B. Mitchell. Geometric shortest paths and network optimization. In J. R. Sack and J. Urrutia, editors, Handbook of Computational Geometry. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 1998.
N. S. V. Rao, S. Kareti, W. Shi, and S. S. Iyengar. Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms. Technical Report ORNL/TM-12410, Oak Ridge National Laboratory, 1993.
S. Schuierer and I. Semrau. An optimal strategy for searching in unknown streets. Institut für Informatik, Universität Freiburg, 1998.
I. Semrau. Analyse und experimentelle Untersuchung von Strategien zum Finden eines Ziels in Straßenpolygonen. Diploma thesis, FernUniversität Hagen, 1996.
L. H. Tseng, P. Heffernan, and D. T. Lee. Two-guard walkability of simple polygons. Internat. J. Comput. Geom. Appl., 8(1):85–116, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Icking, C., Klein, R., Langetepe, E. (1999). An Optimal Competitive Strategy for Walking in Streets. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_10
Download citation
DOI: https://doi.org/10.1007/3-540-49116-3_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65691-3
Online ISBN: 978-3-540-49116-3
eBook Packages: Springer Book Archive