Bellman goes Relational
Kristian Kersting - University of Freiburg Martijn van Otterlo - University of Twente Luc De Raedt - University of Freiburg
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming language to compactly represent Markov decision processes over relational domains. Using ReBel, a novel value iteration algorithm is developed in which abstraction (over states and actions) plays a major role. This frameworkprovides new insights into relational reinforcement learning. Convergence results as well as experiments are presented.