|
UCSD ECE276B: Planning & Learning in Robotics (Spring 2020)
| Date | Lecture | Materials | Assignments |
| Mar 31 | Introduction, Markov Chains | Grinstead-Snell-Ch11 | |
| Apr 02 | Markov Decision Processes | Bertsekas 1.1-1.2 | |
| Apr 07 | Dynamic Programming | Bertsekas 1.3-1.4 | HW1, PR1 |
| Apr 09 | Deterministic Shortest Path | Bertsekas 2.1-2.3 | HW1 Solutions |
| Apr 14 | Configuration Space | LaValle 4.3, 6.2-6.3 | |
| Apr 16 | Catch-up | | |
| Apr 21 | Search-based Planning | LaValle 2.1-2.3, JPS | |
| Apr 23 | Catch-up | | HW2, PR2 |
| Apr 28 | Anytime Incremental Search | RTAA*, ARA*, AD*, Journal Paper | HW2 Solutions |
| Apr 30 | Sampling-based Planning | LaValle 5.5-5.6 | |
| May 05 | Stochastic Shortest Path | Bertsekas 7.1-7.3 | |
| May 07 | Bellman Equations I | Sutton-Barto 4.1-4.4 | |
| May 12 | Bellman Equations II | Sutton-Barto 4.5-4.8 | HW3, PR3 |
| May 14 | Catch-up | | HW3 Solutions |
| May 19 | Model-free Prediction | Sutton-Barto 6.1-6.3 | |
| May 21 | Model-free Control | Sutton-Barto 6.4-6.7 | |
| May 26 | Value Function Approximation | Sutton-Barto Ch.9 | PR4 |
| May 28 | Continuous-time Optimal Control | Bertsekas 3.1-3.2 | |
| Jun 02 | Pontryagin's Minimum Principle | Bertsekas 3.3-3.4, Liberzon Ch. 2.4 and Ch. 4 | HW4 |
| Jun 04 | Linear Quadratic Control | Bertsekas 4.1 |
|
|