Scaling Reinforcement Learning Toward RoboCup Soccer
Abstract
RoboCup simulated soccer presents many challenges to reinforcement learning methods, including a large state space, hidden and uncertain state, multiple agents, and long and variable delays in the eects of actions. We describe our application of episodic SMDP Sarsa() with linear tile-coding function approximation and variable to learning higherlevel decisions in a keepaway subtask of RoboCup soccer. In keepaway, one team, \\the keepers," tries to keep control of the ball for as long as possible despite the eorts of \\the takers." The keepers learn individually when to hold the ball and when to pass to a teammate, while the takers learn when to charge the ball-holder and when to cover possible passing lanes. Our agents learned policies that signi cantly out-performed a range of benchmark policies. We demonstrate the generality of our approach by applying it to a number of task variations including dierent eld sizes and dierent numbers of players on each team.
Cite
Text
Stone and Sutton. "Scaling Reinforcement Learning Toward RoboCup Soccer." International Conference on Machine Learning, 2001.Markdown
[Stone and Sutton. "Scaling Reinforcement Learning Toward RoboCup Soccer." International Conference on Machine Learning, 2001.](https://mlanthology.org/icml/2001/stone2001icml-scaling/)BibTeX
@inproceedings{stone2001icml-scaling,
title = {{Scaling Reinforcement Learning Toward RoboCup Soccer}},
author = {Stone, Peter and Sutton, Richard S.},
booktitle = {International Conference on Machine Learning},
year = {2001},
pages = {537-544},
url = {https://mlanthology.org/icml/2001/stone2001icml-scaling/}
}