Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces

DOI10.1016/j.artint.2015.09.012zbMath1344.68216OpenAlexW2197146024MaRDI QIDQ901034

Robert C. Holte, Roni Stern, Ariel Felner, Shahab Jabbari Arfaee, Sandra Zilles, Levi H. S. Lelis

Publication date: 23 December 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://www.locus.ufv.br/handle/123456789/21957

zbMATH Keywords

stratified samplingheuristic searchtype systemslearning heuristic functionssolution cost prediction

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)

Related Items

Rational deployment of multiple heuristics in optimal state-space search, Predicting optimal solution cost with conditional probabilities

Cites Work

• Predicting the size of IDA\(^*\)'s search tree
• Learning heuristic functions for large state spaces
• Depth-first iterative-deepening: An optimal admissible tree search
• A real-time algorithm for the \((n^{2}-1)\)-puzzle
• The heuristic search under conditions of error
• Predicting optimal solution cost with conditional probabilities
• Duality in permutation state spaces and the dual search algorithm
• A Modern Treatment of the 15 Puzzle
• Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
• Estimating the Efficiency of Backtrack Programs
• Predicting the Performance of IDA* using Conditional Distributions
• Blocks World revisited
• Planning as heuristic search
• Time complexity of iterative-deepening-\(A^{*}\)
• Disjoint pattern database heuristics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item