The Greedy Algorithm and A* | Path Planning

The most efficient and effective way to find a path is A* (A-Star). The Greedy algorithm uses some of the same principles but can end up with a significantly worse path. Why do these similar algorithms end up with such different results, and why are they so much more efficient than Dijkstra's algorithm? Take a look to find out.

[@vaughnmonkey]

amazing video you explained this so much better than my professor while also being fun and taking a 1/6th of the time he took

[@acy9901234]

really good video. can't wait for the next videos

[@mrkirby5250]

Very cool

[@paugasolina5048]

damn bra u smart as fuk

[@jameslightforce6194]

What happened to this channel?

[@botfield2530]

Making these videos took a lot of time, and my method for doing these animations was PowerPoint. Yes, PowerPoint. And yes, it was as terrible and time consuming as you would think. I was also in college at the time, and I just stopped having the time to do this. I may pick this channel back up at some point, but I would first need to learn an actual animation software or write my own

[@jameslightforce6194]

@@botfield2530 Ahh I see that is completely fair enough. Would’ve never guessed powerpoint from your videos… but anyways this is a great channel with very easy to understand videos! May I ask if you’re working in robotics now?