Team-partitioned, opaque-transition reinforcement learning
Abstract
We present a novel multi-agent learning paradigm called team-partitioned, opaque-transition reinforcement learning (TPOT-RL). TPOT-RL introduces the use of action-dependent features to generalize the state space. In our work, we use a learned action-dependent feature space to aid higher-level reinforcement learning. TPOT-RL is an effective technique to allow a team of agents to learn to cooperate towards the achievement of a specific goal. It is an adaptation of traditional RL methods that is applicable in complex, non-Markovian, multi-agent domains with large state spaces and limited training opportunities. TPOT-RL is fully implemented and has been tested in the robotic soccer domain, a complex, multi-agent framework. This paper presents the algorithmic details of TPOT-RL as well as empirical results demonstrating the effectiveness of the developed multi-agent learning approach with learned features.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
TPOT-RL, proposed by Stone and Veloso for RoboCup-1998, is the first fully collaborative MARL technique to be applied to packet routing.
“Team-partitioned opaque-transition reinforcement learning (TPOT-RL), proposed by Stone and Veloso for the RoboCup-1998 (Robot Soccer World Cup II) [425], is the first fully collaborative MARL technique to be applied to packet routing [424].”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [425]
This form of MARL is soft in that it is easy to implement and has low communication and computational complexity as opposed to the general more complex form of MARL.
“This form of MARL is soft in that it is easy to implement and has low communication and computational complexity as opposed to the general more complex form of MARL like in [124, 425].”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [425]
The citation lists haven’t been fetched yet
References 23 · Cited by 114
- Authors
- Stone, P., & Veloso, M.
- Affiliations
- Carnegie Mellon University (US)
- Venue
- Proceedings of the third annual conference on Autonomous Agents
- Publisher
- ACM
- Published
- 1999-04
- Pages
- 206-212
- ISSN
- 1548-8403 (ISSN-L)
- OpenAlex
- W2130985368
- Cited by
- 114
- References
- 23
- Citations by year
- 2024: 1 · 2023: 2 · 2022: 3 · 2021: 1 · 2020: 2 · 2019: 3 · 2018: 1 · 2017: 2 · 2016: 1 · 2014: 1 · 2013: 1
- FWCI
- 11.58
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Adaptive Agents and Multi-Agents Systems (publishedVersion)
- Funders
- Defense Advanced Research Projects Agency
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Keywords
- multi-agent reinforcement learning, representation learning, large state spaces, robot soccer, agent cooperation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review