• Students are expected to work in teams by two.
• Each team is asked to implement selected algorithms presented on lectures:
  • Iterative Closest Point for continuous localization. Volunteers can implement also variants of ICP: Iterative Matching Range Point (IMRP) and Iterative Dual Correspondence (IDC)
    • Code
    • Video example
    • Paper about ICP, IMRP, and IDC
  • Kalman filter and Extended Kalman filter for localization
    • Slides
    • Code
  • Particle filter for global localization
    • Motion model code
    • Particle filter code
    • Slides
• Seminar credit allowance conditions:
  • Participation and active work at all seminars (up to 2 absences without an excuse will be tolerated).
  • Presentation of working algorithms solving *all* the tasks and
  • Understanding of the code presented by each team member.

Back to the course page.