Active Exploration for Learning Symbolic Representations [article]

Garrett Andersen, George Konidaris
2017 arXiv   pre-print
We introduce an online active exploration algorithm for data-efficiently learning an abstract symbolic model of an environment. Our algorithm is divided into two parts: the first part quickly generates an intermediate Bayesian symbolic model from the data that the agent has collected so far, which the agent can then use along with the second part to guide its future exploration towards regions of the state space that the model is uncertain about. We show that our algorithm outperforms random
more » ... greedy exploration policies on two different computer game domains. The first domain is an Asteroids-inspired game with complex dynamics but basic logical structure. The second is the Treasure Game, with simpler dynamics but more complex logical structure.
arXiv:1709.01490v2 fatcat:2ehvqcf35vg7fnm4r7y33xkqjm