Daswani, Mayank; Sunehag, Peter; Hutter, Marcus
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]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.