00:02 AO* algorithm is based on AND/OR graph and problem decomposition. 01:37 AO* algorithm is an informed search technique in AI. 03:08 AO* algorithm in AI focuses on finding optimal solutions and does not explore further solutions once a solution is found. 04:36 The AO* algorithm in AI evaluates the total cost of different paths 06:06 Exploring different possibilities in AO* algorithm can reduce the cost. 07:38 AO* algorithm in AI works by finding new estimation values at each level 10:05 The AO* algorithm assigns costs to different paths and chooses the one with the lowest cost. 11:41 AO* algorithm in AI explained with example
You won't believe me, if I tell you what happened in our college recently. There was a guest lecture on AI and the lecturer was explaining these concepts and he used the exact example you are using.😂🤣
Beware your Ma'am or Sir will come here again...they have to teach the juniors also ..the same Funda ... May be they Check Your comments and recognise you 😂
Sir in second example we will not go in another direction as we already travers in one direction and we got our answer(8),So why we are going in another direction and generating our new heuristic value(5).as it is AO* not A*
Sir can you make more videos on those subjects which we have in gate examination syllabus... It will more helpful for gate aspirants And moreover your lectures had helped me alot me in my engineering... Thank you sir ❤
Sir can you make more videos on those subjects which we have in gate examination syllabus... It will more helpful for gate aspirants And moreover your lectures had helped me alot me in my engineering... Thank you sir ❤️
clarity is missing a bit. It's confusing. Why should we need to calculate the heuristic values again? What is the start state and what is the goal state? Why are you updating the heuristic values again and again? I have understood till A* but this very confusing.
Definitely Bohot aavhe se samjaya or aa bhi gaya....but university exam me esse paper me likhenge kese....kyuki sirf number cut kr krke solve krke aaye to marks bhi cut hoke hi aayenge
Why do we need to calculate from top to bottom first, shouldn't we just start calculating from the bottom and propogate the values upwards and then finally traverse assessing the those calculated values?
extra computation overhead plus extra time taken to do that maybe? When using Google maps: 1 find one of fastest route quickly 2 find THE BEST but with a delay. case1 much more preferable
Nice Explanation.... But I have a qn, what is the goal node in your example? If "A" is the goal node then why we calculate the heurestic cost of A?? where we know that heurestic cost of the goal node always zero!!! I am totally confuse..
2nd example: while traversing from bottom to top it updates the estimated vales , as updated value (earlier was 5 now updated to 8) is greater than the 7 : the right side estimate of A so it explore the riht side as well
@@shivanikulshreshtha6858 No thats not it... What you are saying, then it becomes same as A* search, but it is not, it went to other side because goal was not found....
Werent Heuristics suppposed to be Less values than actual cost? Because they would be Straight Distance to Goal or Manhantten etc. But here we are updating costs because they are Bigger than actual value Why
2nd example: while traversing from bottom to top it updates the estimated vales , as updated value (earlier was 5 now updated to 8) is greater than the 7 : the right side estimate of A so it explore the riht side as well
I often get a feelinng that Rahul Dua is teaching me !! Then too nice video Sir loved it !
Kon rahul dua? Vo host and comedian?
@@known878 haan bhai
Feel Glad and confident to study here!
No one can beat you in a teaching...
Really the best explanation sir..❤❤
Without your channel I can't even imagine my Engineering....
Sir, your teaching is fabulous. You clear the basic concepts in a very simple way.
Very simple and best explanation method . Thank you sir
4:02 some light humor for you guys, honks which we are all familiar with. Thank you varun sir, got my EndSem Tomorrow! You rock
Endsem went well!
@@manansharma9355 that's great!
I know a gentleman never tells ;) but can I still get your number
It seems that u have lots of experience in teaching..
Sir. Whatever u teach us, everything is understandable. Thanks a lot! ❤️
It hits different when endsem is tomorrow.
00:02 AO* algorithm is based on AND/OR graph and problem decomposition.
01:37 AO* algorithm is an informed search technique in AI.
03:08 AO* algorithm in AI focuses on finding optimal solutions and does not explore further solutions once a solution is found.
04:36 The AO* algorithm in AI evaluates the total cost of different paths
06:06 Exploring different possibilities in AO* algorithm can reduce the cost.
07:38 AO* algorithm in AI works by finding new estimation values at each level
10:05 The AO* algorithm assigns costs to different paths and chooses the one with the lowest cost.
11:41 AO* algorithm in AI explained with example
Very very thank u sir....aap bhut acche se pdhaate ho...
You won't believe me, if I tell you what happened in our college recently. There was a guest lecture on AI and the lecturer was explaining these concepts and he used the exact example you are using.😂🤣
Humari mam bhi Inka hi lecture dekh ke gyi thi🫡😂😂
@@artilodhi9396same 🤣🤣
Isme beleive kya ni karna 😅😅
Same😢
Beware your Ma'am or Sir will come here again...they have to teach the juniors also ..the same Funda ... May be they Check Your comments and recognise you 😂
your real life examples are awesome
Even my professor teach us after seeing your lectures even they are not able to change the example 🤣
Sir in second example we will not go in another direction as we already travers in one direction and we got our answer(8),So why we are going in another direction and generating our new heuristic value(5).as it is AO* not A*
Because now A is 8 and 7. And 7 < 8. So now we will go to side which has 7
I too want to “exam in the pass.” 😂
Anyways, your videos are awesome-explanatory, plus your energy is thriving. Thank you sir.
:-}
hahahaha
Superbly explained each concept
Bohot accha smjhate h ap thank u
love from Pakistan..
Nice explained Sir.
Sir u were saying that AO*doesn't explore all paths but in last diagram you explored all the paths why sir?
AO* doesn’t explore all the paths if it gets a solution. In last diagram it didn’t get solution at first.
C , D nodes are in AND so both paths have to explored together
Tough concept, but sir made it easy. Thanks Sir
Sir can you make more videos on those subjects which we have in gate examination syllabus... It will more helpful for gate aspirants
And moreover your lectures had helped me alot me in my engineering... Thank you sir ❤
Simply explained 👍
Great explanation and very precious knowledge for our university exam thanks sir
Great explanation sir...
Your all videos are helpful for students....Thank you so much
These are awsm vdo sir . Plz upload fastly. Thanks so much
Gurujee shandar jabardast zindabaad
Thanku Very Much🙏🙏🙏
thanku Sir
Great explanation
great presentation sir... im a huge fan of u.. hats off
Sir can you make more videos on those subjects which we have in gate examination syllabus... It will more helpful for gate aspirants
And moreover your lectures had helped me alot me in my engineering... Thank you sir ❤️
Sir amazing lecture
Sir language is problem but teaching is good. Thanks from Tamilnadu 🥰
I can't express sir ur video's are amazing and helpful art of teaching is incredible so plz upload more and more videos of AI
Very good sir
you're amazing. Super thanks for the content.
thanks you so much sir for teaching us ❤❤
Branch and bound algorithm v explain kar dijiye bhaiya pls
Bro plz upload complete syllabus bro am completely dependent on u bro...for teaching.....super bro
Bus krta bro 😂
Basically, it is a greedy approach with backtracking. 👌👌👌
It seems that u have lots of experience in teaching..
Sir. Whatever u teach us, everything is understandable. Thanks a lot! ❤
bhai tune to comment copy kar diya
Amazing sir..😊
Thanks a lot Sir!!
Sir plz make a video on Goal Stack Planning
clarity is missing a bit. It's confusing. Why should we need to calculate the heuristic values again? What is the start state and what is the goal state? Why are you updating the heuristic values again and again? I have understood till A* but this very confusing.
Same brush
No it's not confusing I understand it in 1st time
Same bro😅
wts the use of correcting the Heuristic values? Doesnt it increase time Complexity too ?
Definitely Bohot aavhe se samjaya or aa bhi gaya....but university exam me esse paper me likhenge kese....kyuki sirf number cut kr krke solve krke aaye to marks bhi cut hoke hi aayenge
thank you Sir!!
nice expln sir .Thnku so much sir u r great .
Thank You for your appreciation. Keep learning and sharing
Really appreciating approach of teaching sir
Thanks a lot sir
waiting for next video sir..pls help us to complete our syllabus for nta net...thnku
helpful thankyou
Sir doubt
Why we won't take new heursitic value to top in A* algorithm why we only take in AO* algorithm
Sir plz data structures ke sllyBus PR bi videos bnado like all sorting techniques with algorithm
Sir your videos are very helpful in concept building, Thanks a lot.
thank you so very much
Thanxuuu sooomuch sir.. All videos are very beneficial for examz.
tqsm sir
What data structure is used for ao* algo???
Where are video lectures of other logic and reasoning types?? Please make videos on them.
Nice to see you that you are commenting same things in all the videos ✌️
@@Patitapaban_sahoo 😂😂 just to gain sir's attention 😅😅
You are the best
Why do we need to calculate from top to bottom first, shouldn't we just start calculating from the bottom and propogate the values upwards and then finally traverse assessing the those calculated values?
extra computation overhead plus extra time taken to do that maybe? When using Google maps:
1 find one of fastest route quickly
2 find THE BEST but with a delay.
case1 much more preferable
Ty soo much... I love you 😊😊
Thank You for your love and support. Keep learning and sharing.🙏
Aoa thanks from pakistan sir
And aik question h kiya hum isko problem reduction technique kah skty hn
Great explaination sir.very helpful.thanx
Anyone noticed Sir said at 1:14 to 1:17, "Want to Exam in the pass".....😆🤣
Want to exam in the pass? Yes sir. :D
Kehna kya chaahte ho bhai 🤣🤣🤣🤣
@@pubgcr7575 1:16
singla g bohat ala
Thanks a ton sir
sir please kindly do upload more videos of AI..
Will upload in september. Stay Tuned..
@@GateSmashers thanks for your response
Thanks sir g 👍
Nice Explanation.... But I have a qn, what is the goal node in your example? If "A" is the goal node then why we calculate the heurestic cost of A?? where we know that heurestic cost of the goal node always zero!!! I am totally confuse..
there is no goal in AO*
Thanks bhaiya
Sir please upload more questions on AO*
algorithm
Sir I have a one question ,can i write algorithm as you explain in video in normal English in step wise
yup algorithm is just human readable form of a big code, so makes sense if we write it in easy language
Thank you sir, its a very helpful.
is this probl;em reduction algorithm
Huge respect
Too good hats off 🎉sir Pls give mcq series sepreatly according to net paper .
Thnku sir
Sir in second example we explore the both side.
Do hardwork or listen your videos...☺️
Thanks sir
Happy teachers day sir
Sir ..kindly upload video for IDA* and RBFS search in informed search strategies in AI ..thankful to u sir ..please sir
Plz upload more videos of AI as soon as possible
Sir yaha goal state konsa hai.
Please make video on IDA* and SMA*
What's the minimum cost of the second graph?
5
Please Clear My doubt ---- AO* Algorithm And Best First Search both are same or different
u said AO* dont explore the other side but in next example u explored all nodes why?????
iska solution pta chla kya
2nd example: while traversing from bottom to top it updates the estimated vales , as updated value (earlier was 5 now updated to 8) is greater than the 7 : the right side estimate of A so it explore the riht side as well
Bro I also thought upon this for long... The answer maybe is::: It did not find a solution tree on the B node side, so it went to the other side.
I think it checked the hueristic value, the heuristic of other side was lesser that's why it it explored that side..
@@shivanikulshreshtha6858 No thats not it... What you are saying, then it becomes same as A* search, but it is not, it went to other side because goal was not found....
M waiting 4 ur next video sir
Our prof copied your example😅😅
Really helpful...
Werent Heuristics suppposed to be Less values than actual cost?
Because they would be Straight Distance to Goal or Manhantten etc.
But here we are updating costs because they are Bigger than actual value
Why
.osam
Sir can u add perceptron , gradient descent and adaline topics into the playlist that would be very helpful
End sem is tomorrow and i learn this now 🤣🤣
thanks a lot sir please making videos on game playing, Agent's, expert system and alpha beta pruning
AO* does not explore the all the nodes how then we decide it from the first level then you can solve it..like this
But u said it won't check the other solution once we find the optimum solution but u solved all the nodes, I am confused
2nd example: while traversing from bottom to top it updates the estimated vales , as updated value (earlier was 5 now updated to 8) is greater than the 7 : the right side estimate of A so it explore the riht side as well