Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
From MaRDI portal
(Redirected from Publication:901034)
Recommendations
- Predicting optimal solution cost with conditional probabilities
- Efficient symbolic search for cost-optimal planning
- Learning heuristic functions for large state spaces
- Generalized best-first search strategies and the optimality of A*
- Rational deployment of multiple heuristics in optimal state-space search
Cites work
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 1882049 (Why is no real title available?)
- A Modern Treatment of the 15 Puzzle
- A general theory of additive state space abstractions
- A real-time algorithm for the \((n^{2}-1)\)-puzzle
- 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
- Estimating the Efficiency of Backtrack Programs
- Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
- Learning control knowledge for forward search planning
- Learning heuristic functions for large state spaces
- Planning as heuristic search
- Predicting optimal solution cost with conditional probabilities
- Predicting the performance of IDA\(^*\) using conditional distributions
- Predicting the size of IDA\(^*\)'s search tree
- The FF planning system: Fast plan generation through heuristic search
- The heuristic search under conditions of error
- Time complexity of iterative-deepening-\(A^{*}\)
Cited in
(2)
This page was built for publication: Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901034)
