The University of Southampton
University of Southampton Institutional Repository

Towards large scale ad-hoc teamwork

Towards large scale ad-hoc teamwork
Towards large scale ad-hoc teamwork
In complex environments, agents must be able to cooperate with previously unknown team-mates, and hence dynamically learn about other agents in the environment while searching for optimal actions. Previous works employ Monte Carlo Tree Search approaches. However, the search tree increases exponentially with the number of agents, and only scenarios with very small team sizes have been explored. Hence, in this paper we propose a history-based version of UCT Monte Carlo Tree Search, using a more compact representation than the original algorithm. We perform several experiments with a varying number of agents in the level-based foraging domain, an important testbed for ad-hoc teamwork. We achieve better overall performance than the state-of-the-art and better scalability with team size. Additionally, we contribute an open-source version of our system, making it easier for the research community to use the level-based foraging domain as a benchmark problern for ad-hoc teamwork.
44-49
IEEE
Shafipour Yourdshahi, Elnaz
a2e1dea9-d3c0-4288-afdc-197df65f2556
Pinder, Thomas
bc2db94b-480a-4a0d-a3f1-36810dd88d96
Dhawan, Gauri
a9966f54-60c2-4393-886c-b1995c7d2558
Soriano Marcolino, Leandro
47cf09dc-41a4-455b-82ff-d6582b6e241f
Angelov, Plamen
30ed50c8-95c0-44c8-aa44-bef2a25e2fb5
Shafipour Yourdshahi, Elnaz
a2e1dea9-d3c0-4288-afdc-197df65f2556
Pinder, Thomas
bc2db94b-480a-4a0d-a3f1-36810dd88d96
Dhawan, Gauri
a9966f54-60c2-4393-886c-b1995c7d2558
Soriano Marcolino, Leandro
47cf09dc-41a4-455b-82ff-d6582b6e241f
Angelov, Plamen
30ed50c8-95c0-44c8-aa44-bef2a25e2fb5

Shafipour Yourdshahi, Elnaz, Pinder, Thomas, Dhawan, Gauri, Soriano Marcolino, Leandro and Angelov, Plamen (2018) Towards large scale ad-hoc teamwork. In 2018 IEEE International Conference on Agents (ICA). IEEE. pp. 44-49 . (doi:10.1109/AGENTS.2018.8460136).

Record type: Conference or Workshop Item (Paper)

Abstract

In complex environments, agents must be able to cooperate with previously unknown team-mates, and hence dynamically learn about other agents in the environment while searching for optimal actions. Previous works employ Monte Carlo Tree Search approaches. However, the search tree increases exponentially with the number of agents, and only scenarios with very small team sizes have been explored. Hence, in this paper we propose a history-based version of UCT Monte Carlo Tree Search, using a more compact representation than the original algorithm. We perform several experiments with a varying number of agents in the level-based foraging domain, an important testbed for ad-hoc teamwork. We achieve better overall performance than the state-of-the-art and better scalability with team size. Additionally, we contribute an open-source version of our system, making it easier for the research community to use the level-based foraging domain as a benchmark problern for ad-hoc teamwork.

This record has no associated files available for download.

More information

Published date: 13 September 2018
Additional Information: Copyright © 2018, IEEE
Venue - Dates: International Conference on Agents, 2018-07-28 - 2018-07-31

Identifiers

Local EPrints ID: 469568
URI: http://eprints.soton.ac.uk/id/eprint/469568
PURE UUID: 3c48b374-e142-4dda-a5ab-938786cd131f

Catalogue record

Date deposited: 20 Sep 2022 16:38
Last modified: 16 Mar 2024 21:10

Export record

Altmetrics

Contributors

Author: Elnaz Shafipour Yourdshahi
Author: Thomas Pinder
Author: Gauri Dhawan
Author: Leandro Soriano Marcolino
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.

×