Learning while solving problems in best first search

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 28, Issue 4, 1998, Pages 535-542

  Sarkar, Sudeshna ^a   Chakrabarti, P P ^b   Ghose, Sujoy ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Anytime algorithm; Best first search; Continuous learning; Heuristic features; Learning; Problem solving

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; KNOWLEDGE ACQUISITION; MATHEMATICAL MODELS; ONLINE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

ANYTIME ALGORITHMS; BEST FIRST SEARCH;

LEARNING SYSTEMS;

EID: 0032123915     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/3468.686716     Document Type: Article

References (18)

1. N. J. Nilsson, Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
2. G. Guida and M. Somalvico, "A method for computing heuristics in problem solving," Inf. Sci., vol. 19, pp. 251-259, 1979.
3. J. G. Gaschnig, "Performance measurement and analysis of certain search algorithms," Ph.D. dissertation, Carnegie Melon Univ., Pittsburgh, PA, 1979.
4. J. Pearl, HEURISTICS - Intelligent Search Strategies for Computer Problem Solving. Reading, MA: Addison-Wesley, 1984.
5. M. Valtorta, "A result on the computational complexity of heuristic estimates for the A* algorithm," Inf. Sci., vol. 34, pp. 47-59, 1984.
6. J. Mostow and A. Prieditis, "Discovering admissible heuristics by abstracting and optimizing," in Proc. 11th Int. Joint Conf. Artificial Intelligence, 1989.
7. A. E. Prieditis, "Machine discovery of effective admissible heuristics," Mach. Learn., vol. 12, Aug. 1993.
8. A. Samuel, "Some studies in machine learning using the game of checkers," in Computers and Thought, A. Feigenbaum and J. Feldman, Eds. New York: McGraw-Hill, 1963.
9. _, "Some studies in machine learning using the game of checkers ii - Recent progress," IBM J. Res. Develop., vol. 11, pp. 601-607, 1967.
10. K. F. Lee and S. Mahajan, "A pattern classification approach to heuristic function learning," Artif. Intell., vol. 36, 1988.
11. J. Christensen and R. E. Korf, "A unified theory of heuristic evaluation function learning," in Proc. 5th Nat. Conf. Artificial Intelligence, 1986.
12. A. Bramanti-Gregor and H. W. Davis, "Learning admissible heuristics while solving problems," in Proc. 12th Int. Joint Conf. Artificial Intelligence, 1991.
13. _, "Strengthening heuristics for lower cost optimal and near optimal solution in A* search," in Proc. Eur. Conf. Artificial Intelligence, 1992, pp. 6-10.
14. _, "The statistical learning of accurate heuristics," in Proc. 13th Int. Joint Conf. Artificial Intelligence, 1993, pp. 1079-1085.
15. G. Politowski, "On the construction of heuristic functions," Ph.D. dissertation, Univ. Calif., Santa Cruz, 1986.
16. S. V. Chenoweth and H. W. Davis, "High-performance A* search using rapidly growing heuristics," in Proc. 12th Int. Joint Conf. Artificial Intelligence, 1991.
17. L. G. Valiant, "A theory of the learnable," Commun. ACM, vol. 27, pp. 1134-1142, 1984.
18. S. Sarkar, "New approaches to heuristic search involving learning and approximations," Ph.D. dissertation, Indian Institute of Technology, Kharagpur, 1996.