A geometric analysis of heuristic search

Authors:
Gordon J. Vanderbrug
Affiliations:
University of Maryland, College Park, Maryland
Venue:
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Year:
1976

Citing 4
Cited 1

Some Binary Derivation Systems

Journal of the ACM (JACM)
State-space problem-reduction, and theorem proving—some relationships

Communications of the ACM
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

Geometric considerations of search behavior

KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Search spaces for various types of problem representations can be represented in one quadrant of the coordinate planes. This geometric representation is used to prove some formal properties of heuristic search strategies involving completeness, admissibility, optimality, consistency, and the use of the perfect heuristic. The geometric analysis provides an intuitive alternative to the algebraic analysis which appears in the literature.