Learning heuristic functions for large state spaces

DOI10.1016/J.ARTINT.2011.08.001MaRDI QIDQ420796zbMATH OpenOpenAlexFDO

Authors Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte

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

zbMATH Keywords

planningheuristic searchlearning heuristics

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Learning heuristics in search problems
• scientific article; zbMATH DE number 67799
• Real-time heuristic search
• scientific article; zbMATH DE number 1759719
• Publication:3493305

Cites work

• scientific article; zbMATH DE number 1215993 (Why is no real title available?)
• scientific article; zbMATH DE number 795588 (Why is no real title available?)
• A Modern Treatment of the 15 Puzzle
• A general theory of additive state space abstractions
• Blocks World revisited
• Depth-first iterative-deepening: An optimal admissible tree search
• Disjoint pattern database heuristics
• Duality in permutation state spaces and the dual search algorithm
• Hyperbolic Dovetailing
• Learning control knowledge for forward search planning
• Learning for efficient search
• Learning heuristic functions for large state spaces
• Learning representations by back-propagating errors
• Network-based heuristics for constraint-satisfaction problems
• Planning as heuristic search
• Relative-order abstractions for the pancake problem
• Robust approximate bilinear programming for value function approximation
• Searching in the plane
• The FF planning system: Fast plan generation through heuristic search
• The expected length of a shortest path
• The fast downward planning system

Cited in

(16)

• Learning for efficient search
• Goal distance estimation for automated planning using neural networks and support vector machines
• Optimized look-ahead tree policies: a bridge between look-ahead tree policies and direct policy search
• Effective footstep planning using homotopy-class guidance
• Probably bounded suboptimal heuristic search
• scientific article; zbMATH DE number 4164164 (Why is no real title available?)
• scientific article; zbMATH DE number 4166921 (Why is no real title available?)
• scientific article; zbMATH DE number 67799 (Why is no real title available?)
• Accelerating autonomous learning by using heuristic selection of actions
• Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
• Learning heuristic functions for large state spaces
• Sokoban: Improving the search with relevance cuts
• Learning to agree over large state spaces
• Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
• Predicting optimal solution cost with conditional probabilities
• Generative models for grid-based and image-based pathfinding

This page was built for publication: Learning heuristic functions for large state spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420796)