Hide/Show Apps

Automatic landmark discovery for learning agents under partial observability

2019-08-02
DEMİR, ALPER
Cilden, Erkin
Polat, Faruk
In the reinforcement learning context, a landmark is a compact information which uniquely couples a state, for problems with hidden states. Landmarks are shown to support finding good memoryless policies for Partially Observable Markov Decision Processes (POMDP) which contain at least one landmark. SarsaLandmark, as an adaptation of Sarsa(lambda), is known to promise a better learning performance with the assumption that all landmarks of the problem are known in advance.