91´«Ã½

Duration: 8 hours

The first week in this course provides an introduction to path planning and presents a series of optimal algorithms for finding the shortest path on a graph that increase in complexity and efficiency. You will be introduced to various algorithms, including Bread-First Search to Dijkstra's and A*.

Ìý

Duration: 7 hours

In this week, you will learn how to efficiently plan in non-grid worlds and in high-dimensional spaces.

Ìý

Duration: 8Ìýhours

This week introduces you to a new programming abstraction known as "Behavior Trees", which offers solutions to shortcomings of Finite State Machines and simple reactive controllers.

Ìý

Duration: 7 hours

This week you will learn how to extend a mobile base with a robotic arm and trigger the ability to grasp objects.

Ìý

Duration: 10 hours

In this last week, you will complete a final project to demonstrate your knowledge of both this course and the entire specialization. It consists of implementing a complete mobile manipulation solution.

Ìý

Duration: 1 hour

Final Exam Format: Timed, in-course exam, not proctored

If you've upgraded to the for-credit version of this course, please make sure you review the additional for-credit materials in the introductory module and anywhere else they may be found. The final exam consists of multiple-choice questions covering the entire course, from planning to behavior trees and basic manipulation. Most questions are variations from practice quizzes that were sprinkled throughout this course. A good preparation is therefore to review all previous practice quizzes and re-read the supporting materials to understand each answer.

Ìý