Generalized best first search using single and multiple heuristics

DOI10.1016/0020-0255(92)90009-WzbMath0764.68025MaRDI QIDQ1186365

S. C. de Sarkar, Partha Pratim Chakrabarti, Sujoy Ghose

Publication date: 28 June 1992

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

heuristicsAND/OR graphsbest first search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search

Cites Work

• Unnamed Item
• Heuristic search through islands
• A heuristic search algorithm with modifiable estimate
• General branch and bound, and its relation to \(A^*\) and \(AO^*\)
• Admissibility of \(AO^ *\) when heuristics overestimate
• Increasing search efficiency using multiple heuristics
• Three approaches to heuristic search in networks
• AND/OR graph heuristic search methods
• Studies in Semi-Admissible Heuristics
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• Optimizing decision trees through heuristically guided search

This page was built for publication: Generalized best first search using single and multiple heuristics