This page will contain lecture slides, notes, and videos for the course.

Tentative Schedule:

Lecture Slides:

Supplementary readings:

  • Linear Algebra and Matrix Calculus
  • Convex Optimization
  • Notes on branch and bound methods (note that these use a bit different notation than the class slides, but the fundamental approaches are the same)
  • Presentation of machine learning is quite different than in the textbook. Sources that are closer to the presentation here are "Pattern Recognition and Machine Learning" by Christopher M. Bishop, Chapters 1.1, 3, 4. This material is optional, and the slides and lectures should contain all required material for class and homeworks.
  • A good introduction to RRTs is the original page that proposed them, available here. The one difference between this presentation and that from class is that the algorithm there has a SELECT_INPUT method, which finds an input that moves the x_near toward x_new, and then a NEW_STATE routine tha executes this control for some time Delta t. These together are equivalent to the Grow_Towards() function in the slides.
  • The material covered in the game theory lecture spans (a very small subset of) Chapters 3 and 4 in this book.

Lecture Videos:

x