A Boolean Task Algebra for Reinforcement Learning

Understand

The ability to compose learned skills to solve new tasks is an important property of lifelong-learning agents.

• In this work, we formalise the logical composition of tasks as a Boolean algebra.
• This allows us to formulate new tasks in terms of the negation, disjunction and conjunction of a set of base tasks.
• We then show that by learning goal-oriented value functions and restricting the transition dynamics of the tasks, an agent can solve these new tasks with no further learning.