Skip to main content
SpringerLink
Log in

Searching Rectilinear Streets Completely

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1663))

Included in the following conference series:

Abstract

We consider the on-line navigation problem of a robot inside an unknown polygon P. The robot has to find a path from a starting point to an unknown goal point and it is equipped with on-board cameras through which it can get the visibility map of its immediate surroundings. It is known that if P is a street with respect to two points s and t then starting at s the robot can find t with a constant competitive ratio. In this paper we consider the case where the robot is inside a rectilinear street but looks for an arbitrary goal point g instead of t. Furthermore, it may start at some point different from s. We show that in both cases a constant competitive ratio can be achieved and establish lower bounds for this ratio. If the robot starts at s, then our lower and upper bound match, that is, our algorithm is optimal.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Berman, A. Blum, A. Fiat, H. Karloff, A. Rosén, and M. Saks. Randomized robot navigation algorithms. In Proc. 7th ACM-SIAM Symp. On Discrete Algorithms, 1996.

    Google Scholar 

  2. E. Bar-Eli, P. Berman, A. Fiat, and P. Yan. Online navigation in a room. J. Algorithms, 17:319–341, 1994.

    Article  MathSciNet  Google Scholar 

  3. A. Blum, P. Raghavan, and B. Schieber. Navigating in unfamiliar geometric terrain. In Proc. 23rd ACM Sympos. Theory Comput., pages 494–503, 1991.

    Google Scholar 

  4. R. A. Baeza-Yates, J. C. Culberson, and G. J. Rawlins. Searching in the plane. Information and Computation, 106:234–252, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  5. K-F. Chan and T. W. Lam. An on-line algorithm for navigating in an unknown environment. Computational Geometry: Theory and Applications, 3:227–244, 1993.

    MathSciNet  MATH  Google Scholar 

  6. A. Datta, Ch. Hipke, and S. Schuierer. Competitive searching in polygons-beyond generalized streets. In J. Staples, P. Eades, N. Katoh, and A. Moffat, editors, Proc. Sixth Annual International Symposium on Algorithms and Computation, pages 32–41. LNCS 1004, 1995.

    Google Scholar 

  7. A. Datta and Ch. Icking. Competitive searching in a generalized street. In Proc. of the 10th Annual ACM Symp. on Computational Geometry, pages 175–182, 1994.

    Google Scholar 

  8. X. Deng, T. Kameda, and C. Papadimitriou. How to learn an unknown environment I: The rectilinear case. J. of the ACM, 45(2):215–245, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  9. P. Eades, X. Lin, and N. C. Wormald. Performance guarantees for motion planning with temporal uncertainty. The Australian Computer Journal, 25(1):21–28, 1993.

    Google Scholar 

  10. S. Gal. Search Games. Academic Press, 1980.

    Google Scholar 

  11. Ch. Icking, R. Klein, and E. Langetepe. An optimal competitive strategy for walking in streets. In Proc. 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 110–120, LNCS 1563, 1999.

    Google Scholar 

  12. R. Klein. Walking an unknown street with bounded detour. In Proc. 32nd IEEE Symp. On Foundations of Computer Science, pages 304–313, 1991.

    Google Scholar 

  13. J. M. Kleinberg. On-line search in a simple polygon. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 8–15, 1994.

    Google Scholar 

  14. B. Kalyanasundaram and K. Pruhs. A competitive analysis of algorithms for searching unknown scenes. Computational Geometry: Theory and Applications, 3:139–155, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  15. 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.

    Chapter  Google Scholar 

  16. A. Mei and Y. Igarashi. An efficiency strategy for robot navigation in unknown environment. Information Processing Letters, 52(1):51–56, 1994.

    Article  Google Scholar 

  17. C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. Theoretical Computer Science, 84(1):127–150, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  18. S. Schuierer. On-line searching in geometric trees. In Proc. 9th Canadian Conf. On Computational Geometry, pages 135–140, 1997.

    Google Scholar 

  19. S. Schuierer and I. Semrau. An optimal strategy for searching in unknown streets. In Proc. 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 121–131, LNCS 1563, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universitäat Freiburg, Am Flughafen 17, 79110, Freiburg, Germany

    Christoph A. Bröcker & Sven Schuierer

Authors
  1. Christoph A. Bröcker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sven Schuierer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada, K1S 5B6

    Frank Dehne  & Jörg-Rüdiger Sack  & 

  2. School of Computer Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6

    Arvind Gupta

  3. Center for Geometric Computing Providence, Brown University, RI, 02912-1910, USA

    Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bröcker, C.A., Schuierer, S. (1999). Searching Rectilinear Streets Completely. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-48447-7_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66279-2

  • Online ISBN: 978-3-540-48447-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation