most citedOptimistic Initialization and Greediness Lead to Polynomial Time Learning in Factored MDPs - Extended Version

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing cs.LGShow all

1 paper · 1 filter

cs.LG2006

Low-complexity modular policies: learning to play Pac-Man and a new framework beyond MDPs

Istvan Szita, Andras Lorincz

In this paper we propose a method that learns to play Pac-Man. We define a set of high-level observation and action modules. Actions are temporally extended, and multiple action mo…