Uniform Cost Search-Artificial Intelligence-Unit-1-Problem solving-Uninformed Search

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

Пікірлер: 25

  • @senthilkumarsadhasivam6984
    @senthilkumarsadhasivam69843 жыл бұрын

    Super content, well explained, good presentation, keep it up

  • @WinningCSE

    @WinningCSE

    3 жыл бұрын

    Thank you so much 🙂

  • @priyankasahu1894
    @priyankasahu1894 Жыл бұрын

    Mam how u get the path s-c-g plz explain

  • @diogoamaro4187
    @diogoamaro41872 жыл бұрын

    very good video, you saved me! 🥰

  • @WinningCSE

    @WinningCSE

    2 жыл бұрын

    That is fantastic. Keep watching, do well your exams.

  • @a.meeraj5038
    @a.meeraj5038 Жыл бұрын

    Good explanation very useful

  • @WinningCSE

    @WinningCSE

    Жыл бұрын

    Thank you meeraj, keep doing

  • @eshitakreddy5688
    @eshitakreddy56882 жыл бұрын

    Very easy explanation, thank you ma'am

  • @WinningCSE

    @WinningCSE

    2 жыл бұрын

    Thanks for your complement.

  • @hab81bewket79

    @hab81bewket79

    Жыл бұрын

    no matter

  • @magneto12
    @magneto12 Жыл бұрын

    Mam, at last how uh decided s-c-g is the path from G13

  • @nomank8274

    @nomank8274

    Жыл бұрын

    Because we got G13 as goal state and it was derived by adding the values of S(0) + C(8) and G(5)

  • @kavindasandalanka1056
    @kavindasandalanka1056 Жыл бұрын

    You saved me. thanks a lot❤😍

  • @WinningCSE

    @WinningCSE

    Жыл бұрын

    Happy to help!

  • @KiruthigaKumaran-zh9kq
    @KiruthigaKumaran-zh9kq8 ай бұрын

    Super mam

  • @WinningCSE

    @WinningCSE

    7 ай бұрын

    Thank you

  • @hab81bewket79
    @hab81bewket79 Жыл бұрын

    too good

  • @WinningCSE

    @WinningCSE

    Жыл бұрын

    Thank you.

  • @mkalyan2698
    @mkalyan26982 жыл бұрын

    good explanation madam thank yo so much madam.. number of expended nodes 7 or 8 madam

  • @WinningCSE

    @WinningCSE

    2 жыл бұрын

    Thanks for your complement.

  • @rozhgarmuhammad8731
    @rozhgarmuhammad87317 ай бұрын

    Time and space complexity when visited node to be visited again?

  • @WinningCSE

    @WinningCSE

    7 ай бұрын

    No

  • @noname-ch5cj
    @noname-ch5cj Жыл бұрын

    Nnice💜❤️

  • @WinningCSE

    @WinningCSE

    Жыл бұрын

    U r welcome

  • @nishanthm2058
    @nishanthm2058 Жыл бұрын

    CS3491 2023 new syllabus Artificial intelligence machine learning lab manual send me please help me