Dynamic Programming
The course is given spring/summer 2000.Schedule
| Date | Chapter | Exercises | Responsible |
|---|---|---|---|
| 000426 | 1. The dynamic programming algorithm | 1.1,1.3,1.5,1.6,1.15 | Mikael |
| 000503 | 2. Deterministic systems and the shortest path problem | 2.1, 2.4, 2.10, 2.12 | Fredrik T |
| 000510 | 3. Deterministic continuous-time optimal control | 3.2, 3.3, 3.7, 3.8 | Rickard |
| 000517 | 4. Problems with perfect state information | 4.15, 4.18, 4.21 | Anders Hultgren |
| 000524 | 5. Problems with imperfect state information | 5.3, 5.6, 5.7, 5.10 | Lennart |
| 000531 | 6. Suboptimal and adaptive control | . | Johan |
| 000605 | 7. Introduction to infinite horizon problems | Ex 2.2, 7.1, 7.3, 7.4, 7.12 | Torkel |
| 000614 | Discussion of the exercises from Chapter 7. | . | . |
Literature
D.P. Bertsekas "Dynamic Programming and optimal control", volume 1
Informationsansvarig: Torkel Glad
Senast uppdaterad: 2024-08-20
LiU Homepage
