Assisting Unknown Teammates in Unknown Tasks: Ad Hoc Teamwork under Partial Observability

• URL: http://arxiv.org/abs/2201.03538v1
• Date: Mon, 10 Jan 2022 18:53:34 GMT
• Title: Assisting Unknown Teammates in Unknown Tasks: Ad Hoc Teamwork under Partial Observability
• Authors: Jo\~ao G. Ribeiro, Cassandro Martinho, Alberto Sardinha, Francisco S. Melo
• Abstract summary: We present a novel online prediction algorithm for the problem setting of ad hoc teamwork under partial observability (ATPO) ATPO accommodates partial observability, using the agent's observations to identify which task is being performed by the teammates. Our results show that ATPO is effective and robust in identifying the teammate's task from a large library of possible tasks, efficient at solving it in near-optimal time, and scalable in adapting to increasingly larger problem sizes.
• Score: 15.995282665634097
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we present a novel Bayesian online prediction algorithm for the problem setting of ad hoc teamwork under partial observability (ATPO), which enables on-the-fly collaboration with unknown teammates performing an unknown task without needing a pre-coordination protocol. Unlike previous works that assume a fully observable state of the environment, ATPO accommodates partial observability, using the agent's observations to identify which task is being performed by the teammates. Our approach assumes neither that the teammate's actions are visible nor an environment reward signal. We evaluate ATPO in three domains -- two modified versions of the Pursuit domain with partial observability and the overcooked domain. Our results show that ATPO is effective and robust in identifying the teammate's task from a large library of possible tasks, efficient at solving it in near-optimal time, and scalable in adapting to increasingly larger problem sizes.

Related papers

• Seamless Detection: Unifying Salient Object Detection and Camouflaged Object Detection [73.85890512959861]
  We propose a task-agnostic framework to unify Salient Object Detection (SOD) and Camouflaged Object Detection (COD) We design a simple yet effective contextual decoder involving the interval-layer and global context, which achieves an inference speed of 67 fps. Experiments on public SOD and COD datasets demonstrate the superiority of our proposed framework in both supervised and unsupervised settings.
  arXiv  Detail & Related papers  (2024-12-22T03:25:43Z)
• Collaborative Gym: A Framework for Enabling and Evaluating Human-Agent Collaboration [51.452664740963066]
  Collaborative Gym is a framework enabling asynchronous, tripartite interaction among agents, humans, and task environments. We instantiate Co-Gym with three representative tasks in both simulated and real-world conditions. Our findings reveal that collaborative agents consistently outperform their fully autonomous counterparts in task performance.
  arXiv  Detail & Related papers  (2024-12-20T09:21:15Z)
• CP-Guard: Malicious Agent Detection and Defense in Collaborative Bird's Eye View Perception [54.78412829889825]
  Collaborative Perception (CP) has shown a promising technique for autonomous driving. In CP, ego CAV needs to receive messages from its collaborators, which makes it easy to be attacked by malicious agents. We propose a novel method, textbfCP-Guard, that can be deployed by each agent to accurately detect and eliminate malicious agents in its collaboration network.
  arXiv  Detail & Related papers  (2024-12-16T17:28:25Z)
• WorkArena: How Capable Are Web Agents at Solving Common Knowledge Work Tasks? [83.19032025950986]
  We study the use of large language model-based agents for interacting with software via web browsers. WorkArena is a benchmark of 33 tasks based on the widely-used ServiceNow platform. BrowserGym is an environment for the design and evaluation of such agents.
  arXiv  Detail & Related papers  (2024-03-12T14:58:45Z)
• Making Friends in the Dark: Ad Hoc Teamwork Under Partial Observability [11.786470737937638]
  This paper introduces a formal definition of the setting of ad hoc teamwork under partial observability. Our results in 70 POMDPs from 11 domains show that our approach is not only effective in assisting unknown teammates in solving unknown tasks but is also robust in scaling to more challenging problems.
  arXiv  Detail & Related papers  (2023-09-30T16:40:50Z)
• ProAgent: Building Proactive Cooperative Agents with Large Language Models [89.53040828210945]
  ProAgent is a novel framework that harnesses large language models to create proactive agents. ProAgent can analyze the present state, and infer the intentions of teammates from observations. ProAgent exhibits a high degree of modularity and interpretability, making it easily integrated into various coordination scenarios.
  arXiv  Detail & Related papers  (2023-08-22T10:36:56Z)
• Knowledge-based Reasoning and Learning under Partial Observability in Ad Hoc Teamwork [4.454557728745761]
  This paper introduces an architecture that determines an ad hoc agent's behavior based on non-monotonic logical reasoning. It supports online selection, adaptation, and learning of the models that predict the other agents' behavior. We show that the performance of our architecture is comparable or better than state of the art data-driven baselines in both simple and complex scenarios.
  arXiv  Detail & Related papers  (2023-06-01T15:21:27Z)
• A General Learning Framework for Open Ad Hoc Teamwork Using Graph-based Policy Learning [11.998708550268978]
  We develop a class of solutions for open ad hoc teamwork under full and partial observability. We show that our solution can learn efficient policies in open ad hoc teamwork in fully and partially observable cases.
  arXiv  Detail & Related papers  (2022-10-11T13:44:44Z)
• Exploring Visual Context for Weakly Supervised Person Search [155.46727990750227]
  Person search has recently emerged as a challenging task that jointly addresses pedestrian detection and person re-identification. Existing approaches follow a fully supervised setting where both bounding box and identity annotations are available. This paper inventively considers weakly supervised person search with only bounding box annotations.
  arXiv  Detail & Related papers  (2021-06-19T14:47:13Z)
• Expected Value of Communication for Planning in Ad Hoc Teamwork [44.262891197318034]
  A desirable goal for autonomous agents is to be able to coordinate on the fly with previously unknown teammates. One of the central challenges in ad hoc teamwork is quickly recognizing the current plans of other agents and planning accordingly. We present a novel planning algorithm for ad hoc teamwork, determining which query to ask and planning accordingly.
  arXiv  Detail & Related papers  (2021-03-01T18:09:36Z)

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.