Optimal Control (TSRT08)
Homework assignments
Homework 1: Discrete dynamic programming. Deadline Nov 24 (23:59), 2023.
Homework 2: Reinforcement learning (Exercises 11.9a and 11.10 a in the book). Deadline Dec 11 (23:59), 2023.
Homework 3 and files: Implementation of algorithms. Deadline Jan 3 (23:59), 2024.
Solutions should be handed in to the teaching assistant before each corresponding deadline. The solutions should be sent as a pdf to seyyed.reza.jafari@liu.se.
The exercises are solved in groups of 2 students. If you have not have someone to team up with, send an e-mail to seyyed.reza.jafari@liu.se.
Discussions between the groups are allowed, but solutions, calculations, and code may not be copied.
Both students in the group shall be able to explain the solution they submit.
All students shall be prepared to give a short oral review of the solution with the teaching assistant (individually, not necessarily group-wise).
The grading is either, pass, fail, or resubmit. In case of resubmit a corrected version of the homework exercise should be submitted within a week. In case of yet another resubmit grading, the next submission date is at the time of when the next examination of the course takes place.
Requirements on passing each homework assignment:
HW 1 Correct solution to 2 out of 3 sub-exercises 2 Correct solution to 1 out of 2 sub-exercises 3 Solution to all of the sub-exercises