Page Content
Conference Publications
| Citation key | Boehmer2013b |
|---|---|
| Author | Böhmer, W. and Obermayer, K. |
| Year | 2013 |
| Journal | ICRA Workshop on Autonomous Learning |
| Abstract | Autonomous agents do not always have access to the amount of samples machine learning methods require. Structural assumptions like factored MDP allow to generalize experiences beyond traditional metrics to entirely new situations. This paper introduces a novel framework to exploit such knowledge for approximated policy iteration. At the heart of the framework a novel factored approximate planning algorithm is derived. The algorithm requires no real observations and optimizes control for given linear reward and transition models. It is empirically compared with least squares policy iteration in a continuous navigation task. Computational leverage in constructing the linear models without observing the entire state space and in representation of the solution are discussed as well. |
| Bibtex Type of Publication | Selected:reinforcement |
Back [3]
3-ALW/paper_1.pdf
ine_learning/conference_publications/parameter/en/minhi
lfe/?no_cache=1&tx_sibibtex_pi1%5Bdownload_bibtex_u
id%5D=1166510&tx_sibibtex_pi1%5Bcontentelement%5D=t
t_content%3A310690
ine_learning/conference_publications/parameter/en/minhi
lfe/
Zusatzinformationen / Extras
Quick Access:
Schnellnavigation zur Seite über Nummerneingabe
Auxiliary Functions
Copyright TU Berlin 2008