A Star algorithm | Example | Informed search | Artificial intelligence | Lec-21 | Bhanu Priya

a star algorithm: Informed search in artificial intelligence with example

[@mateolopez5585]

I don't know what I'd do without Indian youtubers explaining these topics so well

[@GSEDITZAMV]

Aren't you india?

[@mateolopez5585]

@@GSEDITZAMV I'm Argentine

[@molisemahasele8008]

i know im not the only computer science major preparing for a test last minute

[@tarikeld11]

yes xD

[@CSSANJAYR]

dood i literally have 1hr for my exam and im starting the 1st topic here

[@abhibhuprakash2994]

me too

[@arjanhazra7255]

@@CSSANJAYR Bro , I'm same condition now.Just giving my first offline exam in btech. Please say how you was your exam

[@CSSANJAYR]

@@arjanhazra7255 yep ,just understand the concepts don't memorize. relative the concepts with an example sum work it out

[@alexkim-soo2845]

If you were like me and did not know what is "heuristic value". code wise: its a function that take in the node and the goal, and base on a chosen formula(Euclidean, Mathattan etc) will provide an approximate distance of this node to the goal. If assuming euclidean then its the distance taking a straight line from A node to G node, ignoring all the path that should be taken.(like an airplane/helicopter ignoring roads)

[@drex-0299]

Thanks buddy

[@SPeeDKiLL45]

very helpful comment.

[@kaushalganatra4208]

Thanks dude!

[@oldschoolgamer6941]

It was definitely helpful, thank you

[@abhishekdharwad5042]

Thanks man

[@AmanMalik-z2p]

5hours before exam😂

[@rahulreji4079]

15mins before exam lol

[@twilightangel8790]

1 second b4 exam

[@twilightangel8790]

In exam hall😮

[@shivaya__nama]

1day before exam 😅

[@aryxslayer04]

Milli second before exam

[@ikemuoma8495]

Best explanation of the A * algorithm I have seen. Very good. 👍

[@BrianMbuthiaKe]

3 hours before exams 😂

[@lydialydia8491]

The only video that actually helped me to understand A* algorithm. Amazing good!!!

[@alexlu7149]

I searched many videos and I can surely say this is the best explanation about the a* alg.

[@jubileemanlunas1672]

I agree

[@ezasokotela7523]

This is a remarkably clear explanation!

[@wisk379]

IK right! very solid explanation!

[@WindyHellLetsLoose]

One question, what if S -> A -> B -> D ->G has a less cost than S -> A ->C ->G. How would the search end up with this assumption?

[@jubileemanlunas1672]

the same process

[@momolight2468]

This is impossible because just SAB on its own has a cost of 7. So if we add the whole path SABDG it will be surely more than just SACG, which has a cost of 6.

[@aarrjunumrikar5345]

This was a very lovely and clear explanation. Thank you ma'am!

[@ibnualwi9784]

tq aka , very useful for exams , got my exam tomorrow, thanks again!

[@alaaelbarasi8619]

simple and straightforward. Many thanks

[@nadeeradulan9231]

I did my assignment using your explanation! Thanks

[@dyyno5578]

how did she make the heuristics and state table 2:00 ? like did she give random values ?

[@SolutionHunterz]

I am wondering the same, like how to get heuristics values. Is that based on calculation or just random values

[@Giburozu]

​@@SolutionHunterzu found the answer?

[@dhanushchowdary4814]

​@@Giburozu h values will be given in question itself

[@realcryptc]

This was very helpful, thanks so much!

[@RRover8888]

Your explanation is smooth like butter, madam! 💜 Very clean and clear explanation

[@bhamidimaharshi]

JUST JUST JUST in minutes you explained , I subscribed, liked immediately, awesome explanation....

[@srilekhakaturi3887]

Can you please explain remaining concepts of Artificial intelligence Which will be very helpful for our exams

[@moseskorrapati]

Mam at 1:30 how to take that heuristic values ....... Can anyone pls explain

[@doramaria.1308]

You don't need to find that, as it will be already given in the question itself

[@HOLONIA4EVER]

What you would do if one of the values you put in "hold" would be less then the value 6 (s->a->c->g) ?

[@norbertmargit6282]

Then you would keep searching on that path to see if you can find a better solution. Let's say s->a->c->g is actually 9. In this case s->a->b is 7 which is less than 9, so you need to keep looking on that path to see if you can find a shorter path than 9. The F(n) of s->a->b->d is is 14 (8+6) which is more than 9, so you can stop searching this path, beacuse you can already reach your goal in 9. However if it would be 8, then you would still need to keep looking beacuse at that moment you could still technically find a better result than 9. Hope this helps :)

[@-saitejavarma]

It was simple and understanding easily thank you for your explanation it was helpful for my tomorrow exam

[@Bill0102]

I'm blown away by the quality here. I recently enjoyed a similar book, and it was top-notch. "Game Theory and the Pursuit of Algorithmic Fairness" by Jack Frostwell

[@brwaabdulrahman2263]

This was very helpful 👍🏿.. thanks so much ♥️

[@fancyAlex1993]

Just to let u know, u are the best Madam !

[@s_kazi8202]

First sentence m hi mistake ...tree never contains cycles ... DEFINITION OF TREE says tree is a directed acyclic graph

[@SharathsooryaBCS]

Mam , How to calculate the h(n) value here?

[@yairbarak10]

From what i have read the h(n) value can be calculated in various ways, depending on the situation. For example if you need to find the shortest path on a map, you might want to choose the h(n) value to be the euclidean distance between the next node and the target node. The quality of the A* algorithm is usually determined by how well h is defined.

[@SharathsooryaBCS]

@@yairbarak10 thank you

[@shyamkulkarni8710]

mam don't comment take lec or leav it & no for doubt solving in comment section its on for tp or els it would be off

[@RajeshwariKhanuri]

U made it very simple to understand thanks❤

[@SaileeShingare]

Understood well. Thank you ma'am 😊

[@NazimaNazimabanu-e8s]

I think i can't forget this for the hole life ..😊😊🎉thanks mam its very good explanation..👍

[@Kirukku_paiyan_07]

*whole

[@MATTesticle]

You have explained this very efficiently, thank you!

[@englishstation2024]

S equals to 5 how?? Please explain

[@muhammadshehzar8424]

How do we get heuristic value?

[@kartooz9788]

Actually the hueristic value is an estimated value that is taken from current node or point to Goal point.Like an assumtion!

[@rishabhrajrishu_]

most important thing,its already given in question

[@NavjotKaur-pk4gx]

h(n) and g(n) are estimated values means we can take any number???

[@jeffreystevens8042]

@@NavjotKaur-pk4gx a way you can create estimates is to place your graph nodes on a grid that have distance between them associated with the edge weights. You can then use the pythagorean theorem to calculate distance between nodes on the graph, which you can use for your estimate function h.

[@NavjotKaur-pk4gx]

@@jeffreystevens8042 ok thanks sir

[@ravikumargantla7998]

6:28 screeshot here

[@loganpraz2566]

Great video! Way better than my professor

[@rajababukannoju532]

How the heuristic values.are taken ...!? Any formula...?

[@sna241]

Thanks a lot. I was watching a lot of resources only to get confused. This video is clear.

[@eddiej204]

Am I getting this right that the HValue came from the particular node to the Target node? For example, I am at node B, and the HValue of it is 4. Meaning that from B to G (G is the target node) the approximate distance of it is 4. While approximate distance is the HValue which maybe calculated using Euclidean or Mathattan etc. Please suggest

[@badassopenpolling]

What was the mechanism to take heuristic values ????? How did you come to S - 5, A- 3 so on... What exactly is the heuristic value ??? In real time - Do we get this heuristic value to solve problems for finding paths. I gues No !! Answer is = Heuristic value is the distance from node to the Goal.

[@elloomii2681]

Thanks alot for this great efforts … very beneficial video

[@praveenkumarboddu6451]

Very useful for Exams.Thanks a Lot!!

[@AdamVigas]

is this called Greedy algorithm ?

[@patrickpark75]

No

[@hendriyawanachmad2017]

why you set the heuristic value of D with 6 when the cost from D to G is 2? Heuristic value must UNDERESTIMATE the cost isn't? CMIIW

[@mehmetsavasci7777]

I think using this heuristic is valid, however, this makes the heuristic inadmissible. For admissible heuristic, for every n, h(n)

[@電腦騙徒剋星]

connect s to g is already bullshit , which is shortest path , unless he mean curve one

[@namotech6770]

how to calculate the heuristic value

[@sealivezentrum]

right to the point; very good

[@ar_xiv]

Is there a relationship between the distances and h(n)? I don’t understand where the h(n) values are coming from. Are they arbitrary like the distances?

[@Dxntoo]

usually the value is given. h(n) is the distance/cost between the current node to the end node hence why the goal node has 0 as its heuristic value.

[@vinea9322]

​@@Dxntoo that doesn't answer his question. Where is she pulling those numbers from. How is it related to distance?

[@Giburozu]

​@@vinea9322hey, u found the answer?

[@gantasalasaivasanth6512]

I can only tq very much pls continue ur nature of teaching mam

[@shapespheres]

By the time yall watching this, I have finish the exam, good luck my juniors 🗣🙏

[@shivkrishnajaiswal8394]

how do you calculate h(n) in the first place? (rest of the algo is trivial)

[@mazharbukhari786]

As the left table depicts, heuristic value of S is 5 and cost is 0, so the formulas will be as f(n) = g(n) + h(n) f(n) = 0 + 5 f(n) = 5

[@bloodmoon1729]

It is an assumption that we are using a cordinate system to get that distance.

[@hadjer168]

@@bloodmoon1729 manhatten distance ?

[@Giburozu]

​@@bloodmoon1729if h(n) an assumption, i put random number as my assumption but the result is different

[@iammayurn]

Thank you, Mam. for the wonderful explanation

[@education4uofficial]

Thanks for liking

[@SidraGhafoor-zd7ce]

How to find the heuristic value ? Can anyone tell me ?

[@doramaria.1308]

Why? We can't find the heuristic value, as it will already given in the question. We need to find F(n) not H(n).

[@Pavan_TechChannel]

my question is how u take the heristic values ? apart that i understand evertyhing !

[@simulink9564]

Yes, i curious about this too 🤔😕, because we can't put here random values.

[@Giburozu]

​@@simulink9564hey, u found the answer?

[@anthonysiluvaiwinsp8204]

awesome mam , understood clearly :)

[@eklavya22k34]

Thanks , explained v well. Thanks for creating video and sharing with us.

[@rsjawahar]

How to calculate h(n) value s is 5, a is 3 how to calculate

[@muhammadahmed4976]

mam why did you not check sabdg ? in some other case it might have been shorter, so should we take that part?

[@sanjayrajan7949]

Thank u so much...... nicely explained mam...........

[@eminguney9714]

Thanks a lot for good presentation🙌

[@azik6138]

Thank you so much saved me for my exam!

[@ΑντρέαςΣωτηρίου-π8γ]

Top Explanation !!

[@puneethkamadolli423]

If I pass my exam tomorrow You are the reason 💪🏻

[@muddypawswanderlust]

what is h(n)? and how did you assign those numbers to it?

[@Giburozu]

Hey, u found the answer?

[@giftmarshallchawira241]

You are the best. Thank you ma'am

[@secretfairy851]

Informative 👍💝

[@SupriyaNR]

In the last step 6 can be compared with the hold values which is smaller so we kept as it is wht if the value is greater than that we should again comparing the values

[@udiptadeka562]

wow what a explanation.The teacher we all want

[@esraelbizuneh9756]

excellent explanation thanks ma'am from ethopia

[@sonu.t.v2700]

2 hr before exam🎉

[@emirhanbilgic2475]

simplest example, thank you madam.

[@bajrangsharma2762]

what a good presentation mam easy way

[@rohangokulbharathala5188]

how can we write hueristic value for the s,a,b,c,d,g ??

[@varshasaraswathi3160]

Do u know it now ? How to choose heuristic value, if s pls xplain ..

[@Vikashkumar-ec5fl]

Mam aapne ECE pdha h kya..?

[@aryxslayer04]

Amazing Thanks for the video

[@aravindkola3208]

thank you so much mam

[@riyazahmed7907]

The explanation was very clear!

[@bfranklin4302]

Thank for the lesson. Will one of you help me understand

[@kelvinkirwa4887]

whsi is the one giving the heuristics now ?

[@samarthraj5676]

But what should we do if it is greater than the hold value If there is a situation like that

[@sayanhrik]

excellent explaination

[@TP-mv6en]

Really good explanation and method 👍

[@quantumspark343]

Best explanation ever

[@advosreactionroom8416]

what to do if the hold value is smaller than the goal state value ?

[@Kcnc0716]

Really simple explanation, thanks!

[@mohammedashikhussain636]

How you are putting h(n)in state table box

[@SamDrives]

Thanks for keeping it so simple!

[@imalallawmkima8081]

How is heuristic value taken from

[@annemasadi8067]

Thank u teacher.it helped me a lot.

[@Tejusha]

How did you take h(N) values

[@santhiyakannan1761]

Y u didnt use open and close list

[@codeblooded6760]

What is heurestic value?

[@Greatfulone]

So the hold values are used to make sure we get the least costly path to the goal? That means we check at the end and see if we have the least costly path. Right? Is there any other time I need to review the hold values? Thank you.

[@abutalhanasardi1150]

Mam direct bhi to S se G ka path nikalta haina

[@VikramSingh-gq5ww]

S to a =1, a to b = 3, b to d = 5, d to g = 2

[@chingkhei_thoudam]

When should we use the heuristic value of S?

[@bayan3032]

you're the best! thank you so much

[@chandrakanthsrinivas8184]

Thanks for this I understood this at one shot

[@Smoochybear17]

Why are the nodes weighted?

[@JayPatel-ou2ud]

Best and easy explanation 🤩

[@IrtizaMushtaq-]

Thank you so mch. You explained this nicely

[@Janush___]

Thankyou mam