ACTION DISCOVERY FOR SINGLE AND MULTI-AGENT REINFORCEMENT LEARNING
Bikramjit Banerjee () and
Landon Kraemer ()
Additional contact information Bikramjit Banerjee: School of Computing, The University of Southern Mississippi, Hattiesburg, MS 39406-0001, USA
Landon Kraemer: School of Computing, The University of Southern Mississippi, Hattiesburg, MS 39406-0001, USA
The design of reinforcement learning solutions to many problems artificially constrain the action set available to an agent, in order to limit the exploration/sample complexity. While exploring, if an agent can discover new actions that can break through the constraints of its basic/atomic action set, then the quality of the learned decision policy could improve. On the flipside, considering all possible non-atomic actions might explode the exploration complexity. We present a novel heuristic solution to this dilemma, and empirically evaluate it in grid navigation tasks. In particular, we show that both the solution quality and the sample complexity improve significantly when basic reinforcement learning is coupled with action discovery. Our approach relies on reducing the number of decision points, which is particularly suited for multiagent coordination learning, since agents tend to learn more easily with fewer coordination problems (CPs). To demonstrate this we extend action discovery to multi-agent reinforcement learning. We show that Joint Action Learners (JALs) indeed learn coordination policies of higher quality with lower sample complexity when coupled with action discovery, in a multi-agent box-pushing task.