ACM Home Page
Please provide us with feedback. Feedback
Communication decisions in multi-agent cooperation: model and experiments
Full text PdfPdf (205 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the fifth international conference on Autonomous agents table of contents
Montreal, Quebec, Canada
Pages: 616 - 623  
Year of Publication: 2001
ISBN:1-58113-326-X
Authors
Ping Xuan  Department of Computer Science, University of Massachusetts at Amherst, Amherst, MA
Victor Lesser  Department of Computer Science, University of Massachusetts at Amherst, Amherst, MA
Shlomo Zilberstein  Department of Computer Science, University of Massachusetts at Amherst, Amherst, MA
Sponsor
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 54,   Citation Count: 40
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/375735.376469
What is a DOI?

ABSTRACT

In multi-agent cooperation, agents share a common goal, which is evaluated through a global utility function. However, an agent typically cannot observe the global state of an uncertain environment, and therefore they must communicate with each other in order to share the information needed for deciding which actions to take. We argue that, when communication incurs a cost (due to resource consumption, for example), whether to communicate or not also becomes a decision to make. Hence, communication decision becomes part of the overall agent decision problem. In order to explicitly address this problem, we present a multi-agent extension to Markov decision processes in which communication can be modeled as an explicit action that incurs a cost. This framework provides a foundation for a quantified study of agent coordination policies and provides both motivation and insight to the design of heuristic approaches. An example problem is studied under this framework. From this example we can see the impact communication policies have on the overall agent policies, and what implications we can find toward the design of agent coordination policies.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Aicardi, F. Davoli, and R. Minciardi. Decentralized optimal control of markov chains with a common past information set. IEEE Transactions on Automatic Control, AC-32:1028-1031, 1987.
 
2
 
3
 
4
 
5
 
6
E. Hansen, A. Barto, and S. Zilberstein. Reinforcement learning for mixed open-loop and closed-loop control. In Proceedings of the Ninth Neural Information Processing Systems Conference, December 1996.
 
7
E. A. Hansen and S. Zilberstein. Monitoring the progress of anytime problem-solving. In Proceedings of the 13th National Conference onArtificial Intelligence, pages 1229-1234, 1996.
 
8
Y. C. Ho and T. S. Chang. Another look at the nonclassical information problem. IEEE Transactions on Automatic Control, AC-25:537-540, 1980.
 
9
K. Hsu and S. I. Marcus. Decentralized control of finite state markov processes. IEEE Transactions on Automatic Control, AC-27:426-431, 1982.
 
10
M. L. Littman. Markov games as a framework for multi-agent reinforcement learning. In Proc. 11th International Conf. on Machine Learning, pages 157-163, 1994.
 
11
 
12
 
13
N. R. Sandell, P. Varaiya, M. Athans, and M. Safonov. Survey of decentralized control methods for large scale systems. IEEE Transactions on Automatic Control, AC-23:108-128, 1978.
 
14
J. N. Tsitsiklis and M. Athans. On the complexity of decentralized decision making and detection problems. IEEE Transactions on Automatic Control, AC-30:440-446, 1985.
 
15
H. S. Witsenhausen. A counterexample in stochastic optimum control. SIAM Journal on Control, 6(1):138-147, 1968.
 
16
T. Yoshikawa. Decomposition of dynamic team decision problems. IEEE Transactions on Automatic Control, AC-23:443-445, 1978.

CITED BY  40

Collaborative Colleagues:
Ping Xuan: colleagues
Victor Lesser: colleagues
Shlomo Zilberstein: colleagues