Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Download
Standard view
Full view
of .
Add note
Save to My Library
Sync to mobile
Look up keyword
Like this
0Activity
×
0 of .
Results for:
No results containing your search query
P. 1
AI_Lecture_5

AI_Lecture_5

Ratings: (0)|Views: 70|Likes:
Published by Arsalan Ahmed
AI_Lecture_5
AI_Lecture_5

More info:

Published by: Arsalan Ahmed on Jan 02, 2013
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, PPT, TXT or read online from Scribd
See More
See less

01/02/2013

pdf

text

original

 
Lecture 5
Informed Search 
Dr. Muhammad Adnan Hashmi
 
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)

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->