Multi-Robot Open Adaptive Teaming Across Unseen Environments, Partners, and Scales

• URL: http://arxiv.org/abs/2607.04972v1
• Date: Mon, 06 Jul 2026 12:02:02 GMT
• Title: Multi-Robot Open Adaptive Teaming Across Unseen Environments, Partners, and Scales
• Abstract summary: We formalize open adaptive multi-robot teaming as a game-theoretic construct for modeling strategic interactions and payoff structures among agents.<n>We develop the Hypergraphic Open-ended Learning Algorithm (HOLA), which progressively expands partner and environment diversity during training rather than optimizing for fixed configurations.
• Score: 22.672686026111947
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Deploying robot teams in the real world requires simultaneous adaptation to unseen environments, unknown partners, and varying team sizes, yet existing approaches often address these challenges in isolation under the closed-world assumption of fixed teammates. We formalize this as open adaptive multi-robot teaming and propose a hypergraphic-form game formulation that captures team-level cooperative relationships beyond pairwise interactions, providing a principled foundation for coordination structure inference when team composition changes dynamically within episodes. Unlike graph neural network architectures, this is a game-theoretic construct for modeling strategic interactions and payoff structures among agents. Building on this formulation, we develop the Hypergraphic Open-ended Learning Algorithm (HOLA), which progressively expands partner and environment diversity during training rather than optimizing for fixed configurations. Evaluated on cooperative pursuit with multi-drone and multi-quadruped platforms, HOLA outperforms all baselines across all three adaptability dimensions. Learned policies transfer directly to physical hardware without fine-tuning, with successful deployments on Crazyflie and Zsibot L1 platforms confirming robust real-world coordination in novel environments with unseen teammates.

Related papers

• Beyond Partner Diversity: An Influence-Based Team Steering Framework for Zero-Shot Human-Machine Teaming [1.6672631924542791]
  Influence-Based Team Steering is a framework that uses influence shaping to incentivize agents to discover diverse, high-performing team interaction patterns.<n>We assess IBTS on Overcooked-AI in both two-agent and three-agent settings, allowing us to test whether learned coordination structure transfers beyond dyadic interaction.<n>Our evaluation includes simulated partners, synthetic partner-style variation, and, to our knowledge, the first 30-subject Overcooked-AI HMT study involving two real human teammates and one machine teammate.
  arXiv  Detail & Related papers  (2026-05-14T20:34:16Z)
• Improving the Efficiency of Language Agent Teams with Adaptive Task Graphs [52.26652574704317]
  Large language models (LLMs) are increasingly deployed in teams, yet existing coordination approaches often occupy two extremes.<n>We introduce Language Agent Teams for Task Evolution (LATTE), a framework for coordinating LLM teams inspired by distributed systems.
  arXiv  Detail & Related papers  (2026-05-07T14:19:17Z)
• TeamHOI: Learning a Unified Policy for Cooperative Human-Object Interactions with Any Team Size [54.0714652192002]
  Physics-based humanoid control has achieved remarkable progress in enabling realistic and high-performing single-agent behaviors.<n>We present TeamHOI, a framework that enables a single decentralized policy to handle cooperative HOIs across any number of cooperating agents.
  arXiv  Detail & Related papers  (2026-03-09T05:52:13Z)
• Modeling Latent Partner Strategies for Adaptive Zero-Shot Human-Agent Collaboration [8.829018359718086]
  We introduce TALENTS, a strategy-conditioned cooperator framework that learns to represent, categorize, and adapt to a range of partner strategies.<n>Our approach utilizes a variational autoencoder to learn a latent strategy space from trajectory data.<n>In order to adapt to previously unseen partners, we leverage a fixed-share regret minimization algorithm.
  arXiv  Detail & Related papers  (2025-07-07T17:53:13Z)
• Generalizable Agent Modeling for Agent Collaboration-Competition Adaptation with Multi-Retrieval and Dynamic Generation [19.74776726500979]
  Adapting a single agent to a new multi-agent system brings challenges, necessitating adjustments across various tasks, environments, and interactions with unknown teammates and opponents.<n>We propose a more comprehensive setting, Agent Collaborative-Competitive Adaptation, which evaluates an agent to generalize across diverse scenarios.<n>In ACCA, agents adjust to task and environmental changes, collaborate with unseen teammates, and compete against unknown opponents.
  arXiv  Detail & Related papers  (2025-06-20T03:28:18Z)
• MindAgent: Emergent Gaming Interaction [103.73707345211892]
  Large Language Models (LLMs) have the capacity of performing complex scheduling in a multi-agent system. We propose MindAgent to evaluate planning and coordination emergent capabilities for gaming interaction.
  arXiv  Detail & Related papers  (2023-09-18T17:52:22Z)
• Rethinking Trajectory Prediction via "Team Game" [118.59480535826094]
  We present a novel formulation for multi-agent trajectory prediction, which explicitly introduces the concept of interactive group consensus. On two multi-agent settings, i.e. team sports and pedestrians, the proposed framework consistently achieves superior performance compared to existing methods.
  arXiv  Detail & Related papers  (2022-10-17T07:16:44Z)
• Conditional Imitation Learning for Multi-Agent Games [89.897635970366]
  We study the problem of conditional multi-agent imitation learning, where we have access to joint trajectory demonstrations at training time. We propose a novel approach to address the difficulties of scalability and data scarcity. Our model learns a low-rank subspace over ego and partner agent strategies, then infers and adapts to a new partner strategy by interpolating in the subspace.
  arXiv  Detail & Related papers  (2022-01-05T04:40:13Z)
• Competing Adaptive Networks [56.56653763124104]
  We develop an algorithm for decentralized competition among teams of adaptive agents. We present an application in the decentralized training of generative adversarial neural networks.
  arXiv  Detail & Related papers  (2021-03-29T14:42:15Z)
• Towards Open Ad Hoc Teamwork Using Graph-based Policy Learning [11.480994804659908]
  We build on graph neural networks to learn agent models and joint-action value models under varying team compositions. We empirically demonstrate that our approach successfully models the effects other agents have on the learner, leading to policies that robustly adapt to dynamic team compositions.
  arXiv  Detail & Related papers  (2020-06-18T10:39:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.