|Office: 3217 EECS|
|Office Hours: By appointment|
|Email: berenson [at] eecs.umich.edu|
Overview: Motion planning is the study of algorithms that reason about the movement of physical or virtual entities. These algorithms can be used to generate sequences of motions for many kinds of robots, robot teams, animated characters, and even molecules. This course will cover the major topics of motion planning including (but not limited to) planning for manipulation with robot arms and hands, mobile robot path planning with non-holonomic constraints, multi-robot path planning, high-dimensional sampling-based planning, and planning on constraint manifolds. Students will implement motion planning algorithms in open-source frameworks, read recent literature in the field, and complete a project that draws on the course material.Prerequisites: Undergraduate linear algebra (e.g. MATH 214) and significant programming experience (e.g. EECS 281).