Admissibility of \(AO^ *\) when heuristics overestimate
type: Item
instance of: scholarly article
title: Admissibility of \(AO^ *\) when heuristics overestimate
zbMATH Open document ID: 0643.68153
DOI: 10.1016/0004-3702(87)90005-1
published in: Artificial Intelligence
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 4049146
zbMATH Keywords: AND/OR graphs
zbMATH Keywords: problem solving
zbMATH Keywords: heuristic search algorithms
zbMATH Keywords: \(AO^ *\)
author: P. P. Chakrabarti
author: Sujoy Ghose
author: S. De Sarkar
MaRDI profile type: Publication
full work available at URL: 0004-3702(87)90005-1
OpenAlex ID: W2050019941
cites work: Q3856120
cites work: Admissible heuristic search in AND/OR graphs
cites work: AND/OR graph heuristic search methods
cites work: Optimizing decision trees through heuristically guided search
cites work: Generalized best-first search strategies and the optimality of A*
cites work: The heuristic search under conditions of error
cites work: Heuristic search through islands
description: scientific article; zbMATH DE number 4049146