Uniform Cost Search-Artificial Intelligence-Unit-1-Problem solving-Uninformed Search
ฝัง
- เผยแพร่เมื่อ 10 พ.ค. 2021
- Unit - 1 - Problem Solving
Uninformed Searching Strategies-Uniform Cost Search
Use a priority queue instead of a simple queue
Insert nodes in the increasing order of the cost of the path so far
Guaranteed to find an optimal solution!
This algorithm is called uniform-cost search
Enqueue nodes by path cost.
That is, let g(n) = cost of the path from the start node to the current node n.
Sort nodes by increasing value of g.
Expanded node Nodes list
{ S0 }
S0 { B1, A3, C8 }
B1 { A3, C8, G21 }
A3 { D6, C8, E10, G18, G21 }
D6 { C8, E10, G18, G21 }
C8 { E10, G13, G18, G21 }
E10 { G13, G18, G21 }
G13 { G18, G21 }
Solution path found is S C G, cost 13
Number of nodes expanded (including goal node) = 7
Subscribe this channel, comment and share with your friends.
For Syllabus, Text Books, Materials and Previous University Question Papers and important questions
Follow me on
Blog : dsumathi.blogspot.com/
Facebook Page : profile.php?...
Instagram : / dsumathiphd
Super content, well explained, good presentation, keep it up
Thank you so much 🙂
Mam how u get the path s-c-g plz explain
Very easy explanation, thank you ma'am
Thanks for your complement.
no matter
Good explanation very useful
Thank you meeraj, keep doing
very good video, you saved me! 🥰
That is fantastic. Keep watching, do well your exams.
Mam, at last how uh decided s-c-g is the path from G13
Because we got G13 as goal state and it was derived by adding the values of S(0) + C(8) and G(5)
Time and space complexity when visited node to be visited again?
No
too good
Thank you.
good explanation madam thank yo so much madam.. number of expended nodes 7 or 8 madam
Thanks for your complement.
Nnice💜❤️
U r welcome
You saved me. thanks a lot❤😍
Happy to help!
Super mam
Thank you
CS3491 2023 new syllabus Artificial intelligence machine learning lab manual send me please help me