Path Planning Basics

Learn the theory behind the most used path planning algorithms.


ROS
12 hours
1 robot used
0% completed

Course overview

Path planning is a key component required to solve the larger problem of “autonomous robot navigation”. In this course, you will learn about the most used path planning algorithms.

What You Will Learn

You will start the course by learning how to develop allegedly one of the most famous algorithms in Computer Science: Dijkstra’s shortest path algorithm.

We will continue by introducing Greedy Best-First Search, which evolves the fundamental principles set by Dijkastra to include a heuristic function which in some cases can speed up the search process significantly.
As your understanding progresses, you will expand your path planning skills evolving the properties of the algorithm to convert it into the implementation of A* (A -Star).

Then you will turn to learn a method that takes a completely different approach to path planning, namely RRT.

At the end of this course, you will be well aware of various different approaches that have been developed and applied to successfully solve the global path planning problem. Furthermore, you will be able to understand and explain the differences between them as well as the advantages and drawbacks of each other. Last but not least you will have gained solid practical experience by implementing these methods yourself.

Course Summary

User Ratings

Order ratings by

Moses Kota
Rated 5 stars out of 5
5.0
12/11/2022, 03:39:19
Carter Hrabrick
Rated 5 stars out of 5
5.0
2/11/2022, 15:03:26
Addison Azar
Rated 5 stars out of 5
5.0
31/10/2022, 23:56:37
Jared Bowling
Rated 4 stars out of 5
4.0
31/10/2022, 21:27:28
Jack Doherty
Rated 5 stars out of 5
5.0
31/10/2022, 19:53:22
Elizabeth Gonzalez
Rated 4 stars out of 5
4.0
31/10/2022, 15:28:35
Allison Fick
Rated 4 stars out of 5
4.0
31/10/2022, 04:49:12
Frederick Feliciano
Rated 4 stars out of 5
4.0
31/10/2022, 02:25:55
Gordie Bess
Rated 4 stars out of 5
4.0
29/10/2022, 21:41:31
Eric Hawkins
Rated 5 stars out of 5
5.0
27/10/2022, 01:36:38
Madeline Holl
Rated 5 stars out of 5
5.0
Good Description of the algorithm and guidance through actually coding each algorithm
26/10/2022, 00:19:50
Liz Callahan
Rated 4 stars out of 5
4.0
25/10/2022, 20:24:48
Michael Troyer
Rated 5 stars out of 5
5.0
14/10/2022, 19:43:28
Lara Laban
Rated 5 stars out of 5
5.0
10/10/2022, 07:45:17
Rangel Alvarado
Rated 5 stars out of 5
5.0
10/10/2022, 02:45:42
Jacob Wax
Rated 4 stars out of 5
4.0
8/10/2022, 09:42:26
Francisco José Mañas Álvarez
Rated 4 stars out of 5
4.0
29/9/2022, 09:22:41
Muhammad Fat-hi
Rated 5 stars out of 5
5.0
9/9/2022, 20:12:54
cheng tang
Rated 5 stars out of 5
5.0
6/9/2022, 03:52:56
Ulises Rau Espinoza
Rated 5 stars out of 5
5.0
28/8/2022, 19:43:43
Ido Finkelman
Rated 4 stars out of 5
4.0
22/8/2022, 10:28:49
Foo Wei Jun
Rated 5 stars out of 5
5.0
15/8/2022, 02:59:39
Lucky Nayak
Rated 4 stars out of 5
4.0
6/8/2022, 14:39:24
Seung Hwangbo
Rated 4 stars out of 5
4.0
7/7/2022, 07:26:13
Olumide Godson
Rated 5 stars out of 5
5.0
30/6/2022, 06:29:01

Showing page 1 of 2. Total records: 28.

This course is part of this learning path:
Basic Robotics Theory

Course Creators

Roberto Zegers