Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Standard view
Full view
of .
×
0 of .
Results for:
P. 1
AI_Lecture_5

# AI_Lecture_5

Ratings: (0)|Views: 70|Likes:
AI_Lecture_5
AI_Lecture_5

### Availability:

See More
See less

01/02/2013

pdf

text

original

Lecture 5
Informed Search

1
1 January 2013

Idea: use an evaluation function for each node
Estimate of desirability
Expand most desirable unexpanded node
Implementation:
fringe is a queue sorted in decreasing order of desirability
Special cases:
Uniform Cost Search (uninformed)
Greedy (best-first) Search (informed)
A* Search (informed)
1 January 2013
2

Evaluation functionf(n) = g(n) + h(n)
g(n) = exact cost so far to reach n
h(n) = estimated cost to goal from n
f(n) = estimated total cost of cheapestpath through n to goal
Special cases:
Uniform Cost Search: f(n) = g(n)
Greedy (best-first) Search: f(n) = h(n)
A* Search: f(n) = g(n) + h(n)

## Activity (0)

### Showing

AllMost RecentReviewsAll NotesLikes