Skip to main content
SpringerLink
Log in

On-line searching and navigation

  • Chapter
  • First Online:
Online Algorithms

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Albers and M.R. Henzinger, Exploring unknown environments, Proc. 29th STOC, 416–425 (1997).

    Google Scholar 

  2. Ariadne and Theseus, Path planning for a hero moving in an unknown labyrinth, Proc. Panhellenic Symp. on Attic Antics and Antiquities (1300 B.C.).

    Google Scholar 

  3. D. Angluin, J. Westbrook and W. Zhu, Robot Navigation with range queries, Proc. 28th STOC, 469–478 (1996).

    Google Scholar 

  4. R. A. Baeza-Yates, J. C. Coulbertson and G. J. E. Rawlings, Searching in the plane, Information and Computation, 106, 234–252 (1993).

    Article  Google Scholar 

  5. E. Bar-Eli, P. Berman, A. Fiat and P. Yan, On-line navigation in a room, Journal of Algorithms 17, 319–341 (1994).

    Article  MathSciNet  Google Scholar 

  6. M. A. Bender and D. K. Slonim, The power of team exploration: two robots can learn unlabeled directed graphs, Proc. 35th FOCS, 75–85 (1994).

    Google Scholar 

  7. P. Berman, A. Blum, A. Fiat, H. Karloff, A. Rosen and M. Saks, Randomized robot navigation algorithms, Proc. 7th SODA, 75–84 (1996).

    Google Scholar 

  8. P. Berman and M. Karpinski, Randomized Navigation to a Wall through Convex Obstacles, Bonn University Tech. Rep. 85118-CS (1994).

    Google Scholar 

  9. Y. Bartal, A. Blum, C. Burch and A. Tomkins, A polylog(n)-competitive algorithm for metrical task systems, Proc. 29th STOC, 711–719 (1997).

    Google Scholar 

  10. A. Blum and P. Chalasani, An on-line algorithm for improving performance in navigation, Proc. 34th FOCS, 2–11 (1993).

    Google Scholar 

  11. A. Blum, P. Raghavan, and B. Schieber, Navigation in unfamiliar terrain, Proc. 23rd STOC, 494–504 (1991).

    Google Scholar 

  12. A. Datta and C. Icking, Competitive searching in a generalized street, Proc. 10th ACM Symp. on Computational Geometry, 175–182 (1994).

    Google Scholar 

  13. A. Datta, C. Hipke and S. Schuierer, Competitive searching in polygons-beyond generalized streets, Proc. 6th ISAAC, 32–41 (1995).

    Google Scholar 

  14. X. Deng, T. Kameda and C. Papadimitriou, How to learn an unknown environment, Proc. 32nd FOCS, 298–303 (1991).

    Google Scholar 

  15. X. Deng, C. H. Papadimitriou, Exploring an unknown graph, Proc. 31st FOCS, 355–361 (1990).

    Google Scholar 

  16. G. Dudek, K. Romanik and S. Whitesides, Localizing a robot with minimum travel, Proc. 6th SODA, 437–446 (1995).

    Google Scholar 

  17. A. Fiat, D. Foster, H. Karloff, Y. Rabani, Y. Ravid and S. Vishwanathan, Competitive algorithms for layered graph traversal, Proc. 32nd FOCS, 288–297 (1991).

    Google Scholar 

  18. L. J. Guibas, R. Motwani and P. Raghavan, The robot localization problem in two dimensions, SIAM J. of Computing, 26, 1120–1138 (1997).

    Article  Google Scholar 

  19. F. Hoffmann, C. Icking, R. Klein and K. Kriegel, A competitive strategy for learning a polygon, Proc. 8th SODA, 166–174 (1997).

    Google Scholar 

  20. F. Hoffmann, C. Icking, R. Klein and K. Kriegel, The polygon exploration problem: a new strategy and a new analysis technique, to appear in Proc. Workshop on the Algorithmic Foundations of Robotics, (1998)

    Google Scholar 

  21. C. Icking and R. Klein, Searching for the kernel of a polygon — a competitive strategy, Proc. 11th ACM Symp. on Computational Geometry, 258–266 (1995).

    Google Scholar 

  22. B. Kalyanasundaram and K. R. Pruhs, Constructing competitive tours from local information, Proc. 20th ICALP, 102–113 (1993).

    Google Scholar 

  23. R. Klein, Walking an unknown street with bounded detour, Computational Geometry: Theory and Applications, 1, 325–351 (1992).

    Google Scholar 

  24. J. M. Kleinberg, On-line search in a simple polygon, Proc. 5th SODA, 8–15 (1994).

    Google Scholar 

  25. J. M. Kleinberg, The localization problem for mobile robots, Proc. 35th FOCS, 521–531 (1994).

    Google Scholar 

  26. M. Kao, J. H. Reif and S. R. Tate, Searching in an unknown environment: an optimal randomized algorithm for the cow path problem, Proc. 4th SODA, 441–447 (1993).

    Google Scholar 

  27. H. J. Karloff, Y. Rabani and Y. Ravid, Lower bounds for randomized server algorithms, Proc. 23rd STOC, 278–288 (1991).

    Google Scholar 

  28. A. Lopez-Ortiz and S. Schuierer, Generalized streets revisited Proc. 4th ESA, 546–558 (1996).

    Google Scholar 

  29. V. J. Lumelsky, A. A. Stepanov, Dynamic path planning for a mobile automaton with limited information on the environment, IEEE Transactions on Automatic Control, AC-31, 1058–1063, 1986.

    Article  Google Scholar 

  30. V. J. Lumelsky and A. A. Stepanov, Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape, Algorithmica, 2, 403–430. (1987).

    Article  Google Scholar 

  31. A. Mei and Y. Igarashi, Efficient strategies for robot navigation in unknown environment, Information Processing Letters, 52, 51–56 (1994).

    Google Scholar 

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

    Article  Google Scholar 

  33. H. Ramesh, On traversing layered graphs on-line, Journal of Algorithms, 18, 480–512 (1995).

    Article  Google Scholar 

  34. C. N. Shen and G. Nagy, Autonomous navigation to provide long distance surface traverses for Mars rover sample return mission, Proc. IEEE Symp. on Intelligent Control, 362–367 (1989).

    Google Scholar 

Download references

Authors
  1. Piotr Berman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Amos Fiat Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Berman, P. (1998). On-line searching and navigation. In: Fiat, A., Woeginger, G.J. (eds) Online Algorithms. Lecture Notes in Computer Science, vol 1442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029571

Download citation

  • DOI: https://doi.org/10.1007/BFb0029571

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64917-5

  • Online ISBN: 978-3-540-68311-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation