The purpose of this article is to present a multi-strategy approach to learn heuristics for planning. This multi-strategy system, called HAMLET-EVOCK, combines a learning algorithm specialized in planning (HAMLET) and a genetic programming (GP) based system (EVOCK: Evolution of Control Knowledge). Both systems are able to learn heuristics for planning on their own, but both of them have weaknesses. Based on previous experience and some experiments performed in this article, it is hypothesized that HAMLET handicaps are due to its example-driven operators and not having a way to evaluate the usefulness of its control knowledge. It is also hypothesized that even if HAMLET control knowledge is sometimes incorrect, it might be easily correctable...
Genetic algorithms (GA'S) are global, parallel, stochastic search methods, founded on Darwinian evol...
This paper presents Genetic-based learning Algorithms (GA) for automatically inducing control rules ...
Congress on Evolutionary Computation, 2001. Seul, 27-30 May 2001In standard GP there are no constrai...
The purpose of this article is to present a multi-strategy approach to learn heuristics for planning...
AbstractThe purpose of this article is to present a multi-strategy approach to learn heuristics for ...
Proceedings of: 15th International Conference on Machine Learning, Madison (Wisconsin, USA), July 24...
Declarative problem solving, such as planning, poses interesting challenges for Genetic Programming ...
Declarative problem solving, such as planning, poses interestig challenges for Genetic Programming ...
Proceeding of: 7th International Conference on Evolutionary Programming, EP98 San Diego, California,...
There are many different approaches to solving planning problems, one of which is the use of domain ...
General-purpose generative planners use domain-independent search heuristics to generate solutions f...
There are several ways of applying Genetic Programming (GP) to STRIPS-like planning in the literat...
This paper presents a study on the transfer of learned control knowledge between two different plann...
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently g...
Seventeenth International Conference on Machine Learning. Stanford, CA, USA, 29 June-2 July, 2000Kno...
Genetic algorithms (GA'S) are global, parallel, stochastic search methods, founded on Darwinian evol...
This paper presents Genetic-based learning Algorithms (GA) for automatically inducing control rules ...
Congress on Evolutionary Computation, 2001. Seul, 27-30 May 2001In standard GP there are no constrai...
The purpose of this article is to present a multi-strategy approach to learn heuristics for planning...
AbstractThe purpose of this article is to present a multi-strategy approach to learn heuristics for ...
Proceedings of: 15th International Conference on Machine Learning, Madison (Wisconsin, USA), July 24...
Declarative problem solving, such as planning, poses interesting challenges for Genetic Programming ...
Declarative problem solving, such as planning, poses interestig challenges for Genetic Programming ...
Proceeding of: 7th International Conference on Evolutionary Programming, EP98 San Diego, California,...
There are many different approaches to solving planning problems, one of which is the use of domain ...
General-purpose generative planners use domain-independent search heuristics to generate solutions f...
There are several ways of applying Genetic Programming (GP) to STRIPS-like planning in the literat...
This paper presents a study on the transfer of learned control knowledge between two different plann...
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently g...
Seventeenth International Conference on Machine Learning. Stanford, CA, USA, 29 June-2 July, 2000Kno...
Genetic algorithms (GA'S) are global, parallel, stochastic search methods, founded on Darwinian evol...
This paper presents Genetic-based learning Algorithms (GA) for automatically inducing control rules ...
Congress on Evolutionary Computation, 2001. Seul, 27-30 May 2001In standard GP there are no constrai...