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 Intelligenceevolved 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
... path is found . Since there are always practical limits on the amount of time and storage available to expend on the ... path . Some heuristics greatly reduce search effort but do not guarantee finding minimal cost paths . In most ...
... path between two arbitrary nodes n , and n ,. ( The function k is undefined for nodes having no path between them . ) The cost of a minimal cost path from node n to some particular goal node , t1 , is then given by k ( n , t1 ) . We let ...
... path is equal to f * ( s ) , the minimal cost , and therefore ƒ ( 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 from s to a goal node ...
PRODUCTION Systems and AI
SEARCH Strategies FOR
10 other sections not shown