Difference between revisions of "ME CS 132 2017"
From Robotics
(→Course Text and References) |
m |
||
| (18 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | This is the homepage for ME/CS 132(a,b) ( | + | This is the homepage for ME/CS 132(a,b) (Advanced Robotics: Navigation and Vision) for Winter/Spring 2017. |
__NOTOC__ | __NOTOC__ | ||
== Course Staff, Hours, Location == | == Course Staff, Hours, Location == | ||
| Line 40: | Line 40: | ||
== Announcements For ME/CS 132(a.b) == | == Announcements For ME/CS 132(a.b) == | ||
| − | * ''' | + | * '''01/04/17:''' The permanent lecture hours and location will be determined at the course organizational meeting. |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
== Course Text and References == | == Course Text and References == | ||
| − | The main text for the first half of the course is: | + | 1) The main text for the first half of the course is: |
* ''Planning Algorithms'' by Steve LaValle (UIUC). | * ''Planning Algorithms'' by Steve LaValle (UIUC). | ||
| − | You can buy this book | + | You can buy this book [http://www.amazon.com/Planning-Algorithms-Steven-M-LaValle/dp/0521862051/sr=1-1/qid=1167872270/ref=sr_1_1/105-3129515-7885245?ie=UTF8&s=books on-line at Amazon]. A [http://msl.cs.uiuc.edu/planning/ preprint of the text ] is available freely on-line, and is adequate for all activities of this course. This book provides a comprehensive summary of classical motion planning theory and algorithms. Many of the more advanced topics (e.g., information-space approaches to planning, and evasion-pursuit algorithms) are beyond the immediate scope of this class, but they should be accessible to interested students. |
| − | + | ||
| − | The following book is recommended (but not required): | + | 2) The following book is recommended (but not required): |
* ''Principles of Robot Motion: Theory, Algorithms, and Implementations,'' by Howie Choset, Kevin Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia Kavraki, and Sebastian Thrun. | * ''Principles of Robot Motion: Theory, Algorithms, and Implementations,'' by Howie Choset, Kevin Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia Kavraki, and Sebastian Thrun. | ||
| − | This text is | + | This text is [http://www.amazon.com/Principles-Robot-Motion-Implementations-Intelligent/dp/0262033275/sr=1-2/qid=1167872622/ref=sr_1_2/105-3129515-7885245?ie=UTF8&s=books available at Amazon ] |
in both new and used versions. | in both new and used versions. | ||
| − | Interested students may wish to also consult the following classic (but now out-of-print) text on motion planning: ''Robot Motion Planning'' by J.C. Latombe. A copy is available in the Caltech library. | + | 3) Interested students may wish to also consult the following classic (but now out-of-print) text on motion planning: ''Robot Motion Planning'' by J.C. Latombe. A copy is available in the Caltech library. |
| − | + | == Course Mechanics, Grading, and Collaboration Policy == | |
| − | + | ||
| − | + | ||
| − | == | + | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
=== Grading === | === Grading === | ||
| Line 88: | Line 74: | ||
your own understanding of the subject matter. Computer code and graphical plots are considered part of your solution, and therefore should be done individually (you can share ideas, but not code). No collaboration is allowed on the examinations. | your own understanding of the subject matter. Computer code and graphical plots are considered part of your solution, and therefore should be done individually (you can share ideas, but not code). No collaboration is allowed on the examinations. | ||
| − | == Course Schedule for ME/CS 132(a) == | + | == Course Lecture Schedule for ME/CS 132(a) == |
{| border=1 width=100% | {| border=1 width=100% | ||
| Line 95: | Line 81: | ||
|- | |- | ||
| − | | align=center rowspan= | + | | align=center rowspan=3 | 1 |
| colspan=5| | | colspan=5| | ||
=====Introduction and Review of Rigid Body Kinematics ===== | =====Introduction and Review of Rigid Body Kinematics ===== | ||
|- | |- | ||
| − | | 4 Jan ( | + | | 4 Jan (Wed.) |
| − | | Class Overview | + | | Class Overview & Mechanics <br> The basic motion planning problem |
| − | | [[ME_CS_132_CourseOverview.pdf | Course Overview]] | + | | [[Media:ME_CS_132_CourseOverview.pdf | Course Overview]] |
| − | | | + | | [http://msl.cs.uiuc.edu/planning/ch1.pdf Chapter 1 of Lavalle] |
| − | | rowspan= | + | | rowspan=2 align=center | -No Homework- |
|- | |- | ||
| − | | 6 Jan ( | + | | 6 Jan (Fri.) |
| − | | | + | | Review of planar Rigid Body Kinematics |
| − | | [http://www.cds.caltech.edu/~murray/mlswiki/index.php/Main_Page MLS Ch 2.1], Pages 19-23 | + | | Lavalle Chapter 3.2.2 (pages 94-97) |
| − | + | | [http://www.cds.caltech.edu/~murray/mlswiki/index.php/Main_Page MLS Ch 2.1], Pages 19-23 <br> Lavalle Chapter 3.1 | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
|- | |- | ||
| Line 120: | Line 101: | ||
| colspan=5 | | | colspan=5 | | ||
| − | ===== | + | ===== Intro to C-space and the Basic Motion Planning Problem ===== |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | Intro to | + | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
|- | |- | ||
| − | | | + | | 9 Jan (M) |
| − | | | + | | Configuration Space (C-space) |
| − | | [ | + | | Lavalle 4.2.1 <br> [[Media: CObstacleNotes.pdf | Notes on C-obstacles]] |
| -N/A- | | -N/A- | ||
| − | | rowspan=3 align=center | [ | + | | rowspan=3 align=center | [[Media:ME_CS_132_2016_Homework1.pdf | Homework 1]], <br> [[Media:ME_CS_132_2016_Solution1.pdf | Solution 1]] |
|- | |- | ||
| − | | | + | | 11 Jan (W) |
| − | | | + | | Configuration-Space Obstacles |
| − | | [ | + | | Lavalle Chapter 4.3 <br> [[Media:StarAlgorithm.pdf | The Star Algorithm]] |
| -N/A- | | -N/A- | ||
|- | |- | ||
| − | | | + | | 13 Jan (F) |
| − | | | + | | Computing C-space obstacles |
| − | | [ | + | | [[Media:CObstacle_Param.pdf | Notes on Parametrized C-obstacles]] |
| -N/A- | | -N/A- | ||
|} | |} | ||
Revision as of 21:03, 1 January 2017
This is the homepage for ME/CS 132(a,b) (Advanced Robotics: Navigation and Vision) for Winter/Spring 2017.
Course Staff, Hours, Location
| Position | Name | Office | Office Hours (changing weekly) | Phone | |
| Instructor | Joel Burdick | 245 Gates-Thomas | send mail for an appointment | jwb at robotics dot caltech dot edu | 626-395-4139 |
| Teach Asst. | TBD | 205 Gates-Thomas | TBD | 626-395-???? | |
| Teach Asst. | TBD | 205 Gates-Thomas | TBD | 626-395-???? | |
| Administrative | Sonya Lincoln | 250 Gates-Thomas | 7:30am-noon; 1:00pm-4:30pm | lincolns at caltech dot edu | 626-395-3385 |
- Lecture Schedule: To be determine at the Organizational Meeting
Announcements For ME/CS 132(a.b)
- 01/04/17: The permanent lecture hours and location will be determined at the course organizational meeting.
Course Text and References
1) The main text for the first half of the course is:
- Planning Algorithms by Steve LaValle (UIUC).
You can buy this book on-line at Amazon. A preprint of the text is available freely on-line, and is adequate for all activities of this course. This book provides a comprehensive summary of classical motion planning theory and algorithms. Many of the more advanced topics (e.g., information-space approaches to planning, and evasion-pursuit algorithms) are beyond the immediate scope of this class, but they should be accessible to interested students.
2) The following book is recommended (but not required):
- Principles of Robot Motion: Theory, Algorithms, and Implementations, by Howie Choset, Kevin Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia Kavraki, and Sebastian Thrun.
This text is available at Amazon in both new and used versions.
3) Interested students may wish to also consult the following classic (but now out-of-print) text on motion planning: Robot Motion Planning by J.C. Latombe. A copy is available in the Caltech library.
Course Mechanics, Grading, and Collaboration Policy
Grading
The final grade will be based on homework sets, and a final exam or final project:
- Homework (70%): Homework sets will be handed out every 7-10 days, and are due at 5 pm on the due date (which will always coincide with a class meeting). Homeworks can be dropped off in class, or deposited in the box outside of 245 Gates-Thomas. Some homeworks will require computation. MATLAB or Mathematica should be sufficient to solve every homework posed in this course, though students can choose their favorite programming language. Code is considered part of your solution and should be included in with the problem set when appropriate.
- Final exam/project (30%): Students have the option to take a final exam (a limited time take-home format exam which is open book, open note, and computer allowed) or select a final project. The final project must incorporate some aspect of the course, and the topic and scope my be approved by the course instructor. The final exam will due at 5:00 pm the last day of finals. The final project is similarly due at 5:00 pm on the last day of finals.
- Late Homework Policy: Students may automatically take a 2-day extension on two homeworks during each quarter.
Collaboration Policy
Collaboration on homework assignments is encouraged. You may consult outside reference materials, other students, the TA, or the instructor, but you must cite any use of material from outside references. All solutions that are handed in should be written up individually and should reflect your own understanding of the subject matter. Computer code and graphical plots are considered part of your solution, and therefore should be done individually (you can share ideas, but not code). No collaboration is allowed on the examinations.
Course Lecture Schedule for ME/CS 132(a)
| Week | Date | Topic | Reading | Optional Reading | Homework |
| 1 |
Introduction and Review of Rigid Body Kinematics | ||||
| 4 Jan (Wed.) | Class Overview & Mechanics The basic motion planning problem |
Course Overview | Chapter 1 of Lavalle | -No Homework- | |
| 6 Jan (Fri.) | Review of planar Rigid Body Kinematics | Lavalle Chapter 3.2.2 (pages 94-97) | MLS Ch 2.1, Pages 19-23 Lavalle Chapter 3.1 | ||
| 2 |
Intro to C-space and the Basic Motion Planning Problem | ||||
| 9 Jan (M) | Configuration Space (C-space) | Lavalle 4.2.1 Notes on C-obstacles |
-N/A- | Homework 1, Solution 1 | |
| 11 Jan (W) | Configuration-Space Obstacles | Lavalle Chapter 4.3 The Star Algorithm |
-N/A- | ||
| 13 Jan (F) | Computing C-space obstacles | Notes on Parametrized C-obstacles | -N/A- | ||
