A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P.E.
Nilsson, N.J.
Raphael, B.
Artificial Intelligence Group of the Applied Physics Laboratory, Stanford Research Institute, Menlo Park, Calif.;
This paper appears in: Systems Science and Cybernetics, IEEE Transactions on
Publication Date: July 1968
Volume: 4,
Issue: 2
On page(s): 100-107
ISSN: 0536-1567
Digital Object Identifier: 10.1109/TSSC.1968.300136
Current Version Published: 2007-02-12
Abstract
Although the problem of determining the minimum cost path through a graph arises naturally in a number of interesting applications, there has been no underlying theory to guide the development of efficient search procedures. Moreover, there is no adequate conceptual framework within which the various ad hoc search strategies proposed to date can be compared. This paper describes how heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching and demonstrates an optimality property of a class of search strategies.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
