L20: Uniform Cost Search in Artificial Intelligence with Solved Examples | Uninformed Search in AI

Full Course of Artificial Intelligence(AI) - • Artificial Intelligenc...
In this video you can learn about Uniform Cost Search(UCS) in Artificial Intelligence with Solved Examples. It is an example of Uninformed Search in Artificial Intelligence. The video explains Uniform Cost Search Algorithm with advantages and disadvantages. This topic is very important for College University Semester Exams and Other Competitive exams.
Artificial Intelligence Video Lectures in Hindi
👉 Follow us on Social media:
Facebook: tiny.cc/ibdrsz
▶️ Links for Hindi playlists of all subjects are:
Data Structure: tiny.cc/lkppsz
#DBMS : tiny.cc/zkppsz
#Java: tiny.cc/1lppsz
Control System: tiny.cc/3qppsz
Computer Network Security: tiny.cc/6qppsz
Web Engineering: tiny.cc/7qppsz
Operating System: tiny.cc/dqppsz
EDC: tiny.cc/cqppsz
TOC: tiny.cc/qqppsz
Software Engineering: tiny.cc/5rppsz
DCN: tiny.cc/8rppsz
Data Warehouse and Data Mining: tiny.cc/yrppsz
Compiler Design: tiny.cc/1sppsz
Information Theory and Coding: tiny.cc/2sppsz
Computer Organization and Architecture(COA): tiny.cc/4sppsz
Discrete Mathematics (Graph Theory): tiny.cc/5sppsz
Discrete Mathematics Lectures: tiny.cc/gsppsz
C Programming: tiny.cc/esppsz
C++ Programming: tiny.cc/9sppsz
Algorithm Design and Analysis(ADA): tiny.cc/fsppsz
E-Commerce and M-Commerce(ECMC): tiny.cc/jsppsz
Adhoc Sensor Network(ASN): tiny.cc/nsppsz
Cloud Computing: tiny.cc/osppsz
STLD (Digital Electronics): tiny.cc/ysppsz
Artificial Intelligence: tiny.cc/usppsz
Links for #GATE/#UGCNET/ PGT/ TGT CS Previous Year Solved Questions:
UGC NET : tiny.cc/brppsz
DBMS GATE PYQ : tiny.cc/drppsz
TOC GATE PYQ: tiny.cc/frppsz
ADA GATE PYQ: tiny.cc/grppsz
OS GATE PYQ: tiny.cc/irppsz
DS GATE PYQ: tiny.cc/jrppsz
Network GATE PYQ: tiny.cc/mrppsz
CD GATE PYQ: tiny.cc/orppsz
Digital Logic GATE PYQ: tiny.cc/rrppsz
C/C++ GATE PYQ: tiny.cc/srppsz
COA GATE PYQ: tiny.cc/xrppsz
DBMS for GATE UGC NET : tiny.cc/0tppsz

[@karishmakhan9245]

This is not the right explanation of the algorithm. Uniform cost search don't work this way and always results in optimal solution.

[@Partha05m]

you're right ...

[@Faiq__Mustafa]

go for another video this might be wrong.

[@soumyadeepbarik5711]

I have a doubt here if you BACKTRACK to "E" from 'G' , the GOAL NODE , taken earlier , then why should not you visit "C" instead of "H" bcz 9

[@zuberpatel886]

C was already in the closed queue -> already visited

[@AbhishekBade1310]

so this means that uniform cost search doesn't always provide the most optimal soln right?

[@subhanfarjam9110]

In case where H is our goal state then A->C->D->H could be our path. It's cost will also 25 rather than 33. Is it possible or not?

[@souravsingha5776]

he does not know this 😆😆😆

[@nadeeradulan9231]

I did my assignment using your explanation! Thanks

[@NeVerMinD_x.]

gg bro

[@misbahabidch6889]

Nice method sir

[@shraddhadhawan7685]

Good way of teaching Keep it up.

[@AllInOne-jg5qx]

Point where you say it will stuck in loop is not clear. If it is keeping the track of visited nodes, according to me it should not stuck in loop.

[@LordSarcasticVlogger]

I WAS THINKING SAME

[@shahzaibbutt2559]

Good work

[@virendranaik1893]

how is that the optimal path?

[@vepakommavamsi]

I passed discrete mathematics only because of your videos and this channel sir tq🙏🙏🙃🙂 gratitude

[@gopalbhagat9528]

Sar ji please make a video lectures on cryptography

[@true4189]

Thank u

[@avdhutpatil6319]

Explanation on board is correct Cummulative cost is considered But verbal explaination don't follow that

[@unsuspectedwarrent1718]

thank you. sir to making just simple video of difficult topic 🤩

[@robinck4088]

it's wrong, how can a backtracking algorithm give you an optimal solution. Please refer to "Russell S. Artificial Intelligence. A Modern Approach 4ed 2022 " Chapter 3.4.2 for the correct information about Uniform-cost search

[@amoghnigam7276]

listen to the video, its the correct explanation

[@Ayeshabscssmester]

Nice sir

[@Leorio_kun]

4:20 bless you

[@RidwanurRahmanextreme]

Sir, If you perform this graph in this way it's wrong, unless we draw a tree you can't directly come up with the answer. If you draw the tree, you will find the optimal solution there.

[@abdulwahabqureshi6264]

i think u r right, did you find another solution ?

[@mohammedkhasim9554]

Good

[@Mubashirhassan-akb]

Best

[@arnabchattaraj9035]

sir iska sab PDF milega ? im doing MTECH sir , please give me for class

[@tahahabibi9996]

Goal node 'H' : A->C->B->E->G->E->F->E->D->C->D->H (COST=51) ?? CORRECT ME IF I AM WRONG

[@adhityaraina]

A->C->B->E->G->E->F->E->D->H*

[@harshtomar409]

C is already visited

[@aleesalman295]

Wrong Explanation: If Goal Node is H then it will go to the infinite loop:

[@vinitasingh1112]

Second solution to H is wrong. It should get caught in loop at D as it will least cost.

[@zuberpatel886]

NO it will not coz there is a closed queue maintained to not trace to the same node

[@navinjoshi5793]

this is totaly wrong explained ,how could he teach like this so many are following this channel .

[@isi6402]

😂😂😂😂😅

[@TheOverfittedModel]

What is wrong here can you please tell

[@xXmayank.kumarXx]

anyone can explain using a simple example. try to solve a problem which has edge cases. that will lead to better understanding.

[@zainshahbaz6511]

2out of 10 miliengy in shortcuts se krne se

[@mohanmahanty9619]

Algorithm Explanation is wrong, because it didn't yields to the optimal solution and here we cant revisit the already visited Node and

[@AmitSingh-1916]

C ki edge bhi ni dekhega?

[@imransabbir9578]

For Goal Node 'H' : Why not A>C>D>H=26 directly?

[@rajv7815]

that happens in best first search, uniform cost search is uniformed hence it follows each and every node with less cost

[@dashikook758]

between b and d, b has the least value ryt

[@dashikook758]

@@rajv7815 dude, for best first search, we are focusing on h(n) ryt?

[@Mkshowk]

Minimum cost for each path would be selected

[@FaizanKhan-qu1sj]

Wrong explaination

[@adityachhawal4854]

wrong hain sir aap bol rahe the ki optimal solution milegaa but for G 33 is not the optimal solution not agree sir

[@prabal3783]

Kon kon iss video dekna ka somoy sir ko "Hello" bolta ha

[@Harshal-dk2kr]

you told wrong at 4:00 ...as aapne pahile bola agar goal state hogi but uska weight thoda zyada hoga as compared to their other branch ...e,g u have drraw the figure where it can be in infinte sate if goal edge will be higher weight than the current node..so at 4:00 u tokd point A pe nahi jaa sakega as it is already before visited ,,,this should not be reason ....its weight is already lower than the current edge ..nahi toh apapne pahale video mein galat bataya hoga

[@AliKhan-ri5fk]

And by the way its stuck not struck

[@Faiq__Mustafa]

answer to optimal aya nahi

[@abhishekkudwa5150]

this video is the wrong explanation for this algorithm as we've to calculate cumulative path from first node.=

[@yeakingroupdjrj6913]

ai fail but pass..

[@dvs0783]

Algorithm do na iska

[@introtoprogramming9162]

Bhai jan jb ni pta hota to q uth k a gy ho prhany ja k khuf prha kro phly mera paper glt Krwa diya ajeeb

[@aayushverma1264]

Wrong explanation!!

[@vishrutmahi6593]

wrong explanation

[@munibabu5566]

Incorrect explanation.. Pls check and correct it or take it down!!

[@prashantsubedi8979]

Ans for goal H : Visited= A,C,B,E,D,G,F,H (cost : 25 )

[@aryarohanrachamalla2730]

It is wrong

[@shubhamrawat4188]

Wrong Explanaton ❌❌❌❌❌❌❌❌❌❌❌❌❌❌❌❌❌

[@hntechshadow]

sara concept khrab hu rha h

[@mdz3183]

Wrong this is not how it works!

[@sayangarai9109]

Yeh aadmi kitna galat bata diya yeh :) Cumulative cost add karte hue jaate hain, not just the cost at every node.

[@sumitshinde7636]

True

[@usmanbhutta111]

Using totally wrong method of explaining UCS .😢😢

[@nasa-fc3g]

Wronggg!!

[@proybr9761]

This is wrong method

[@myclassroom1649]

2:33 stuck not struck

[@salmanahmadkhan4417]

jab theek nahi parhana aata to na parhaya karo

[@sarthak.30]

this whole explanation is wrong

[@ashrais]

This is wrong approach..stop misleading people. You should never teach wrong things to people if you can't teach rights things atleast.

[@user-nd7lr7bo4t]

totally wrong

[@vikasgodara7473]

Totally wrong

[@Ahmad_speaks]

you provide wrong information about back tracking........ This is not how it works👎👎👎

[@a12sd34f-un2rr]

Wrong explanation

[@killMan5746]

infinite loop m kaise jayega??

[@killMan5746]

koi sense nhi thi sir ki explaination m