Admissibility of AO^ * when heuristics overestimate

DOI10.1016/0004-3702(87)90005-1MaRDI QIDQ1102135zbMATH OpenOpenAlexFDO

Authors P. P. Chakrabarti, Sujoy Ghose, S. De Sarkar

Publication date 1988

Published in Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

heuristic search algorithmsproblem solvingAND/OR graphs\(AO^ *\)

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• AND/OR graph heuristic search methods
• Admissibility of \(AO^ *\) when heuristics overestimate
• Admissible heuristic search in AND/OR graphs
• Generalized best-first search strategies and the optimality of A*
• Heuristic search through islands
• Optimizing decision trees through heuristically guided search
• The heuristic search under conditions of error

Cited in

(10)

• Admissibility of \(AO^ *\) when heuristics overestimate
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi
• An efficient algorithm for searching implicit AND/OR graphs with cycles
• ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS
• LAO*: A heuristic search algorithm that finds solutions with loops
• Anytime search in dynamic graphs
• Generalized best first search using single and multiple heuristics
• Heuristic search in restricted memory
• Weighted heuristic anytime search: new schemes for optimization over graphical models
• Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search

This page was built for publication: Admissibility of \(AO^ *\) when heuristics overestimate

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102135)