Vidal's libraryTitle: | Multiagent Teamwork: Analyzing the Optimality and Complexity of Key Theories and Models |
Author: | David V. Pynadath and Milind Tambe |
Book Tittle: | Proceedings of the First Intenational Joint Conference on Autonomous Agents and Multiagent Systems |
Pages: | 873--880 |
Publisher: | ACM Press, New York, NY. |
Year: | 2002 |
Abstract: | Despite the significant progress in multiagent teamwork, existing research does not address the optimality of its prescriptions nor the complexity of the teamwork problem. Thus, we cannot determine whether the assumptions and approximations made by a particular theory gain enough efficiency to justify the losses in overall performance. To provide a tool for evaluating this tradeoff, we present a unified framework, the COMmunicative Multiagent Team Decision Problem (COM-MTDP) model, which is general enough to subsume many existing models of multiagent systems. We analyze use the COM-MTDP model to provide a breakdown of the computational complexity of constructing optimal teams under problem domains divided along the dimensions of observability and communication cost. We then exploit the COM-MTDP s ability to encode existing teamwork theories and models to encode two instantiations of joint intentions theory, including STEAM. We then derive a domain-independent criterion for optimal communication and provide a comparative analysis of the two joint intentions instantiations. We have implemented a reusable, domain-independent software package based COM-MTDPs to analyze teamwork coordination strategies, and we demonstrate its use by encoding and evaluating the two joint intentions strategies within an example domain. |
Cited by 46 - Google Scholar
@InProceedings{pynadath02a,
author = {David V. Pynadath and Milind Tambe},
title = {Multiagent Teamwork: Analyzing the Optimality and
Complexity of Key Theories and Models},
googleid = {7WCLcoepWskJ:scholar.google.com/},
booktitle = {Proceedings of the First Intenational Joint
Conference on Autonomous Agents and Multiagent
Systems},
pages = {873--880},
year = 2002,
publisher = {{ACM} Press, New York, NY.},
abstract = {Despite the significant progress in multiagent
teamwork, existing research does not address the
optimality of its prescriptions nor the complexity
of the teamwork problem. Thus, we cannot determine
whether the assumptions and approximations made by a
particular theory gain enough efficiency to justify
the losses in overall performance. To provide a tool
for evaluating this tradeoff, we present a unified
framework, the COMmunicative Multiagent Team
Decision Problem (COM-MTDP) model, which is general
enough to subsume many existing models of multiagent
systems. We analyze use the COM-MTDP model to
provide a breakdown of the computational complexity
of constructing optimal teams under problem domains
divided along the dimensions of observability and
communication cost. We then exploit the COM-MTDP s
ability to encode existing teamwork theories and
models to encode two instantiations of joint
intentions theory, including STEAM. We then derive a
domain-independent criterion for optimal
communication and provide a comparative analysis of
the two joint intentions instantiations. We have
implemented a reusable, domain-independent software
package based COM-MTDPs to analyze teamwork
coordination strategies, and we demonstrate its use
by encoding and evaluating the two joint intentions
strategies within an example domain.},
keywords = {multiagent planning},
url = {http://jmvidal.cse.sc.edu/library/pynadath02a.pdf},
cluster = {14509095548734890221}
}
Last modified: Wed Mar 9 10:15:31 EST 2011