Abstract
Past research has investigated a number of methods for coordinating teams of agents, but with the growing number of sources of agents, it is likely that agents will encounter teammates that do not share their coordination methods. Therefore, it is desirable for agents to adapt to these teammates, forming an effective ad hoc team. Past ad hoc teamwork research has focused on cases where the agents do not directly communicate. However when teammates do communicate, it can provide a valuable channel for coordination. Therefore, this paper tackles the problem of communication in ad hoc teams, introducing a minimal version of the multiagent, multiarmed bandit problem with limited communication between the agents. The theoretical results in this paper prove that this problem setting can be solved in polynomial time when the agent knows the set of possible teammates. Furthermore, the empirical results show that an agent can cooperate with a variety of teammates following unknown behaviors even when its models of these teammates are imperfect.
Original language | English |
---|---|
Title of host publication | ECAI 2014 - 21st European Conference on Artificial Intelligence, Including Prestigious Applications of Intelligent Systems, PAIS 2014, Proceedings |
Editors | Torsten Schaub, Gerhard Friedrich, Barry O'Sullivan |
Publisher | IOS Press BV |
Pages | 45-50 |
Number of pages | 6 |
ISBN (Electronic) | 9781614994183 |
DOIs | |
State | Published - 2014 |
Event | 21st European Conference on Artificial Intelligence, ECAI 2014 - Prague, Czech Republic Duration: 18 Aug 2014 → 22 Aug 2014 |
Publication series
Name | Frontiers in Artificial Intelligence and Applications |
---|---|
Volume | 263 |
ISSN (Print) | 0922-6389 |
ISSN (Electronic) | 1879-8314 |
Conference
Conference | 21st European Conference on Artificial Intelligence, ECAI 2014 |
---|---|
Country/Territory | Czech Republic |
City | Prague |
Period | 18/08/14 → 22/08/14 |
Bibliographical note
Publisher Copyright:© 2014 The Authors and IOS Press.