Collaborative AI Teaming in Unknown Environments via Active Goal Deduction
Not on the map. Why?
Abstract (arXiv)
With the advancements of artificial intelligence (AI), we're seeing more scenarios that require AI to work closely with other agents, whose goals and strategies might not be known beforehand. However, existing approaches for training collaborative agents often require defined and known reward signals and cannot address the problem of teaming with unknown agents that often have latent objectives/rewards. In response to this challenge, we propose teaming with unknown agents framework, which leverages kernel density Bayesian inverse learning method for active goal deduction and utilizes pre-trained, goal-conditioned policies to enable zero-shot policy adaptation. We prove that unbiased reward estimates in our framework are sufficient for optimal teaming with unknown agents. We further evaluate the framework of redesigned multi-agent particle and StarCraft II micromanagement environments with diverse unknown agents of different behaviors/rewards. Empirical results demonstrate that our framework significantly advances the teaming performance of AI and unknown agents in a wide range of collaborative scenarios.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 28 of its 58 references that are in the map. First posted on arXiv 22 Mar 2024.
Builds on
28 of 58 references.
References · 28
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
- 2017Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environmentscited by 1,519
- 2016Progressive Neural Networkscited by 1,332
- 2021The Surprising Effectiveness of PPO in Cooperative, Multi-Agent Gamescited by 903
- 2017Counterfactual Multi-Agent Policy Gradientscited by 733
- 2019The StarCraft Multi-Agent Challengecited by 589
- 2017FeUdal Networks for Hierarchical Reinforcement Learningcited by 328
- 2018Actor-Attention-Critic for Multi-Agent Reinforcement Learningcited by 259
- 2020Weighted QMIX: Expanding Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 197
- 2020Open Problems in Cooperative AIcited by 167
- 2017Deep Decentralized Multi-task Multi-Agent Reinforcement Learning under Partial Observabilitycited by 143
16 more
- 2023Human-Timescale Adaptation in an Open-Ended Task Spacecited by 136
- 2017Autonomous Agents Modelling Other Agents: A Comprehensive Survey and Open Problemscited by 126
- 2017Stabilising Experience Replay for Deep Multi-Agent Reinforcement Learningcited by 114
- 2023Language Instructed Reinforcement Learning for Human-AI Coordinationcited by 61
- 2021Scalable Bayesian Inverse Reinforcement Learningcited by 56
- 2021Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Banditscited by 25
- 2023MAC-PO: Multi-Agent Experience Replay via Collective Priority Optimizationcited by 20
- 2024Deep Generative Models for Offline Policy Learning: Tutorial, Survey, and Perspectives on Future Directionscited by 20
- 2020Multi-Agent Trust Region Policy Optimizationcited by 19
- 2022Value Functions Factorization with Latent State Information Sharing in Decentralized Multi-Agent Policy Gradientscited by 12
- 2022A Bayesian Optimization Framework for Finding Local Optima in Expensive Multi-Modal Functionscited by 12
- 2023Real-time Network Intrusion Detection via Decision Transformerscited by 12
- 2020An Efficient Transfer Learning Framework for Multiagent Reinforcement Learningcited by 11
- 2023Improved Active Multi-Task Representation Learning via Lassocited by 9
- 2024Bayesian Optimization through Gaussian Cox Process Models for Spatio-temporal Datacited by 5
- 2023Multi-Task Structural Learning using Local Task Similarity induced Neuron Creation and Removalcited by 2
Built on by
Citing papers per year: 2024: 4; 2025: 1; 2026: 1.
6 papers.
- 2025Network Diffuser for Placing-Scheduling Service Function Chains with Inverse Demonstrationcited by 11
- 2024Learning from Random Demonstrations: Offline Reinforcement Learning with Importance-Sampled Diffusion Modelscited by 8
- 2024Cooperative Backdoor Attack in Decentralized Reinforcement Learning with Theoretical Guaranteecited by 6
- 2024RGMDT: Return-Gap-Minimizing Decision Tree Extraction in Non-Euclidean Metric Spacecited by 2
- 2024A Resource-Adaptive Approach for Federated Learning under Resource-Constrained Environmentscited by 1
- 2026ISBO: Scalable Spatio-Temporal Bayesian Optimization with Log Gaussian Cox Process Models via the INLA-SPDE Approachcited by 0
- 2026ISBO: Scalable Spatio-Temporal Bayesian Optimization with Log Gaussian Cox Process Models via the INLA-SPDE Approach8 Oct 2026
- 2025Network Diffuser for Placing-Scheduling Service Function Chains with Inverse Demonstration10 Jan 2025
- 2024RGMDT: Return-Gap-Minimizing Decision Tree Extraction in Non-Euclidean Metric Space21 Oct 2024
- 2024A Resource-Adaptive Approach for Federated Learning under Resource-Constrained Environments19 Jun 2024
- 2024Learning from Random Demonstrations: Offline Reinforcement Learning with Importance-Sampled Diffusion Models30 May 2024
- 2024Cooperative Backdoor Attack in Decentralized Reinforcement Learning with Theoretical Guarantee24 May 2024