User Tools

Site Tools


DASL 102: Navigation and Path Planning


This course will cover the basics of navigation and path-planning for mobile robots. The course will focus on many different navigation algorithms, including: Breadth-first Search, Depth-first Search, Dijkstra’s Algorithm/A*, and Potential Fields. Many of these approaches follow a data structure implementation, and such the basics of these will also be covered. For simplicity and better visualization, simulation and virtual approaches will be used during most of the course. However, the course will cover how to obtain basic odometry data for implementation on a real robot platform (Robotino). Finally, the course will compare and contrast the different approaches as they are brought up, and will cover the challenges that come with navigation, especially in real-world applications.


Due to the nature of this course, heavy use of data structures and mathematical analysis will be used. As such, a person taking this course should have experience with the following:

  • C++ Programming, especially data structures and object-oriented programming
  • The Robot Operating System (ROS) for use in simulation and visualization
  • Vector calculus, especially gradients and vector fields
  • Simple trigonometric mathematics, especially for non-holonomic constraints

Lecture Notes


courses/nav_course.txt · Last modified: 2017/05/15 20:10 by dwallace