Bot Field
Bot Field
  • 5
  • 24 730
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.
Переглядів: 4 241

Відео

Wavefront And Dijkstra | Path Planning
Переглядів 4,2 тис.4 роки тому
Common non-heuristic based path finding algorithms, including Wavefront, Breadth-First Search, and Dijkstra's algorithm. Though not usually used on their own for finding single paths, these algorithms are easier to implement and provide basis for more efficient algorithms.
Occupancy Grids | Path Planning
Переглядів 6 тис.4 роки тому
Occupancy grids are essential in a robot's interaction with its environment and are widely used in robotics. Like many things, though, they have their disadvantages. In this video I'll tell you a bit about why and how they are used, and how they can be improved. And of course you'll get to meet Tango.
Particle Filters | Robot Localization
Переглядів 10 тис.4 роки тому
This is the first video in a series of videos about robot localization. In other words, finding the location of a robot in a map. This method works basically on its own, and I think that's why it's so cool to watch as it works. Interested in exploring it for yourself? The code and download is here: github.com/elstaknis/ParticleFilter The README (click the link above and scroll down) will let yo...
Welcome to Bot Field
Переглядів 3224 роки тому
We did that thing where we worked really hard for a few years to get a college degree. Now we're going to extract all the fun parts and teach them to you. The best part? You only need a middle school level of math to be able to understand most of our videos. So subscribe to learn about the cool things happening in robotics, math, and physics all around you.