ME/CS 132b, Spring 2015
Advanced Robotics: Navigation and Vision
Lectures: Tue/Thu, 1:00-2:25pm, 24 BBB
Course Piazza Site: http://piazza.com/caltech/spring2015/mecs132b/home
- The first lecture on 3/31 at 1:00pm in Room 24 BBB with a Course Overview.
There are no formal prerequisites for the course, and some of the required background material will be reviewed during the first weeks of lecture. The instructional content of ME/CS 132(b) is largely independent of the material in ME/CS 132(a), but students are expected to be able to use the experimental lab equipment introduced in the lab at the end of ME/CS 132(a), and are expected to be able to apply the sensor processing and mapping techniques learned in the first quarter. The greater emphasis on a final project in this quarter will require a good comfort level with computer programming in C, C++ or Python.
ME/CS 132(b) is primarily a project-based course, and sixty percent (60%) of the grade will be based on a final project which is due during finals period. The final project can be done in teams with the instructor's approval. The grade will also be based on 2 homeworks (20% of total grade) and 2 lab assignments (20% of total grade).
- Homework: Homework is usually due ten days after it is assigned, and is intended to test your comprehension of material covered during lectures. Instructions for submission will be provided with each homework.
- Labs: Students will form groups of 2-3 people and perform lab experiments together. The lab will consist of implementing and testing basic algorithms on a mobile robot, and demonstrating the result, as well as submitting a copy of the code underlying the lab demonstration. Lab 1 is intended to review control of the differential drive robots in the lab, and introduce some additional motion planning challenges that were abstracted for you in ME/CS 132(a). Lab 2 will occur after most of the course material has been covered in lecture, and is intended to help you prepare for the final project. Its timing is also intended to spark ideas for the final project proposal, so students are advised to use it as an exploratory device rather than stick to the bare bones of the assignment.
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. All our activities in this course will be governed by the Caltech Honor Code.
Students are highly encouraged to post questions and answers on the course Piazza site.
- The site will be monitored on business days by the course staff. Students can expect an answer within one business day.
- Students are expected to communicate in a professional manner.
There is only one required textbook, which is freely available on the web:
- Planning Algorithms by Steven M. LaValle (Cambridge Univ. Press, New York, 2006).
- The book website is here; If you plan to continue work in the field of robotics, then you should consider buying the text. A copy has been placed on reserve at the library.
The following textbook used last quarter will continue to be a useful optional reference:
- Probabilistic Robotics by Sebastian Thrun, Wolfram Burgard, and Dieter Fox, MIT Press, 2005.
This book is most likely to come in handy for some choices of final project. If you have bought the above book, then hold on to it for this quarter. If you haven't yet got the book, it is not necessary to purchase it, as there is very little specific information from that text that is needed this quarter. In any case, a copy has been placed on reserve at the library.
|1||31 Mar (Tu)||Course Overview, Introduction to Motion Planning||LaValle Chapter 1||-N/A-|
|2 Apr (Th)||Reference Frames, Configuration Spaces and Kinematics||LaValle 3.2, 3.3, 4.2, 4.3|| Lab 1 |
|2||7 Apr (Tu)||No class -- Lab Week||-N/A-|
|9 Apr (Th)||Potential Functions and Navigation Functions||LaValle Chapter 8|| Homework 1 |
|3||14 Apr (Tu)||Cell Decompositions and Roadmaps||LaValle Chapter 6||-N/A-|
|16 Apr (Th)||Voronoi Decomposition and Visibility Graphs||-N/A-|
|4||21 Apr (Tu)||Graph Search||LaValle Chapter 2||-N/A-|
|23 Apr (Th)||D* Algorithm, Intro to Sampling-Based Planners|| Homework 2 |
|5||28 Apr (Tu)||Sampling-Based Methods: PRM, RRT and variants||LaValle Chapter 5||-N/A-|
|30 Apr (Th)||Bug Algorithms|| Lab 2 |
|6||5 May (Tu)||No class - Lab Week||-N/A-|
|7 May (Th)||No class - Lab Week|| Project Proposal |
|7||12 May (Tu)||No class - Lab Week||-N/A-|
|14 May (Th)||No class - Lab Week||-N/A-|
|8||19 May (Tu)||Multi-Robot Motion Planning (tentative), Project team meetings||-N/A-|
|21 May (Th)||Special Topics (TBD)||-N/A-|
|9||26 May (Tu)||No class - Project Lab Week||-N/A-|
|28 May (Th)||No class - Project Lab Week||-N/A-|
- Lab 1
- Subject: controlling a differential drive robot
- Due Date: Fri, April 10, 2013 by 5pm.
- Homework 1
- Subject: configuration spaces and navigation functions
- Due Date: Fri, April 17, 2015 by 5pm.
- Homework 2
- Subject: 2D roadmaps
- Due Date: Fri, May 1, 2015 by 5pm.
- Lab 2
- Subject: sampling-based methods, sensor-based planning
- Due Date: Fri, May 15, 2013 by 5pm.
Final Project Information
- Final Project
- Pre-proposal Due Date: Fri, May 8, 2015 by 5pm (in electronic copy) to the instructor
- Project Due Date: Wed, June 10, 2015 by 5pm (Sat, June 6 by 5pm for seniors)