back to search

Approximate Dynamic Programming and Reinforcement Learning

EI7649Elective Modules6 ECTSEnglishwinter semesterDepartment Computer Engineering

In 1 fellow students' timetables

AI-edited module sheet. Based on the TUMonline module description, edited for readability.Original in TUMonline

What it is about

You will learn methods of Approximate Dynamic Programming (ADP) and Reinforcement Learning (RL) to solve sequential decision problems. In the end you will be able to describe fundamental models and algorithms, follow derivations, and implement simple ADP/RL methods and apply them to simple tasks (e.g., robotic).

What you will be able to do

  • Describe classical scenarios of sequential decision problems
  • Explain basic models of ADP/RL
  • Derive ADP-/RL- algorithms from the course
  • Characterize convergence properties of the algorithms studied
  • Theoretically and practically compare performance differences of the algorithms
  • Select suitable algorithms for concrete applications
  • Construct and implement ADP/RL algorithms

What the module consists of

  • VorlesungDelivery of theoretical foundations and models
  • ÜbungPractice and deepening of concepts; covers sometimes new topics
  • TutoriumDiscussion of exercises and programming tasks; support in their solution

Teaching method

  • Frontalunterricht (Tafel, Beamer)Introduction to theory and models
  • Gruppen- und EinzelbesprechungenDeveloping definitions and concepts using simple examples
  • Übungs- und ProgrammieraufgabenPractice-oriented application of lecture content

Dates

Lecture with exerciseApproximate Dynamic Programming and Reinforcement Learning

From the current semester, not binding.

Module ratings

No ratings for this module yet.

Rate this module

Only fill in the categories you can judge – for each one, either stars and text together or nothing at all.

Lecture
Tutorial
Exam

Reviews are automatically checked before they are published.

Official page in TUMonline · Details are not binding.