.
CSE350/450-011: An Introduction to Mobile Robotics

TR 1:10-2:25 PM, Fall 2003

Announcements
Course Description
In this course, we will review prevalent algorithms employed in mobile robotics for motion planning and estimation, with a bias towards the latter.  The objectives of this course are to build a toolkit of algorithms allowing students to implement common robot behaviors, as well as understanding related publications in robotics research.  Topics will include:
Prerequisites
Students will be required to implement several simulators in Matlab over the course of the semester, so a background in programming is assumed.  Knowledge of linear algebra and basic probability theory is helpful, but not required.  

Instructor
John Spletzer
Office Hours:  T 9:00-10:30, F 4:30-6PM and by appointment

Course Materials
There is no required text for this course.  We will be making use of the following online materials (and others), plus selected papers:
  1. Particle Filters
  2. Kalman Filters
  3. Random Sample Consensus (RANSAC)
  4. Motion Planning: 
  5. Image Features
  6. “A Tutorial on Linear Algebra” by Professor C. T. Abdallah, University of New Mexico
  7. Mathworld has the answer to just about any math question you might have.
  8. J. Borenstein, H. R. Everett, and L. Feng, Where am I? Systems and Methods for Mobile Robot Positioning, Mobile Robotics Lab, University of Michigan, March 1996 
  9. A. Kelly, Introduction to Mobile Robots Course Notes, Field Robotics Center, Carnegie Mellon University, 2000, with a particular emphasis on "Uncertainty 1-3"
  10. Matlab Tutorial & Documentation, Mathworks web site
Grading
Grading will be based on 4 assignments, with an additional  informal paper presentation to satisfy the 400-level requirement. Students are permitted to discuss the assignment.  However, all work must be the students' own.  

Students will be given a minimum of one week notice before the assignment due date.  Late assignments will not be accepted unless previous arrangements were made with the course instructor.    

There will be no exams for this course.

The breakout of course grading  is as follows:
ALL ASSIGNMENTS MUST BE SUBMITTED IN ORDER TO RECEIVE A PASSING GRADE IN THIS CLASS.

Grades will be assigned acording to the following distribution:
.
A
92-100
C
72-76
A-
90-91
C-
70-71
B+
87-89
D+
67-69
B
82-86
D
62-66
B-
80-81
D-
60-61
C+
77-79
F
00-59

Late Policy:  Assignments are due PRIOR to class on the due date.  You can submit late (up to the NEXT CLASS TIME) ONE TIME without penalty.  Additional late submissions will be penalized 10% of the final grade.  No assignments will be accepted if over 1 class late.  

Disabilities:  If you have a disability for which you are or may be requesting academic accommodations, please contact your professor and the Office of Academic Support Services, Room 212, University Center (610-758-4152) as early as possible in the semester.

Tentative Schedule
.
DATE
TOPICS
NOTES
ASSIGNMENT
26 Aug  A brief overview to mobile robotics
26 Aug 03

28 Aug - 9 Sep
A review of common sensor systems
  • Position Estimation
  • Vision Systems
  • Range/Bearing Sensors
28 Aug 03
2 Sep 03
4 Sep 03
9 Sep 03
Development of Sensor models
11-16 Sep
Motion Planning Algorithms
  • Potential Field Approaches
  • A*
  • Grassfire

11 Sep 03
16 Sep 03
18 Sep 03


18-23 Sep
Robust Estimation
  • RANSAC

23 Sep 03

Motion Planner & Wall follower simulators
25 Sep - 30 Sep
Review of rigid transformations and
more probability theory
25 Sep 03
30 Sep 03

2 Oct - 7 Oct
Computer Vision Laboratory


9 Oct
Pacing Break


14-23 Oct
Sensor Fusion - The Kalman Filter
14 Oct 03
16 Oct 03

28-30 Oct
On Travel (NO CLASS)


23 Oct - 6 Nov
The Extended Kalman Filter
23 Oct 03
06 Nov 03
Kalman Filter Simulator
11-13 Nov
Particle Filters & Monte Carlo Localization (MCL)
11 Nov 03
13 Nov 03
MCL Simulator
18-25 Nov
Paper presentations
  • 18 Nov:  Raim & Derenick
  • 20 Nov:  Luksenberg & Maurizio
  • 25 Nov:  Erekson & Ormsby


27 Nov
Thanksgiving (NO CLASS)


30 Nov - 5 Dec
TBD
02 Dec 03
04 Dec 03