Expected Value of Communication for Planning in Ad Hoc Teamwork

by   William Macke, et al.

A desirable goal for autonomous agents is to be able to coordinate on the fly with previously unknown teammates. Known as "ad hoc teamwork", enabling such a capability has been receiving increasing attention in the research community. One of the central challenges in ad hoc teamwork is quickly recognizing the current plans of other agents and planning accordingly. In this paper, we focus on the scenario in which teammates can communicate with one another, but only at a cost. Thus, they must carefully balance plan recognition based on observations vs. that based on communication. This paper proposes a new metric for evaluating how similar are two policies that a teammate may be following - the Expected Divergence Point (EDP). We then present a novel planning algorithm for ad hoc teamwork, determining which query to ask and planning accordingly. We demonstrate the effectiveness of this algorithm in a range of increasingly general communication in ad hoc teamwork problems.



There are no comments yet.


page 1

page 2

page 3

page 4


A Mechanised Semantics for HOL with Ad-hoc Overloading

Isabelle/HOL augments classical higher-order logic with ad-hoc overloadi...

Simulating Ability: Representing Skills in Games

Throughout the history of games, representing the abilities of the vario...

Data-driven Clustering in Ad-hoc Networks based on Community Detection

High demands for industrial networks lead to increasingly large sensor n...

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

In this paper, we present a novel Bayesian online prediction algorithm f...

Sound of Guns: Digital Forensics of Gun Audio Samples meets Artificial Intelligence

Classifying a weapon based on its muzzle blast is a challenging task tha...

PSI: Constructing ad-hoc Simplices to Interpolate High-Dimensional Unstructured Data

Interpolating unstructured data using barycentric coordinates becomes in...

Certified Non-Confluence with ConCon 1.5

We present three methods to check CTRSs for non-confluence: (1) an ad ho...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.