Randomized robot navigation algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 75-84

  Berman, Piotr ^a   Blum, Avrim ^b   Fiat, Amos ^c   Karloff, Howard ^d   Rosén, Adi ^c   Saks, Michael ^e  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b Carnegie Mellon University   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d Georgia Institute of Technology   (United States)

^e RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

COMPETITIVE RATIO; DETERMINISTIC ALGORITHMS; INFORMATION GATHERING; ON-LINE PROCESS; PRIOR KNOWLEDGE; RANDOMIZED ALGORITHMS; RECTANGULAR OBSTACLES; ROBOT NAVIGATION;

ROBOTS;

EID: 84966888626     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. R.A. Baeza-Yates, J.C. Culberson, and G.J.E. Rawlins. Searching in the Plane. Information and Computation, 1993.
2. E. Bar-Eli, P. Berman, A. Fiat, and P. Yan. Online Navigation in a Room. In Proc. 3rd ACM-SIAM SODA, 1992.
3. S. Ben-David, A. Borodin, R.M. Karp, G. Tardos, and A. Wigderson. On the Power of Randomization in Online Algorithms. In Proc. of the 22nd Ann. ACM Symp. on Theory of Computing, pp. 379-386, May 1990.
4. A. Blum, P. Chalasani. An On-line Algorithm for Improving Performance in Navigation. In Proc. 34th IEEE Annual Symp. on Foundations of Comp. Science, pp. 2-11, 1993.
5. A. Blum, P. Raghavan, and B. Schieber. Navigating in Unfamiliar Geometric Terrain. In Proc. 23rd ACM STOC, 1991.
6. A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In Proc. 19th Annual ACM Symposium on Theory of Computing, pp. 373-382, 1987.
7. P. Chalasani. Online Performance-Improvement Algorithms. Ph. D thesis. CMU tech report CMU-CS-94-179. August 1994.
8. X. Deng, T. Kameda, and C. Papadimitriou. How to Learn an Unknown Environment I: The Rectilinear Case. Tech. Report CS-93-04, Dept. of Comp. Science, York University.
9. A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator, and N.E. Young. Competitive Paging Algorithms. Journal of Algorithms, 12:685-699, 1991.
10. Y. Gurevich and S. Shelah. Expected computation time for Hamiltonian path problem. SIAM J. Comput, 16(3) pp. 486-502, 1987.
11. T. Hagerup, and C. Rüb. A Guided Tour of Chernoff Bounds. Information Processing Letters 33 (1990), pp. 305-308.
12. J. Kleinberg. On-Line Search in a Polygon. In Proc. 5th ACM-SIAM SODA, pp. 8-15, 1994.
13. H. Karloff, Y. Rabani, and Y. Ravid. Lower Bounds for Randomized k-Server and Motion-Planning Algorithms. SIAM Journal on Computing 23 (1994), 293-312.
14. M. Kao, J. Reif, and S. Tate. Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. In Proc. 4th ACM-SIAM SODA, pp 304-313, 1993.
15. J.-C. Latombe. Robot Motion Planning, Kluwer Academic Publishers, Boston, 1991.
16. M.S. Manasse, L.A. McGeoch, and D.D. Sleator. Competitive algorithms for on-line problems. Journal of Algorithms, 11, pp. 208-230, 1990.
17. C. Papadimitriou, and M. Yannakakis. Shortest Paths Without a Map. Theoretical Computer Science, 84(1991), pp. 127-150.
18. M. Sharir. Algorithmic motion planning in robotics, Computer 22, March 1989, pp. 9-20.
19. D.D. Sleator and R.E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communication of the ACM, 28(2) pp. 202-208, 1985.