Utility-based on-line exploration for repeated navigation in an embedded graph

Artificial Intelligence

Volumn 101, Issue 1-2, 1998, Pages 267-284

  Argamon Engelson, Shlomo ^a   Kraus, Sarit ^a,b   Sina, Sigalit ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Exploration versus exploitation; Navigation on embedded graphs; Repeated tasks; Utility based search

Indexed keywords

ALGORITHMS; GRAPH THEORY; LEARNING SYSTEMS; NAVIGATION; RECURSIVE FUNCTIONS;

EMBEDDED GRAPHS; REPEATED TASKS; UTILITY BASED SEARCH;

ARTIFICIAL INTELLIGENCE;

EID: 0032072803     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(98)00014-9     Document Type: Article

References (29)

1. C.B. Barber and H. Huhdanpaa, Qhull software package (1995). http://www.geom.umn.edu/software/qhull.
2. K. Basye, T. Dean and J.S. Vitter, Coping with uncertainty in map learning, Technical Report CS-89-27, Brown University, Department of Computer Science, 1989.
3. R. Bellman, Dynamic Programming, Princeton Univ. Press, Princeton, 1957.
4. D.A. Berry and B. Fristedt, Bandit Problems: Sequential Allocation of Experiments, Chapman and Hall, London, 1985.
5. D.P. Bertsekas, Dynamic Programming: Deterministic and Stochastic Models, Prentice-Hall, Englewood Cliffs, NJ, 1987.
6. M. Betke, R.L. Rivest and M. Singh, Piecemeal learning of an unknown environment, Machine Learning 18 (2-3) (1995) 231-254.
7. A. Blum and P. Chalasani, An on-line algorithm for improving performance in navigation, in: Proceedings Symposium on Foundations of Computer Science, 1993, pp. 2-11.
8. F. Chimura and M. Tokoro, The trailblazer search: a new method for searching and capturing moving targets, in: Proceedings AAAI-94, Seattle, WA, 1994, pp. 1347-1352.
9. P. Cucka, N.S. Netanyahu and A. Rosenfeld, Learning in navigation: goal finding in graphs, Internat. J. Pattern Recognition and Artificial Intelligence 10 (5) (1996) 429-446.
10. T. Dean, D. Angluin, K. Basye, S. Engelson, L. Kaelbling, E. Kokkevis and O. Maron, Inferring finite automata with stochastic output functions and an application to map learning, Machine Learning 18 (1) (1995) 81-108.
11. T. Dean, L.P. Kaelbling, J. Kirman and A. Nicholson, Planning under time constraints in stochastic domains, Artificial Intelligence 76 (1-2) (1995) 35-74.
12. X. Deng, T. Kameda and C. Papadimitriou, How to learn in an unknown environment, in: Proceedings 32nd Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 298-303.
13. X. Deng and C.H. Papadimitriou, Exploring an unknown graph, in: Proceedings 31st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1990, pp. 355-361.
14. J.L. Devore, Probability and Statistics for Engineering and Sciences, Brooks/Cole Publishing Company, Pacific Grove, CA, 1991.
15. O. Etzioni, Embedding decision-analytic control in a learning architecture, Artificial Intelligence 49 (1991) 129-159.
16. P. Haddawy, A. Doan and R. Goodwin, Efficient decision-theoretic planning: techniques and empirical analysis, in: Proceedings Conference on Uncertainty in Artificial Intelligence, 1995, pp. 229-236.
17. T. Ishida and R. Korf, A moving target search: a real-time search for changing goals, IEEE Trans. Pattern Analysis and Machine Intelligence 17 (6) (1995) 609-619.
18. T. Ishida and M. Shimbo, Improving the learning efficiencies of realtime search, in: Proceedings AAAI-96, Portland, OR, 1996, pp. 305-310.
19. L.P. Kaelbling, Learning in Embedded Systems, The MIT Press, Cambridge, MA, 1993.
20. L.P. Kaelbling, M.L. Littman and A.W. Moore, Reinforcement learning: a survey, J. Artif. Intell. Res. 4 (1996) 237-285.
21. G.I. Karakoulas, Probabilistic exploration in planning while learning, in: P. Besnard and S. Hanks (Eds.), Eleventh Annual Conference on Uncertainty in Artificial Intelligence, 1995, pp. 352-361.
22. R. Korf, Real-time heuristic search, Artificial Intelligence 42 (2-3) (1990) 189-211.
23. A.W. Moore and C.G. Atkeson, Prioritized sweeping: reinforcement learning with less data and less real time, Machine Learning 13 (1993).
24. C.H. Papadimitriou and M. Yannakakis, Shortest paths without a map, Theoret. Comput. Sci. 84 (1) (1991) 127-150.
25. M.L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, John Wiley & Sons, New York, 1994.
26. R.L. Rivest and R.E. Schapire, Inference of finite automata using homing sequences (extended abstract), in: Proceedings Twenty-First Annual ACM Symposium on Theory of Computing, Seattle, WA, 1989, pp. 411-420.
27. Y. Smirnov, S. Koenig, M.M. Veloso and R.G. Simmons, Efficient goaldirected exploration, in: Proceedings AAAI-96, Portland, OR, 1996, pp. 292-297.
28. R.S. Sutton, Integrated architectures for learning, planning, and reacting based on approximating dynamic programming, in: Proceedings Seventh International Conference on Machine Learning, Austin, TX, Morgan Kaufmann, San Mateo, CA, 1990, pp. 216-224.
29. S. Thrun, The role of exploration in learning control, in: Handbook for Intelligent Control: Neural, Fuzzy and Adaptive Approaches, Van Nostrand Reinhold, Florence, KY, 1992.