Uniform Cost Search

Поделиться
HTML-код
  • Опубликовано: 25 янв 2025

Комментарии • 359

  • @moty5393
    @moty5393 4 года назад +112

    FINALLY, A great explanation. Thank you so much. With this, the AI course is going to become easier 🙏🏻

  • @danielgospodinow
    @danielgospodinow 5 лет назад +37

    A very clear and simple explanation! You also covered a lot of edge cases with this rather complex graph, so I really liked that!

  • @tobiasfunke4092
    @tobiasfunke4092 5 лет назад +26

    Thanks John! Great explanation - our lectures didn't cover this well and I needed it for my AI exam.

  • @alinoorfaiyaz1015
    @alinoorfaiyaz1015 6 лет назад +32

    tomorrow is my final exam and after watching all your videos on search algorithm, my concept is full clear. Thank you Love from BANGLADESH

    • @agthm_3
      @agthm_3 3 года назад +1

      same

    • @sadmanishrak9529
      @sadmanishrak9529 6 месяцев назад +1

      My exam is 2 days later. I am from Bangladesh as well. 😂

  • @VPadu0
    @VPadu0 4 года назад +103

    Me when studying this course 5:45
    Amazin explanation though. Great work :D

  • @WissalBe
    @WissalBe 7 лет назад +132

    Great explanation, thank you so much !

  • @maxbardelang6097
    @maxbardelang6097 5 лет назад +13

    watching this on the first day of 2020, thank you for the great explanation!

  • @tildarusso
    @tildarusso 2 года назад

    I feel grateful after finding this treasure by chance! I am going to go through all the videos to tamp my algorithm knowledge.

  • @bundybeamiana949
    @bundybeamiana949 4 года назад +4

    If it wasn't for you, I would've long kissed my Computer Science degree goodbye, so thank you, sir, for your simple but yet amazing explanations

  • @ruhanahmed6852
    @ruhanahmed6852 2 года назад

    There are so many videos and confusing. this is the best I could find . Thanks for clear and simple explanation sir.

  • @vaibhavpandey7618
    @vaibhavpandey7618 7 лет назад +1

    Woww... best explanation I have ever got on RUclips for search algorithm......

  • @SanjayKumar-el5ms
    @SanjayKumar-el5ms 5 лет назад +6

    You are an incredible teacher,Sir...elegantly taught...Hatsoff...seriously

  • @EchoVer
    @EchoVer 4 года назад +5

    First three visited nodes: SAD 😄
    Joke aside, this channel deserves more subscribers and views. Best explanation ever I have seen since I started to learn about search problem. Thank you, Mr. Lavine. Please carry on doing more of those. Best wishes.

  • @HuyenPham-r3m
    @HuyenPham-r3m 5 месяцев назад

    Thank you! Your explanation is clear, this makes the AI course is going to become easier for me.

  • @engineered.mechanized
    @engineered.mechanized 6 лет назад +2

    This is an excellent explanation of the Algorithm. You did a great job here making it simple and clear.

  • @yongsintey7293
    @yongsintey7293 2 года назад

    owhhh exactly goooood explanation!! I finally understand how the case of cut over C, B with path cost 9 works. Thank you so much!

  • @samuelnyamai7655
    @samuelnyamai7655 5 лет назад +2

    Sincere thanks. You are a good teacher. Hope i pass my exams today

  • @Umo44
    @Umo44 3 года назад +2

    Wow, you're so much helpful than my instructor!

  • @AryanSingh-sn3dx
    @AryanSingh-sn3dx 2 года назад

    This has to be one of the best videos related to the topic

  • @dheemanthm.d3836
    @dheemanthm.d3836 5 лет назад +2

    You made it really clear ...I loved the way you convey your thoughts on the idea. Thanks a lot

  • @sanyasingh9625
    @sanyasingh9625 5 лет назад +6

    I love the way you are writing "G"
    Thanks for the explanation.

    • @matrixmirage2148
      @matrixmirage2148 4 года назад

      CJ: *_,,Gee, thanks G."_*
      (Mission: Drive-by,
      Grand Theft Auto: San Andreas, 2005)

    • @Zenxiao-
      @Zenxiao- 4 года назад

      @@matrixmirage2148 *2004

  • @user-wy7wl5on7l
    @user-wy7wl5on7l 2 года назад +2

    I’ve a world famous professor of AI who is considered to be a major innovator in the field. Yet still, your explanation is so superior it is absurd

  • @shreya6107
    @shreya6107 11 месяцев назад

    Explained so clearly and concisely. Thank you so much sir !

  • @changchen3212
    @changchen3212 3 года назад

    Best explanation ever! I finally understand the visited nodes, active nodes, and dead end!

  • @MountZzzzk
    @MountZzzzk 2 года назад +1

    It's the best explanation I've got thankyou sir!! 😊

  • @mahny
    @mahny Месяц назад +1

    thank you for your great explanation.

  • @Dennis-er8xc
    @Dennis-er8xc 6 лет назад +2

    best explanation anyone could ever give!
    Thanks very much.

  • @LordSarcasticVlogger
    @LordSarcasticVlogger 9 месяцев назад

    WHAT A GOOD EXPLANATION SIR...THANK YOU VERY MUCH SIR..WATCHING FROM INDIA

  • @muinstein
    @muinstein 4 года назад

    Clear and straight. No extra articulation. Thanks.

  • @SaifUlIslam-di5xv
    @SaifUlIslam-di5xv 3 года назад +1

    3 hours till my exam, and I believe I'm gonna do well now. Thanks!

  • @KushalYadav-hi7lm
    @KushalYadav-hi7lm Год назад

    it was one of the best lecture that i have seen today thanks professor🙌🙌🙌

  • @mfarsalanHD
    @mfarsalanHD 4 года назад +3

    Thank you for the video sir! It helped a lot for my AI assignment

  • @MrRafay474
    @MrRafay474 3 месяца назад

    clear, crisp and precise . Perfect explanation

  • @nouraalmusaynid751
    @nouraalmusaynid751 3 года назад

    Good and enough explanation 👏🏻👏🏻👏🏻well done

  • @mahshidahmadi6900
    @mahshidahmadi6900 3 года назад

    Great explanation. You explained it explicitly. Thanks a lot Sir🙏⚘

  • @silverblooming
    @silverblooming 3 года назад

    Best explanation of Uniform Cost Search ever!!

  • @anirvangoswami
    @anirvangoswami Год назад

    That is a genuinely wonderful explanation, Thanks, professor.

  • @divyapatkar2431
    @divyapatkar2431 3 года назад +1

    Sir your explanation is so well ,thank you sir
    I wish my subjects teachers can explain concepts in this way,so I become topper in university 😄

  • @yoyo_tacotruck
    @yoyo_tacotruck 4 года назад +2

    You are literally saving my uni life!

  • @runxi-n6g
    @runxi-n6g 4 месяца назад

    Thank you for the excellent demonstration!

  • @dorherbesman1751
    @dorherbesman1751 4 года назад

    excellent work , you'r calm explanation really helped me
    thanks!

  • @borsho9889
    @borsho9889 4 года назад

    Is the best explanation on internet. By far!

  • @michelleclaudia8655
    @michelleclaudia8655 4 года назад

    your explanation is very clear, it's so helpful :) thankyou sir!

  • @ofrund
    @ofrund 2 года назад +1

    Excellent explanation sir, thank you very much.

  • @DauphinetB
    @DauphinetB 4 года назад

    At 4:21, shouldn't we immediatly exclude B(9) from the frontier of nodes? It makes no sense to have both B(8) and B(9) on the priority queue.

  • @KCODivyanshuKatyan
    @KCODivyanshuKatyan Год назад

    You deserve a sub man keep up the good work ❤❤

  • @webkalfictservices5138
    @webkalfictservices5138 8 месяцев назад

    Super clear! Thank you very much mister Levine!

  • @hwstar9416
    @hwstar9416 Год назад

    at 7:09 would it be fine if we don't add C as a child to B, since we already found a cheaper C in the graph.

  • @henrytien9710
    @henrytien9710 4 года назад

    Great explanation, you are a good teacher.

  • @FlickShotGamingYT
    @FlickShotGamingYT 3 месяца назад

    Awesome Lecture Prof!

  • @shreyapuli1267
    @shreyapuli1267 4 года назад

    If multiple nodes have the same lowest cost, which one would you expand first?

  • @IamRileyofficial
    @IamRileyofficial Год назад

    Excellent video great explanation. Thank you for this

  • @burrito_san
    @burrito_san 5 лет назад +1

    For anyone that is interested, uniform cost search is the same as branch and bound search.

  • @lyc3343
    @lyc3343 3 года назад

    Incredibly easy to understand. Thank you so much!

  • @pratheekhebbar2677
    @pratheekhebbar2677 3 года назад

    explained really well and simple.thank uh sir

  • @ifeyinwaanene3598
    @ifeyinwaanene3598 3 года назад

    Very good video Prof. Please can you do a video on Greedy search

  • @yutakoike7519
    @yutakoike7519 11 месяцев назад +1

    thank you for helping me!

  • @diellkryeziu6494
    @diellkryeziu6494 2 года назад

    Good job John !
    Keep pushin' P.

  • @shengxiangxu9021
    @shengxiangxu9021 5 лет назад

    A ha your explanation is so clear that i understand it , thank you so much

  • @pantepember
    @pantepember 4 года назад

    We also need another list to keep tracking of active nodes with their total costs. Right?
    And keeping visited nodes with their total costs.

  • @dinhh4248
    @dinhh4248 3 года назад

    Amazing! Thank you Dr. Levine

  • @monyettenyom2540
    @monyettenyom2540 5 месяцев назад

    I have a similar case which way to D costs 8 and to B costs 6. Do I have to choose D first, then B or otherwise?

  • @joseph10097
    @joseph10097 5 лет назад +1

    Thank you so so much! Saved me heaps of time. Liked & subscribed.

  • @larakurtaran7189
    @larakurtaran7189 4 года назад

    great explanation
    made it clear thanks

  • @elie3423
    @elie3423 5 лет назад +145

    not indian: check
    clear voice: check
    clear example: check
    not recorded from a toaster: check
    you are the best :)

    • @smk9320
      @smk9320 5 лет назад +2

      toaster?

    • @akshaybhatia3611
      @akshaybhatia3611 5 лет назад +20

      What's the problem with being Indian?

    • @rohankamath794
      @rohankamath794 5 лет назад +8

      @@akshaybhatia3611 Lmao check out UCS tutorials by Indians, being an Indian I cant understand their language nor their explanation.

    • @grecufilip
      @grecufilip 5 лет назад

      And wtf is hinglish???

    • @ilyaghotbi1525
      @ilyaghotbi1525 5 лет назад

      @@akshaybhatia3611 better to have some "how to speak English correctly" classes before teaching in English!!!

  • @PierLim
    @PierLim 6 лет назад

    Keep making your videos! You have a clarity of thought to your teaching.

  • @boluskharte906
    @boluskharte906 Год назад

    I have A.I test tomorrow and I'm loving the playlist

  • @atifansari9166
    @atifansari9166 2 года назад

    Clean explanation. Understood well

  • @mohamadhalak2178
    @mohamadhalak2178 7 лет назад

    you saved my life man thanks for the video i got a bad doc

  • @tharmalingamgowthaman92
    @tharmalingamgowthaman92 4 года назад

    Best explanation. Thank you so much

  • @durveshmahajan8097
    @durveshmahajan8097 2 года назад

    Thank you so much Sir, The Concept is extremely cleared 🥳❤✊✊

  • @WildDynastyPlays
    @WildDynastyPlays 3 года назад

    Came here just for the British accent :p .. nicely explained!

  • @peterp1098
    @peterp1098 5 лет назад

    Great presentation! Thank you from Greece

  • @BG0178
    @BG0178 4 года назад

    I understand the algorithm but i don't understand why we used visited array (if its array ofc). I mean yeah, we picked the least cost path to go on always and if we reach a node 2 or more ways, we only accept the cheapest one. I think visited must give us "there is another way with another cost" info and we decide that one of the ways is a dead end right? Is it why we keep visited array ? Great explanation though!

  • @georgieloutabar2399
    @georgieloutabar2399 6 лет назад

    You're my superman! Thank you so much sir.

  • @akshaysharma5700
    @akshaysharma5700 7 лет назад

    Sir ..u need more subscribers! u r awsm..i didnt find this level of explanation anywhere. keep it up Sir.

  • @supriyasuman4604
    @supriyasuman4604 5 лет назад +1

    Nice and Clear Explanation

  • @yashnisar9916
    @yashnisar9916 7 лет назад

    What if the node has already been visited and we get a path where the distance to that node is lesser ?

  • @pGoharNayabKhan
    @pGoharNayabKhan 5 лет назад

    Very simple and to the point explanation :)
    Thank you

  • @dannymweene5682
    @dannymweene5682 2 года назад

    What would happen in case where B and C were not uniform (bearing the same total cost)?

  • @laxmiyadav-cw2vv
    @laxmiyadav-cw2vv 2 года назад

    Great explanation!
    Tq sir🙏

  • @tharindudarshana8732
    @tharindudarshana8732 3 года назад

    Nice Explanation..Thank you Sir

  • @yuk3sh431
    @yuk3sh431 6 лет назад

    Oh man...that explanation was great!!

  • @FabioOliveira-uc8sm
    @FabioOliveira-uc8sm 5 лет назад

    Is it guaranteed that it will always expand all nodes from the graph?

  • @agathasettham3792
    @agathasettham3792 7 лет назад

    you're amazing. it''s so hard to find information about this

  • @hrishikeshparab1236
    @hrishikeshparab1236 6 лет назад +1

    Well explained! Add more content brother! You deserve a sub

  • @jolinejanz4381
    @jolinejanz4381 5 лет назад

    i really like your videos, really good explanations

    • @beccs9942
      @beccs9942 5 лет назад

      Could not agree more, literally saving my life

  • @jarno_r
    @jarno_r 3 года назад

    Great video

  • @dotnetrfidhub2135
    @dotnetrfidhub2135 3 года назад

    Best explanation ❤

  • @joaomiguel68
    @joaomiguel68 7 лет назад

    Yes great explanation, with good organization. Thank you Sir!

  • @aezazi
    @aezazi 2 года назад

    Brilliant explanation! Thank you.
    Question: the algorithm terminated because you had reached all possible goal states, and then you picked the path with lowest cost, correct? So you must reach all possible goal states .

    • @williammbollombassy1778
      @williammbollombassy1778 Год назад

      Nooo , This algorithm finish when you successfully reach a Goal vertex/node in respecting the constraint of exploring the minimal path in matter of cost .
      (My explanation is not clear, sorry
      But you travel the tree following the methodology of minimizing travelling costs at each steps and not reexploring the already visited vertexes/nodes , and by doing so if you encounter a Goal node/vertex, the algorithm successfully end.
      Otherwise it continues. )

    • @shimadabr
      @shimadabr Год назад

      @@williammbollombassy1778 But it found G1 pretty early and G2 before G3 and didn't end yet. So what's the stop condition?

  • @LoyBukid
    @LoyBukid 2 года назад

    Hello, I have a weighted and undirected graph using uniform-cost search. The initial steps given to me was to repeatedly traverse all nodes until the destination is found, can I really use uniform-cost search for this or it needs a different method?

  • @chitrunggoi4679
    @chitrunggoi4679 5 лет назад

    you have done a great work. Thank you !!!

  • @RossieVina
    @RossieVina 6 месяцев назад

    Good day, i want to clarify that, does this uniform cost search is a backtracking technique?

  • @randb9378
    @randb9378 5 лет назад

    does it expand all nodes and then uses chepast path?

  • @AbhishekSingh-og7kf
    @AbhishekSingh-og7kf 4 года назад

    Nice explanation!!!

  • @zaryabbaloch5266
    @zaryabbaloch5266 7 лет назад

    Excellent Explanation...Thanks, please try to explain time,space complexities, completeness,optimality too

    • @johnlevine2909
      @johnlevine2909  7 лет назад +2

      Thanks! I think another video, comparing the properties of the various search algorithms might be useful. Watch this space!

  • @trndsttr7585
    @trndsttr7585 11 месяцев назад

    Beautiful explanation.

  • @chetanchavannavar1410
    @chetanchavannavar1410 5 лет назад

    💯 great explanation... Tx

  • @hisyamzayd
    @hisyamzayd 6 лет назад

    Masuk pak John! penjelasannya manteb betul