Principles of Artificial Intelligence
A classic introduction to artificial intelligence intended to bridge the gap between theory and practice, "Principles of Artificial Intelligence" describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval. Rather than focusing on the subject matter of the applications, the book is organized around general computational concepts involving the kinds of data structures used, the types of operations performed on the data structures, and the properties of the control strategies used.
"Principles of Artificial Intelligence"evolved from the author's courses and seminars at Stanford University and University of Massachusetts, Amherst, and is suitable for text use in a senior or graduate AI course, or for individual study.
Results 1-3 of 61
HEURISTIC GRAPH - SEARCH PROCEDURES The uninformed search methods
, whether breadth - first or depth - first , are exhaustive methods for finding paths
to a goal node . In principle , these methods provide a solution to the path ...
That is , f ( n ) is an estimate of the cost of a minimal cost path constrained to go
through node n . That node on OPEN having the smallest value of f is then the
node estimated to impose the least severe constraint ; hence it is appropriate that
But the f * value of any node on an optimal path is equal to f * ( s ) , the minimal
cost , and therefore f ( n ' ) < f * ( s ) . Thus , we have : RESULT 2 : At any time
before A * terminates , there exists on OPEN a node n ' that is on an optimal path
What people are saying - Write a review
PRODUCTION SYSTEMS AND AI
SEARCH STRATEGIES FOR
10 other sections not shown