Cost-error relationships in A* tree-searching

Authors:
Henry W. Davis
Affiliations:
Wright State Univ., Dayton, OH
Venue:
Journal of the ACM (JACM)
Year:
1990

Citing 2
Cited 2

Algorithmics: theory & practice

Algorithmics: theory & practice
Crusade for a better notation

ACM SIGACT News

An average-case analysis of graph search

Eighteenth national conference on Artificial intelligence
Average-case analysis of best-first search in two representative directed acyclic graphs

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pearl has shown that, in admissible A* tree-searching, the expected number of nodes expanded is bounded above and below by exponential functions of heuristic error. An additional assumption required for the validity of Pearl's argument is given. The assumption's significance and interpretation are discussed.