Lab 5 - Scan MatchingΒΆ

Note

This is an GROUP assignment.

Tip

Before starting this lab, review Lecture 9 and Lecture 10 ensure you are familiar with the material.

Goals:
This lab deals with the problem of localization in Robotics and provides an introduction to localization and why is it important in the autonomy stack. Through the lab, one of the most fundamental algorithms of localization, scan matching, is implemented. It uses the Iterative Closest Point algorithm which has been introduced in class. You can take reference from the Andre Censi PLICP paper. By the end of this lab you will have a certain level of knowledge and expertise in localization of a robot given a mapped environment and how it is important in path planning and trajectory tracking.
Learning Outcomes:
The following fundamental should be understood by the students upon completion of this lab:

  • Localization

  • Odometry Estimation

  • Convex optimization

  • C++ OOP

  • Quadratic Programming

Required Skills: ROS, Python/C++

Allotted Time: 1 week

Repository: Github Repository
The repository contains the latex source files as well as any skeleton code. Compile the latex source files to view the most up to date handout.