Rational deployment of multiple heuristics in optimal state-space search
From MaRDI portal
Publication:1748476
DOI10.1016/j.artint.2017.11.001zbMath1443.68166OpenAlexW2767772787WikidataQ57518676 ScholiaQ57518676MaRDI QIDQ1748476
Oded Betzalel, David Tolpin, Erez Karpas, Solomon Eyal Shimony, Ariel Felner
Publication date: 11 May 2018
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2017.11.001
Uses Software
Cites Work
- Unnamed Item
- Predicting the size of IDA\(^*\)'s search tree
- Inconsistent heuristics in theory and practice
- Applying the corridor method to a blocks relocation problem
- Linear-space best-first search
- Optimal ordering of independent tests with precedence constraints
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
- Depth-first iterative-deepening: An optimal admissible tree search
- Principles of metareasoning
- Predicting optimal solution cost with conditional probabilities
- Heuristic Search When Time Matters
- Online Speedup Learning for Optimal Planning
- An Investigation of IDA* Algorithms for the Container Relocation Problem
- Generalized best-first search strategies and the optimality of A*
- Optimal Ordering of Tests with Extreme Dependencies
- Enhanced Partial Expansion A*