A Framework for Learning in Search-Based Systems

We provide an overall framework for learning in search based systems that are used to find optimum solutions to problems. This framework assumes that prior knowledge is available in the form of one or more heuristic functions (or features) of the problem domain. An appropriate clustering strategy is used to partition the state space into a number of classes based on the available features. The number of classes formed will depend on the resource constraints of the system. In the training phase, example problems are run using a standard admissible search algorithm. In this phase, heuristic information corresponding to each class is learned. This new information can be used in the problem solving phase by appropriate search algorithms so that subsequent problem instances can be solved more efficiently. In this framework, we also show that heuristic information of forms other than the conventional single valued underestimate value can be used, since we maintain the heuristic of each class explicitly. We show some novel search algorithms that can work with some such forms. Experimental results have been provided for some domains.

[1]  Sudeshna Sarkar,et al.  Learning while solving problems in best first search , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[2]  Pat Langley,et al.  Trading Off Simplicity and Coverage in Incremental concept Learning , 1988, ML.

[3]  Benjamin W. Wah,et al.  Genetics-Based Learning of New Heuristics: Rational Scheduling of Experiments and Generalization , 1995, IEEE Trans. Knowl. Data Eng..

[4]  Henry W. Davis,et al.  Learning Admissible Heuristics while Solving Problems , 1991, IJCAI.

[5]  Henry W. Davis,et al.  The Statistical Learning of Accurate Heuristics , 1993, IJCAI.

[6]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[7]  Richard E. Korf,et al.  A Unified Theory of Heuristic Evaluation Functions and its Application to Learning , 1986, AAAI.

[8]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[9]  Hans J. Berliner,et al.  The B* Tree Search Algorithm: A Best-First Proof Procedure , 1979, Artif. Intell..

[10]  Hans J. Berliner,et al.  On the Construction of Evaluation Functions for Large Domains , 1979, IJCAI.

[11]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[12]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Judea Pearl,et al.  Studies in Semi-Admissible Heuristics , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Larry A. Rendell,et al.  A New Basis for State-Space Learning Systems and a Successful Implementation , 1983, Artif. Intell..

[15]  George Politowski.  On the construction of heuristic functions , 1986 .

[16]  G. Tesauro.  Practical Issues in Temporal Difference Learning , 1992 .

[17]  Terrence J. Sejnowski,et al.  A Parallel Network that Learns to Play Backgammon , 1989, Artif. Intell..

[18]  A. L. Samuel,et al.  Some studies in machine learning using the game of checkers. II: recent progress , 1967 .

[19]  Sanjoy Mahajan,et al.  A Pattern Classification Approach to Evaluation Function Learning , 1988, Artif. Intell..

[20]  Henry W. Davis,et al.  Strengthening Heuristics for Lower Cost Optimal and Near Optimal Solutions in A* Search , 1992, ECAI.

[21]  Pat Langley,et al.  Hill-Climbing Theories of Learning , 1987 .

[22]  Pat Langley,et al.  Representational Issues in Learning Systems , 1983, Computer.