On A* as a special case of ordered search

Authors:
Marcel J. Schoppers
Affiliations:
University of Illinois at Urbana-Champaign, Department of Computer Science, Urbana, IL
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Year:
1983

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

The A* admissibility and optimality proofs presented to date have been based on overly restrictive assumptions about the relationship between real and estimated costs. This paper shows that idealism, accuracy and selectivity, properties hitherto thought to be unique to A*, are in fact common to all ordered searches, and do not require the evaluation function / = g+ h traditionally assumed. Consequently, much of A* theory can be greatly simplified.