Deep Decentralized Multi-task Multi-Agent Reinforcement Learning under Partial Observability
read the original abstract
Many real-world tasks involve multiple agents with partial observability and limited communication. Learning is challenging in these settings due to local viewpoints of agents, which perceive the world as non-stationary due to concurrently-exploring teammates. Approaches that learn specialized policies for individual tasks face problems when applied to the real world: not only do agents have to learn and store distinct policies for each task, but in practice identities of tasks are often non-observable, making these approaches inapplicable. This paper formalizes and addresses the problem of multi-task multi-agent reinforcement learning under partial observability. We introduce a decentralized single-task learning approach that is robust to concurrent interactions of teammates, and present an approach for distilling single-task policies into a unified policy that performs well across multiple related tasks, without explicit provision of task identity.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
MASK: Multi-Agent Semantic K-Scheduling for Risk-Sensitive 6G Robotics
MASK schedules top-K agents via semantic gating and a global encoder to achieve risk-aware multi-robot coordination that matches unconstrained baselines under bandwidth caps.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.