Skip navigation
Skip navigation

Feature reinforcement learning using looping suffix trees

Daswani, Mayank; Sunehag, Peter; Hutter, Marcus

Description

There has recently been much interest in history-based methods using suffix trees to solve POMDPs. However, these suffix trees cannot efficiently represent environments that have long-term dependencies. We extend the recently introduced CTΦMDP algorithm to the space of looping suffix trees which have previously only been used in solving deterministic POMDPs. The resulting algorithm replicates results from CTΦMDP for environments with short term dependencies, while it outperforms LSTM-based...[Show more]

CollectionsANU Research Publications
Date published: 2012-12
Type: Conference paper
URI: http://hdl.handle.net/1885/14724

Download

File Description SizeFormat Image
Daswani et al Feature Reinforcement Learning 2012.pdf301.79 kBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator