Abstract
The concept of creating autonomous agents capable of exhibiting ad hoc teamwork was recently introduced as a challenge to the Al, and specifically to the multiagent systems community. An agent ca-pable of ad hoc teamwork is one that can effectively cooperate with multiple potential teammates on a set of collaborative tasks. Previous research has investigated theoretically optimal ad hoc teamwork strategies in restrictive settings. This paper presents the first empirical study of ad hoc teamwork in a more open, complex teamwork domain. Specifically, we evaluate a range of effective algorithms for on-line behavior generation on the part of a single ad hoc team agent that must collaborate with a range of possible teammates in the pursuit domain.
Original language | English |
---|---|
Pages | 529-536 |
Number of pages | 8 |
State | Published - 2011 |
Event | 10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011 - Taipei, Taiwan, Province of China Duration: 2 May 2011 → 6 May 2011 |
Conference
Conference | 10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011 |
---|---|
Country/Territory | Taiwan, Province of China |
City | Taipei |
Period | 2/05/11 → 6/05/11 |
Keywords
- Ad hoc teams
- Agent cooperation: implicit cooperation
- Agent cooperation: teamwork
- Coalition formation
- Coordination. agent reasoning: planning (single and multi- Agent)