Learning heuristic functions for large state spaces
From MaRDI portal
Publication:420796
DOI10.1016/j.artint.2011.08.001zbMath1238.68149OpenAlexW2158118484MaRDI QIDQ420796
Sandra Zilles, Robert C. Holte, Shahab Jabbari Arfaee
Publication date: 23 May 2012
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2011.08.001
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces ⋮ Learning heuristic functions for large state spaces ⋮ Effective footstep planning using homotopy-class guidance ⋮ Predicting optimal solution cost with conditional probabilities ⋮ Optimized look-ahead tree policies: a bridge between look-ahead tree policies and direct policy search ⋮ Probably bounded suboptimal heuristic search ⋮ Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning heuristic functions for large state spaces
- Searching in the plane
- Depth-first iterative-deepening: An optimal admissible tree search
- Network-based heuristics for constraint-satisfaction problems
- The expected length of a shortest path
- Duality in permutation state spaces and the dual search algorithm
- A Modern Treatment of the 15 Puzzle
- Hyperbolic Dovetailing
- Learning representations by back-propagating errors
- Blocks World revisited
- Planning as heuristic search
- Learning for efficient search
- Disjoint pattern database heuristics