Скачать
The Greedy Algorithm and A* | Path Planning
Автор: Bot Field
Загружено: 2020-11-24
Просмотров: 5151
Описание:
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.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
![Motion Planning Algorithms (RRT, RRT*, PRM) - [MIT 6.881 Final Project]](https://ricktube.ru/thumbnail/gP6MRe_IHFo/mqdefault.jpg)
