Difference between revisions of "ME/CS 132a, Winter 2011"
m (→Grading) 
(→Course Schedule) 

Line 36:  Line 36:  
* Steven M. LaValle, [http://planning.cs.uiuc.edu/ ''Planning Algorithms''], Cambridge University Press, 2006.  * Steven M. LaValle, [http://planning.cs.uiuc.edu/ ''Planning Algorithms''], Cambridge University Press, 2006.  
−  ==  +  == Lecture Notes == 
TBA  TBA  
+  
+  == Homework ==  
+  TBA  
+  
__NOTOC__  __NOTOC__ 
Revision as of 22:09, 3 January 2011
Instructors

Teaching Assistants (me132tas@caltech.edu)
Course Mailing List: me132students@caltech.edu (sign up) 
Announcements
There are currently no announcements.
Course Information
Prerequisites
The formal prerequisites for the course are ME 115 ab (Introduction to Kinematics and Robotics). Students are expected to have basic understanding of linear algebra, probability and statistics. We will review some of the required background materials during the first week of lectures. Besides these, students should have some prior programming experience and know at least one of the following languages: C, Python, or MATLAB. Depending on the background of the class, we will hold tutorials for some of the programming languages to help students get started.
Grading
There are no midterm/final exams for this course. The grade will be based on weekly homework (60%) and two weeklong labs (20% each). Late homework will not be accepted without a letter from the health center or the Dean. However, you are granted a grace period of five late days throughout the entire term for weekly homework. Please indicate the number of late days you have used on the homework. No grace period is allowed for weeklong labs.
 Homework: Homework is usually due in one week after it is assigned. You can choose to turn it in by putting a hard copy at Shuo Han's mailbox at Steele or sending an electronic copy to Andrea Censi (andrea@cds.caltech.edu).
 Labs: Students will form groups of 23 people and perform lab experiments together. Detail of this will be announced later in the course.
Collaboration Policy
Students are encouraged to discuss and collaborate with others on the homework. However, you should write your own solution to show your own understanding of the material. You should not copy other people's solution or code as part of your solution. You are allowed to consult the instructors, the TAs, and/or other students. Outside reference materials can be used except for solutions from prior years or similar courses taught at other universities. Outside materials must be cited if used.
Course Texts
There are two required textbooks, both of which are freely available online:
 Richard Szeliski, Computer Vision: Algorithms and Applications, Springer, 2010.
 Steven M. LaValle, Planning Algorithms, Cambridge University Press, 2006.
Lecture Notes
TBA
Homework
TBA