The University of Southampton
University of Southampton Institutional Repository

On-line estimators for ad-hoc task execution: learning types and parameters of teammates for effective teamwork

On-line estimators for ad-hoc task execution: learning types and parameters of teammates for effective teamwork
On-line estimators for ad-hoc task execution: learning types and parameters of teammates for effective teamwork
It is essential for agents to work together with others to accomplish common objectives, without pre-programmed coordination rules or previous knowledge of the current teammates, a challenge known as ad-hoc teamwork. In these systems, an agent estimates the algorithm of others in an on-line manner in order to decide its own actions for effective teamwork. A common approach is to assume a set of possible types and parameters for teammates, reducing the problem into estimating parameters and calculating distributions over types. Meanwhile, agents often must coordinate in a decentralised fashion to complete tasks that are displaced in an environment (e.g., in foraging, de-mining, rescue or fire control), where each member autonomously chooses which task to perform. By harnessing this knowledge, better estimation techniques can be developed. Hence, we present On-line Estimators for Ad-hoc Task Execution (OEATE), a novel algorithm for teammates’ type and parameter estimation in decentralised task execution. We show theoretically that our algorithm can converge to perfect estimations, under some assumptions, as the number of tasks increases. Additionally, we run experiments for a diverse configuration set in the level-based foraging domain over full and partial observability, and in a “capture the prey” game. We obtain a lower error in parameter and type estimation than previous approaches and better performance in the number of completed tasks for some cases. In fact, we evaluate a variety of scenarios via the increasing number of agents, scenario sizes, number of items, and number of types, showing that we can overcome previous works in most cases considering the estimation process, besides robustness to an increasing number of types and even to an erroneous set of potential types.
1387-2532
Shafipour Yourdshahi, Elnaz
a2e1dea9-d3c0-4288-afdc-197df65f2556
do Carmo Alves, Matheus Aparecido
d2ce25a9-34b6-4e5c-9299-9e52df984bd5
Varma, Amokh
3c493cb8-3429-4773-a68c-cd9367e256c6
Soriano Marcolino, Leandro
223515bb-56f3-4ede-a228-6392cc9451a0
Ueyama, Jo
c49cef8b-4ca4-4470-a717-9327451ecdf4
Angelov, Plamen
b3370977-117b-4df0-9a4d-3cbc396bd070
Shafipour Yourdshahi, Elnaz
a2e1dea9-d3c0-4288-afdc-197df65f2556
do Carmo Alves, Matheus Aparecido
d2ce25a9-34b6-4e5c-9299-9e52df984bd5
Varma, Amokh
3c493cb8-3429-4773-a68c-cd9367e256c6
Soriano Marcolino, Leandro
223515bb-56f3-4ede-a228-6392cc9451a0
Ueyama, Jo
c49cef8b-4ca4-4470-a717-9327451ecdf4
Angelov, Plamen
b3370977-117b-4df0-9a4d-3cbc396bd070

Shafipour Yourdshahi, Elnaz, do Carmo Alves, Matheus Aparecido, Varma, Amokh, Soriano Marcolino, Leandro, Ueyama, Jo and Angelov, Plamen (2022) On-line estimators for ad-hoc task execution: learning types and parameters of teammates for effective teamwork. Autonomous Agents and Multi-Agent Systems, 36 (2).

Record type: Article

Abstract

It is essential for agents to work together with others to accomplish common objectives, without pre-programmed coordination rules or previous knowledge of the current teammates, a challenge known as ad-hoc teamwork. In these systems, an agent estimates the algorithm of others in an on-line manner in order to decide its own actions for effective teamwork. A common approach is to assume a set of possible types and parameters for teammates, reducing the problem into estimating parameters and calculating distributions over types. Meanwhile, agents often must coordinate in a decentralised fashion to complete tasks that are displaced in an environment (e.g., in foraging, de-mining, rescue or fire control), where each member autonomously chooses which task to perform. By harnessing this knowledge, better estimation techniques can be developed. Hence, we present On-line Estimators for Ad-hoc Task Execution (OEATE), a novel algorithm for teammates’ type and parameter estimation in decentralised task execution. We show theoretically that our algorithm can converge to perfect estimations, under some assumptions, as the number of tasks increases. Additionally, we run experiments for a diverse configuration set in the level-based foraging domain over full and partial observability, and in a “capture the prey” game. We obtain a lower error in parameter and type estimation than previous approaches and better performance in the number of completed tasks for some cases. In fact, we evaluate a variety of scenarios via the increasing number of agents, scenario sizes, number of items, and number of types, showing that we can overcome previous works in most cases considering the estimation process, besides robustness to an increasing number of types and even to an erroneous set of potential types.

Text
s10458-022-09571-9 - Version of Record
Available under License Creative Commons Attribution.
Download (3MB)

More information

Accepted/In Press date: 21 June 2022
Published date: 13 August 2022

Identifiers

Local EPrints ID: 472907
URI: http://eprints.soton.ac.uk/id/eprint/472907
ISSN: 1387-2532
PURE UUID: f9df9d79-5e2e-4897-ab35-80f09bb613d4

Catalogue record

Date deposited: 05 Jan 2023 18:09
Last modified: 16 Mar 2024 23:27

Export record

Contributors

Author: Elnaz Shafipour Yourdshahi
Author: Matheus Aparecido do Carmo Alves
Author: Amokh Varma
Author: Leandro Soriano Marcolino
Author: Jo Ueyama
Author: Plamen Angelov

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×