Skip to main content
SpringerLink
Log in

Searching for an Axis-Parallel Shoreline

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6508))

  • 768 Accesses

Abstract

We are searching for an unknown horizontal or vertical line in the plane under the competitive framework. We design a framework for lower bounds on all cyclic and monotone strategies that result in two-sequence functionals. For optimizing such functionals we apply a method that combines two main paradigms. The given solution shows that the combination method is of general interest. Finally, we obtain the current best strategy and can prove that this is the best strategy among all cyclic and monotone strategies which is a main step toward a lower bound construction.

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. Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publications, Dordrecht (2003)

    MATH  Google Scholar 

  2. Baeza-Yates, R., Culberson, J., Rawlins, G.: Searching in the plane. Inform. Comput. 106, 234–252 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chrobak, M.: A princess swimming in the fog looking for a monster cow. SIGACT News 35(2), 74–78 (2004)

    Article  Google Scholar 

  4. Fiat, A., Woeginger, G. (eds.): On-line Algorithms: The State of the Art. LNCS, vol. 1442. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  5. Finch, S.R., Zhu, L.-Y.: Searching for a shoreline (2005)

    Google Scholar 

  6. Gal, S.: Search Games. Mathematics in Science and Engineering, vol. 149. Academic Press, New York (1980)

    MATH  Google Scholar 

  7. Gal, S., Chazan, D.: On the optimality of the exponential functions for some minmax problems. SIAM J. Appl. Math. 30, 324–348 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  8. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  9. Hipke, C., Icking, C., Klein, R., Langetepe, E.: How to find a point on a line within a fixed distance. Discrete Appl. Math. 93, 67–73 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Icking, C., Kamphans, T., Klein, R., Langetepe, E.: On the competitive complexity of navigation tasks. In: Hager, G.D., Christensen, H.I., Bunke, H., Klein, R. (eds.) Dagstuhl Seminar 2000. LNCS, vol. 2238, pp. 245–258. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Jeż, A., Łopuszański, J.: On the two-dimensional cow search problem. Inf. Process. Lett. 109(11), 543–547 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kamphans, T., Langetepe, E.: On optimizing multi-sequence functionals for competitive analysis. In: Abstracts 21st European Workshop Comput. Geom., pp. 111–114 (2005)

    Google Scholar 

  13. Kamphans, T., Langetepe, E.: Optimal competitive online ray search with an error-prone robot. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 593–596. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Kao, M.-Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Inform. Comput. 133(1), 63–79 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  15. Langetepe, E.: Design and Analysis of Strategies for Autonomous Systems in Motion Planning. PhD thesis, Dep. of Comp. Science, University of Hagen (2000)

    Google Scholar 

  16. Langetepe, E.: On the optimality of spiral search. In: SODA 2010: Proc. 21st Annu. ACM-SIAM Symp. Disc. Algor., pp. 1–12 (2010)

    Google Scholar 

  17. Langetepe, E.: Optimizing two-sequence functionals for competitive analysis. Accepted for Computer Science – Research and Development (2010)

    Google Scholar 

  18. López-Ortiz, A., Schuierer, S.: The ultimate strategy to search on m rays? Theor. Comput. Sci. 261(2), 267–295 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  19. Rao, N.S.V., Kareti, S., Shi, W., Iyengar, S.S.: Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms. Technical Report ORNL/TM-12410, Oak Ridge National Laboratory (1993)

    Google Scholar 

  20. Schuierer, S.: Searching on m bounded rays optimally. Technical Report 112, Institut für Informatik, Universität Freiburg, Germany (1998)

    Google Scholar 

  21. Schuierer, S.: Lower bounds in on-line geometric searching. Comput. Geom. Theory Appl. 18, 37–53 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  22. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28, 202–208 (1985)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science I, University of Bonn, Bonn, Germany

    Elmar Langetepe

Authors
  1. Elmar Langetepe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Weili Wu  & Ovidiu Daescu  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Langetepe, E. (2010). Searching for an Axis-Parallel Shoreline. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17458-2_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17458-2_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17457-5

  • Online ISBN: 978-3-642-17458-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation