Computer Science 154
Short assignment 7
Due Monday., Apr. 21 in class

Name(s)  _____________________________________
This page is at http://www.cs.hmc.edu/courses/2003/spring/cs154/assignments/short7.html

Reading for this assignment, linked here:
Monte Carlo Localization for Mobile Robots
by Dellaert, Fox, Burgard, and Thrun.

  1.    Reminder: The final write-up for the final Lab Project is due on Monday, April 28.


  2.    Also: Some of Wednesday, April 30 will be used to demo each groups' robotic systems to the class.


  3.    Due Monday, April 21 Monte Carlo Localization (MCL)    50 points

    For a robust and widely-used robot algorithm, MCL is one of the easiest to implement. However, that is not to say that there aren't pitfalls and insight to be gained from trying out this probabilistic approach to global robot localization. This assignment asks you to do just that using the Nomad simulator.

    The Task Starting with the files in /cs/cs154/as/mcl, implement a Monte Carlo Localization algorithm for the Nomad robot. There are a number of simplifying assumptions you may make:

    The starting files The initial files offer some code to help get you started with programming MCL. You may remove or replace anything you like, but if you choose to use the code there, it provides

    Suggested functions: You may want to create some or all of these four functions in implementing MCL:




    To hand in Hand in the your either via email or by creating a web page with at least three screen shots of your particle-filter localizer in action, both in the simple rectangular environment (mclmap1) and in the maze (maze1). Include a paragraph or two with