A heuristic search algorithm with modifiable estimate

DOI10.1016/0004-3702(84)90003-1zbMath0537.68063OpenAlexW2010549090MaRDI QIDQ792766

László Mérõ

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0004-3702(84)90003-1

zbMATH Keywords

heuristic search algorithmminimal cost pathmodifiable estimate

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence (68T99)

Related Items

Utility of pathmax in partial order heuristic search, An upper bound on the time complexity of iterative-deepening-\(A^*\), A new variant of the \(A^*\)-algorithm which closes a node at most once., Unnamed Item, Inconsistent heuristics in theory and practice, The compressed differential heuristic, Generalized best first search using single and multiple heuristics, Iterative-deepening search with on-line tree size prediction, LAO*: A heuristic search algorithm that finds solutions with loops, Heuristic search through islands, Heuristic search strategies for multiobjective state space search, Learning for efficient search, Depth-first iterative-deepening: An optimal admissible tree search

Cites Work

• On the complexity of admissible search algorithms
• The heuristic search under conditions of error
• Heuristic search viewed as path finding in a graph
• A Note on Dijkstra's Shortest Path Algorithm
• Unnamed Item
• Unnamed Item