TY - GEN
T1 - Towards flexible teamwork in persistent teams
AU - Tambe, Milind
AU - Zhang, Weixiong
N1 - Funding Information:
The research was supported in part by NSF grant IRI-9711665, in part by NSF grant IRI-9619554, and in part by contract N66001-95-C-6013 from ARPA/ISO. We thank Randy Hill, Jon Gratch and Paul Rosen-bloom for discussion of issues related to the ACTD demonstration, and the RoboCup simulation group for discussion of issues related to RoboCup.
Publisher Copyright:
© 1998 IEEE.
PY - 1998
Y1 - 1998
N2 - Teamwork is a critical capability in multi-agent environments. Many such environments mandate that the agents and agent-teams mast be persistent i.e., exist over long periods of time. Agents in such persistent teams are bound together by their long-term common interests and goals. This paper focuses on flexible teamwork in such persistent teams. Unfortunately, while previous work has investigated flexible teamwork, persistent teams remain unexplored. For flexible teamwork, one promising approach that has emerged is model-based, i.e., providing agents with general models of teamwork that explicitly specify their commitments in teamwork. Such models enable agents to autonomously reason about coordination. Unfortunately, for persistent teams, such models may lead to coordination and communication actions that while locally optimal, are highly problematic for the team's long-term goals. We present a decision-theoretic technique to enable persistent teams to overcome such limitations of the model-based approach. In particular, agents reason about expected team utilities of future team states that are projected to result from actions recommended by the teamwork model, as well as lower-cost (or higher-cost) variations on these actions. To accommodate real-time constraints, this reasoning is done in an any-time fashion. Implemented examples from an analytic search tree and some real-world domains are presented.
AB - Teamwork is a critical capability in multi-agent environments. Many such environments mandate that the agents and agent-teams mast be persistent i.e., exist over long periods of time. Agents in such persistent teams are bound together by their long-term common interests and goals. This paper focuses on flexible teamwork in such persistent teams. Unfortunately, while previous work has investigated flexible teamwork, persistent teams remain unexplored. For flexible teamwork, one promising approach that has emerged is model-based, i.e., providing agents with general models of teamwork that explicitly specify their commitments in teamwork. Such models enable agents to autonomously reason about coordination. Unfortunately, for persistent teams, such models may lead to coordination and communication actions that while locally optimal, are highly problematic for the team's long-term goals. We present a decision-theoretic technique to enable persistent teams to overcome such limitations of the model-based approach. In particular, agents reason about expected team utilities of future team states that are projected to result from actions recommended by the teamwork model, as well as lower-cost (or higher-cost) variations on these actions. To accommodate real-time constraints, this reasoning is done in an any-time fashion. Implemented examples from an analytic search tree and some real-world domains are presented.
UR - http://www.scopus.com/inward/record.url?scp=85017283110&partnerID=8YFLogxK
U2 - 10.1109/ICMAS.1998.699065
DO - 10.1109/ICMAS.1998.699065
M3 - Conference contribution
AN - SCOPUS:85017283110
SN - 081868500X
SN - 9780818685002
T3 - Proceedings - International Conference on Multi Agent Systems, ICMAS 1998
SP - 277
EP - 284
BT - Proceedings - International Conference on Multi Agent Systems, ICMAS 1998
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1998 International Conference on Multi Agent Systems, ICMAS 1998
Y2 - 3 July 1998 through 7 July 1998
ER -