This paper is concerned with state space problem solvers that achieve generality by learning strong heuristics through experience in a particular domain. We specifically consider two ways of learning by analysing past solutions that can improve future problem solving: creating macros and the chunks. A method of learning search heuristics is specified which is related to 'chunking' but which complements the use of macros within a goal directed system. An example of the creation and combined use of macros and chunks, taken from an implemented system, is described
Many current state-of-the-art planners rely on forward heuristic search. The success of such search ...
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently g...
General-purpose generative planners use domain-independent search heuristics to generate solutions f...
AbstractWe investigate the use of machine learning to create effective heuristics for search algorit...
In this paper we propose a technique for learning efficient strategies for solving a certain class o...
We provide an overall framework for learning in search based systems that are used to find optimum s...
Abstract—In this paper, we investigate experimentally the efficacy of semi-automatically constructed...
In Artificial Intelligence (AI), there exist formalised approaches and algorithms for general proble...
Abstract: In this article we describe an approach to the construction of a general learning mechanis...
Heuristics are strategies using readily accessible, loosely applicable information to control proble...
A method is presented that causes A * to return high quality solutions while solving a set of proble...
Abstract. Problem solvers have at their disposal many heuristics that may support effective search. ...
Problem Solving systems customarily use backtracking to deal with obstacles that they encounter in t...
Problem solvers, both human and machine, have at their disposal many heuristics that may support eff...
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently g...
Many current state-of-the-art planners rely on forward heuristic search. The success of such search ...
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently g...
General-purpose generative planners use domain-independent search heuristics to generate solutions f...
AbstractWe investigate the use of machine learning to create effective heuristics for search algorit...
In this paper we propose a technique for learning efficient strategies for solving a certain class o...
We provide an overall framework for learning in search based systems that are used to find optimum s...
Abstract—In this paper, we investigate experimentally the efficacy of semi-automatically constructed...
In Artificial Intelligence (AI), there exist formalised approaches and algorithms for general proble...
Abstract: In this article we describe an approach to the construction of a general learning mechanis...
Heuristics are strategies using readily accessible, loosely applicable information to control proble...
A method is presented that causes A * to return high quality solutions while solving a set of proble...
Abstract. Problem solvers have at their disposal many heuristics that may support effective search. ...
Problem Solving systems customarily use backtracking to deal with obstacles that they encounter in t...
Problem solvers, both human and machine, have at their disposal many heuristics that may support eff...
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently g...
Many current state-of-the-art planners rely on forward heuristic search. The success of such search ...
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently g...
General-purpose generative planners use domain-independent search heuristics to generate solutions f...