Reinforcement Learning (RL) suffers from several difficulties when applied to domains with no obvious goal-state defined; this leads to inefficiency in RL algorithms. We consider a solution within the context of a widely-used testbed for RL: RoboCup Keepaway. We introduce Argumentation-Based RL (ABRL), using methods from argumentation theory to integrate domain knowledge, represented by arguments, into the SMDP algorithm for RL by using potential-based reward shaping. Empirical results show that ABRL outperforms the original SMDP algorithm, for this game, by improving convergence speed and optimality.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 email@example.com
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 firstname.lastname@example.org