• Classified by Topic • Classified by Publication Type • Sorted by Date • Sorted by First Author Last Name • Classified by Funding Source •
Leading Ad Hoc Agents in Joint Action Settings with Multiple Teammates.
Noa
Agmon and Peter Stone.
In Proc. of 11th Int. Conf. on Autonomous
Agents and Multiagent Systems (AAMAS), June 2012.
[PDF]229.4kB [postscript]757.7kB
The growing use of autonomous agents in practice may require agents to cooperate as a team in situations where they have limited prior knowledge about one another, cannot communicate directly, or do not share the same world models. These situations raise the need to design ad hoc team members, i.e., agents that will be able to cooperate without coordination in order to reach an optimal team behavior. This paper considers the problem of leading N-agent teams by an agent toward their optimal joint utility, where the agents compute their next actions based only on their most recent observations of their teammates’ actions. We show that compared to previous results in two-agent teams, in larger teams the agent might not be able to lead the team to the action with maximal joint utility, thus its optimal strategy is to lead the team to the best possible reachable cycle of joint actions. We describe a graphical model of the problem and a polynomial time algorithm for solving it. We then consider other variations of the problem, including leading teams of agents where they base their actions on longer history of past observations, leading a team by more than one ad hoc agent, and leading a teammate while the ad hoc agent is uncertain of its behavior.
@InProceedings{AAMAS12-agmon,
author = {Noa Agmon and Peter Stone},
title = {Leading Ad Hoc Agents in Joint Action Settings with Multiple Teammates},
booktitle = {Proc. of 11th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS)},
location = {Valencia, Spain},
month = {June},
year = {2012},
abstract = {
The growing use of autonomous agents in practice may require
agents to cooperate as a team in situations where they
have limited prior knowledge about one another, cannot
communicate directly, or do not share the same world models.
These situations raise the need to design ad hoc team
members, i.e., agents that will be able to cooperate without
coordination in order to reach an optimal team behavior.
This paper considers the problem of leading N-agent teams
by an agent toward their optimal joint utility, where the
agents compute their next actions based only on their most
recent observations of their teammates’ actions. We show
that compared to previous results in two-agent teams, in
larger teams the agent might not be able to lead the team
to the action with maximal joint utility, thus its optimal
strategy is to lead the team to the best possible reachable
cycle of joint actions. We describe a graphical model of
the problem and a polynomial time algorithm for solving it.
We then consider other variations of the problem, including
leading teams of agents where they base their actions on
longer history of past observations, leading a team by more
than one ad hoc agent, and leading a teammate while the
ad hoc agent is uncertain of its behavior.
},
}
Generated by bib2html.pl (written by Patrick Riley ) on Tue Nov 19, 2024 10:24:44