UCSD ECE276B: Planning & Learning in Robotics (Spring 2019)

Date	Lecture	Materials	Assignments
Apr 02	Markov Chains	Grinstead-Snell-Ch11
Apr 04	Markov Decision Processes	Bertsekas 1.1-1.2
Apr 09	Dynamic Programming	Bertsekas 1.3-1.4
Apr 11	Deterministic Shortest Path	Bertsekas 2.1-2.3
Apr 16	Configuration Space	LaValle 4.3, 6.2-6.3	HW1, HW1 Solutions
Apr 18	Search-based Planning	LaValle 2.1-2.3, JPS
Apr 23	Catch-up
Apr 25	Anytime Incremental Search	RTAA, ARA, AD*, Journal Paper
Apr 30	Sampling-based Planning	LaValle 5.5-5.6	HW2, HW2 Solutions
May 02	Stochastic Shortest Path	Bertsekas 7.1-7.3
May 07	Bellman Equations I	Sutton-Barto 4.1-4.4
May 09	Bellman Equations II	Sutton-Barto 4.5-4.8
May 14	Catch-up
May 16	Model-free Prediction	Sutton-Barto 6.1-6.3
May 21	Model-free Control	Sutton-Barto 6.4-6.7	HW3
May 23	Value Function Approximation	Sutton-Barto Ch.9
May 28	Continuous-time Optimal Control	Bertsekas 3.1-3.2
May 30	Pontryagin's Minimum Principle	Bertsekas 3.3-3.4, Liberzon Ch. 2.4 and Ch. 4
Jun 04	Linear Quadratic Control	Bertsekas 4.1
Jun 06	Review		Final Exam Practice Problems Final Exam Practice Solutions
Jun 13	Final Exam