Symbolic Dynamic Programming

Studienarbeiten

• Themenvorschläge für Studien- und Abschlussarbeiten
• Abgeschlossene Arbeiten
  • Algebra und Diskrete Strukturen
  • Automatentheorie
  • Computational Logic
  • Knowledge-aware Artificial Intelligence
  • Logische Programmierung und Argumentation
  • Verifikation und formale quantitative Analyse
  • Wissensbasierte Systeme
• Laufende Studienarbeiten

Toggle side column

Symbolic Dynamic Programming

Studienarbeit von Olga Skvortsova

•   Betreuer -
•   Wissensverarbeitung
•   Beginn 21. November 2002
•   Download

A symbolic dynamic programming approach for solving first-order Markov

decision processes within the situation calculus is presented. As an alternative specification language for dynamic worlds the fluent calculus is chosen and the fluent calculus formalization of the symbolic dynamic programming approach is provided. The major constructs of Markov decision processes such as the optimal value function and the policy are logically represented. The technique produces a set of first-order formulae that minimally partitions the state space. Consequently, the symbolic dynamic programming algorithm presented here does not require neither state nor action space enumeration, thereby solving the drawback of classical dynamic programming methods.