Abstract
We consider the problem of a robot searching for an unknown, yet visually recognizable target in a street. A street is a simple polygon with start and target on the boundary so that the two boundary chains between them are weakly mutually visible. We are interested in the ratio of the search path length to the shortest path length which is called the competitive ratio of the strategy. We present an optimal strategy whose competitive ratio matches the known lower bound of √2, thereby closing the gap between the lower bound and the best known upper bound.
This research is supported by the DFG-Project “Diskrete Probleme”, No. Ot 64/8-2.
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
A. Blum, P. Raghavan, and B. Schieber. Navigating in unfamiliar geometric terrain. In Proc. 23rd ACM Symp. on Theory of Computing, pages 494–503, 1991.
A. Datta, Ch. Hipke, and S. Schuierer. Competitive searching in polygons-beyond generalized streets. In Proc. Sixth International Symposium on Algorithms and Computation, pages 32–41. LNCS 1004, 1995.
A. Datta and Ch. Icking. Competitive searching in a generalized street. In Proc. 10th ACM Symp. on Computational Geometry, pages 175–182, 1994.
Ch. Icking. Motion and Visibility in Simple Polygons. PHD thesis, FernUniversit:at Hagen, 1994.
Ch. Icking and R. Klein. Searching for the kernel of a polygon: A competitive strategy. In Proc. 11th ACM Symp. on Computational Geometry, pages 258–266, 1995.
Ch. Icking, R. Klein and E. Langetepe. An Optimal Competitive Strategy for Walking in Streets. This Proceedings.
Ch. Icking, A. Lopez-Ortiz, S. Schuierer, and I. Semrau. Going home through an unknown street. Manuscript, 1998. Submitted to Comptutational Geometry: Theory and Applications.
B. Kalyanasundaram and K. Pruhs. A competitive analysis of algorithms for searching unknownscenes. Computational Geometry: Theory and Applications, 3:139–155, 1993.
R. Klein. Walking an unknown street with bounded detour. Computationl Geometry: Theory and Applications, 1:325–351, 1992.
J. M. Kleinberg. On-line search in a simple polygon. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 8–15, 1994.
A. Lóopez-Ortiz. On-line Target Searching in Bounded and Unbounded Domains. PhD thesis, Department of Computer Science, University of Waterloo, 1996.
A. Lóopez-Ortiz and S. Schuierer. Going home through an unknown street. S. G. Akl, F. Dehne, and J.-R. Sack, editors, In Proc. of 4th Workshop on Data Structures and Algorithms, LNCS 955, pages 135–146, 1995.
A. López-Ortiz and S. Schuierer. Simple, efficient and robust strategies to traverse streets. In Ch. Gold and J.-M. Robert, editors, Proc. Seventh Canadian Conference on Computational Geometry, pages 217–222. Université Laval, 1995.
A. López-Ortiz and S. Schuierer. Walking streets faster. In Proc. 5th Scandinavian Workshop on Algorithm Theory, pages 345–356. LNCS 1097, 1996
A. López-Ortiz and S. Schuierer. Generalized streets revisited. In M. Serna J. Diaz, editor, Proc. 4th European Symposium on Algorithms, pages 546–558. LNCS 1136, 1996.
A. López-Ortiz and S. Schuierer. Position-independent near optimal searching and on-line recognition in star polygons. In Proc. 5th Workshop on Algorithms and Data Structures, pages 284–296. LNCS 1272, 1997.
A. López-Ortiz and S. Schuierer. The Exact Cost of Exploring Streets with a CAB. In Proc. 10th Canadian Conf. on Computational Geometry, 1998.
I. Semrau. Analyse und experimentelle Untersuchung von Strategien zum Finden eines Ziels in Straßenpolygonen. Masters thesis (Diplomarbeit), FernUniversität Hagen, 1996.
D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, 1985.
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
Schuierer, S., Semrau, I. (1999). An Optimal Strategy for Searching in Unknown 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_11
Download citation
DOI: https://doi.org/10.1007/3-540-49116-3_11
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