Bellman goes relational

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 m is developed in which abstraction (over states and actions) plays a major role. This framework provides new insights into relational reinforcement learning. Convergence results as well as experiments are presented.

• Type: Conference
• Year: 2004
• Where: ICML
• Authors: Kristian Kersting, Martijn Van Otterlo, Luc De Raedt
• Keywords: ICML 2004, Machine Learning, Operator Called Rebel, Relational Domains, Relational Reinforcement