206 search results - page 10 / 42 » Learning Heuristic Functions from Relaxed Plans |
ICML
1990
IEEE
15 years 1 months ago
1990
IEEE
Given an adequate simulation model of the task environment and payoff function that measures the quality of partially successful plans, competition-based heuristics such as geneti...
UAI
2008
14 years 11 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
AIPS
2008
15 years 3 days ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
109
click to vote
ICCBR
2009
Springer
15 years 4 months ago
2009
Springer
This work presents a new approach that allows the use of cases in a case base as heuristics to speed up Reinforcement Learning algorithms, combining Case Based Reasoning (CBR) and ...
AIPS
2004
14 years 11 months ago
2004
LPG is a planner that performed very well in the last International planning competition (2002). The system is based on a stochastic local search procedure, and it incorporates se...