Reconsideration of a theorem on admissible ordered search algorithms

Authors:
M. M. Newborn
Affiliations:
-
Venue:
ACM '76 Proceedings of the 1976 annual conference
Year:
1976

Citing 2
Cited 0

Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"

ACM SIGART Bulletin
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

An improved proof is presented for a theorem on search algorithms which find minimal cost paths in a graph. The theorem essentially states that when searching for a minimal cost path in a graph, a more informed search algorithm expands fewer nodes than a less-informed algorithm. The proof does not require that the consistency assumption hold—an assumption that is necessary in the proof presented previously.