A heuristic search algorithm with modifiable estimate
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3845070
- A unifying approach to heuristic search
- A multiobjective incremental heuristic search algorithm
- scientific article; zbMATH DE number 168209
- Statistical heuristic search
- scientific article; zbMATH DE number 4162299
- Heuristic search. Theory and applications
Cites work
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 3351223 (Why is no real title available?)
- A Note on Dijkstra's Shortest Path Algorithm
- Heuristic search viewed as path finding in a graph
- On the complexity of admissible search algorithms
- The heuristic search under conditions of error
Cited in
(26)- Learning for efficient search
- Inconsistent heuristics in theory and practice
- Depth-first iterative-deepening: An optimal admissible tree search
- Heuristic search through islands
- Generalized best-first search strategies and the optimality of A*
- A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm
- Heuristically ordered search in state graphs
- A more effective version of algorithm A
- Heuristic search in restricted memory
- Iterative-deepening search with on-line tree size prediction
- Generalized best first search using single and multiple heuristics
- scientific article; zbMATH DE number 4131689 (Why is no real title available?)
- LAO*: A heuristic search algorithm that finds solutions with loops
- Improving search efficiency using possible subgoals
- Heuristic search strategies for multiobjective state space search
- scientific article; zbMATH DE number 4162298 (Why is no real title available?)
- Comparision of 3 implementations of the \(A^*\) algorithm
- Contract Search: heuristic search under node expansion constraints
- Utility of pathmax in partial order heuristic search
- Completeness and admissibility for general heuristic search algorithms -- a theoretical study: Basic concepts and proofs
- A new variant of the \(A^*\)-algorithm which closes a node at most once.
- Three approaches to heuristic search in networks
- Enhanced partial expansion A\(^*\)
- \(\text{BIDA}^*\): An improved perimeter search algorithm
- The compressed differential heuristic
- An upper bound on the time complexity of iterative-deepening-\(A^*\)
This page was built for publication: A heuristic search algorithm with modifiable estimate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792766)
