Sciweavers

206 search results - page 23 / 42
» Learning Heuristic Functions from Relaxed Plans
Sort
View
JAIR
2011
173views more  JAIR 2011»
14 years 21 days ago
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
J. Hoffmann
AIPS
2011
14 years 1 months ago
Where Ignoring Delete Lists Works, Part II: Causal Graphs
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work (Hoffmann 2005), it was observed that the optimal relax...
Joerg Hoffmann
ICML
1998
IEEE
15 years 10 months ago
Genetic Programming and Deductive-Inductive Learning: A Multi-Strategy Approach
Genetic Programming (GP) is a machine learning technique that was not conceived to use domain knowledge for generating new candidate solutions. It has been shown that GP can bene ...
Ricardo Aler, Daniel Borrajo, Pedro Isasi
NIPS
1993
14 years 11 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson
ESANN
2008
14 years 11 months ago
Learning to play Tetris applying reinforcement learning methods
In this paper the application of reinforcement learning to Tetris is investigated, particulary the idea of temporal difference learning is applied to estimate the state value funct...
Alexander Groß, Jan Friedland, Friedhelm Sch...