Autonomous Mobile Robots Course

Course requirements edX Autonomous Mobile Robots | MatLab for edX classes | V-REP | MatLab
The goal of this course is to implement motion planning algorithms that enable the robot to navigate through a partially known environment. In order to achieve this task, two commonly used algorithms will be applied: Dijkstra’s algorithm for computing a navigation function based on a static map of the environment, and the Dynamic Window Approach (DWA) for online planning, taking into account both static and dynamic obstacles. The algorithms are described in the book “Introduction to Autonomous Mobile Robots.” I recommend installing the course environment in the same Ubuntu operating system from my previous course page. Take a look at the course slides below and I hope you enjoy this course.
MatLab Learning Template | MatLab Notes

Course 1: Lecture and Assignment

The first course will deal with locomotion concepts. From Railbert Hopper to Humanoids and Quadrupeds. The first assignment is due on Monday. Find the course classroom and content through these links. Links Coming Soon.

Google Classroom: Exercise 1
YouTube Video (Ready for it...)
Exercise 1: Zip File (Available)
Simulating V-REP
Assign 1: PDF
Lecture 1 Slides: PDF

Course 2: Lecture and Assignment

Introduction to V-REP. The second course will deal with proximity sensors. More than simple ray-type detection, configurable detection volume, fast minimum distance calculations within volume, and much more realistic simulation than with ray-type sensors. This assignment is due on Wednesday. Links Coming Soon.

Google Classroom: Exercise 2
YouTube Video
Exercise 2: Zip File (Available)
Assign 2: PDF
Lecture 2 Slides: PDF

Course 3: Lecture and Assignment

This assignment will deal with forward kinematics. Given a set of actuator positions, determine the corresponding pose. This assignment and exercise will be due on Friday. Links Coming Soon.

Google Classroom: Exercise 3
YouTube Video
Assign 3: PDF
Lecture 3 Slides: PDF

Course 4: Lecture and Assignment

This assignment will deal with Dijkstra's algorithm (Siegwart et al., 2011, p.382). Links Coming Soon (Assign 4 is ready).

Google Classroom: Exercise 6
YouTube Video
Exercise 6: Zip File (Available)
Assign 6: PDF (Available)
Lecture 6 Slides: PDF
Last TODOs: PDF (Available Sticky Notes)

Directions for viewing the Last TODOs:PDF. Download the pdf and the comments sticky notes will be displayed (Pictured in the image below). The Chrome Browser will show the yellow sticky note but in order to view it you will need to download it and open it with Adobe Acrobat Reader.