Online algorithm for improving performance in navigation

SIAM Journal on Computing

Volumn 29, Issue 6, 2000, Pages 1907-1938

  Blum, Avrim ^a   Chalasani, Prasad ^b  

^a Carnegie Mellon University ^*  (United States)

^b HBK Investments   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INTELLIGENT ROBOTS; LEARNING SYSTEMS; MOTION PLANNING; ROBOT PROGRAMMING; TREES (MATHEMATICS);

ONLINE ALGORITHMS; ROBOT PATH PLANNING;

ONLINE SYSTEMS;

EID: 0034479941     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795290593     Document Type: Article

References (18)

1. R. BAEZA-YATES, J. CULBERSON, AND G. RAWLINS, Searching in the plane, Inform. and Comput., 106 (1993), pp. 234-252.
2. P. BERMAN, A. BLUM, A. FIAT, H. KARLOFF, A. ROSEN, AND M. SAKS, Randomized Robot Navigation Algorithms, manuscript.
3. E. BAR-ELI, P. BERMAN, A. FIAT, AND P. YAN, On-line navigation in a room, in Proceedings of the Third ACM-SIAM Symposium on Discrete Algorithms, Orlando, FL, 1992, pp. 237-249.
4. P. BERMAN AND M. KARPINSKI, Wall Problem with Convex Obstacles, manuscript, July 1994.
5. M. BETKE, R. RIVEST, AND M. SINGH, Piecemeal learning of an unknown environment, in Proceedings of the Sixth ACM Conference on Computational Learning Theory, 1993, pp. 277-286.
6. A. BLUM AND P. CHALASANI, An online algorithm for improving performance in navigation, in Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993, pp. 2-11.
7. A. BLUM, P. RAGHAVAN, AND B. SCHIEBER, Navigating in unfamiliar geometric terrain, in Proceedings of the 23rd ACM Symposium on the Theory of Computing, 1991.
8. P. CHALASANI, Online Performance-Improvement Algorithms, Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, PA, 1994.
9. P. CHEN, Improving path planning with learning, in Proceedings of the Ninth International Workshop on Machine Learning, 1992.
10. E.G. COFFMAN AND E.N. GILBERT, Paths through a maze of rectangles, Networks, 22 (1992), pp. 349-367.
11. H. KARLOFF, Y. RABANI, AND Y. RAVID, Lower bounds for randomized k-server and motion-planning algorithms, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 278-288.
12. S. KOENIG AND R.G. SIMMONS, Complexity analysis of real-time reinforcement learning, in Proceedings of the AAAI, 1993, pp. 99-105.
13. V. LUMELSKY, Algorithmic issues of sensor-based robot motion planning, in 26th IEEE Conference on Decision, 1987, pp. 1796-1801.
14. V. LUMELSKY, Algorithmic and complexity issues of robot motion in an uncertain environment, J. Complexity, 3 (1987), pp. 146-182.
15. V. LUMELSKY AND A. STEPANOV, Dynamic path planning for a mobile automaton with limited information on the environment, IEEE Trans. Automat. Control, 31 (1986), pp. 1058-1063.
16. M.S. MANASSE, L.A. MCGEOCH, AND D.D. SLEATOR, Competitive algorithms for online problems, J. Algorithms, 11 (1990), pp. 208-230.
17. C. PAPADIMITRIOU AND M. YANNAKAKIS, Shortest paths without a map, in Proceedings of the 16th International Collegian on Automata, Languages, and Programming, 1989.
18. S. THRUN, Efficient Exploration in Reinforcement Learning, Technical Report CMU-CS-92-102, Carnegie-Mellon University, Pittsburgh, PA, 1992.