ACM Home Page
Please provide us with feedback. Feedback
Coordinating simple and unreliable agents
Full text PdfPdf (269 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems table of contents
Hakodate, Japan
SESSION: Scalability, security, and performance analysis table of contents
Pages: 1119 - 1121  
Year of Publication: 2006
ISBN:1-59593-303-4
Author
Kagan Tumer  NASA Ames Research Center, Moffett Field, CA
Sponsors
IFMAS : The International Foundation for Multiagent Systems
ATAL : The International Workshop on Agent Theories, Architectures, and Languages
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 30,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

Coordinating a large number of simple and unreliable agents to achieve a global objective poses a unique design challenge: How to achieve robust system level behavior in spite of the computational/reliability limitations of the agents. We investigate agent coordination in the difficult optimization problem of selecting the subset of sensing devices with distortions that provides the smallest average distortion [1]. We approach problem by assigning an agent to each device and having that agent use a simple reinforcement learning algorithm to determine whether to be part of the aggregate device. Our results show that the right agent reward structure provides significant improvements over both traditional search methods and traditional multi-agent methods. Furthermore, even in extreme cases of agent failures (i.e., half the agents fail during the simulation) this approach still outperforms a failure-free and centralized search algorithm.


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
D. Challet and N. F. Johnson. Optimal combinations of imperfect objects. Phys. Rev. Let., 89:028701, 2002.
 
2
T. Hogg and B. A. Huberman. Controlling smart matter. Smart Materials and Structures, 7:R1--R14, 1998.
 
3
 
4
M. Tambe. Towards flexible teamwork. Journal of Artificial Intelligence Research, 7:83--124, 1997.
 
5
K. Tumer and D. Wolpert. A survey of collectives. In Collectives and the Design of Complex Systems, pages 1, 42. Springer, 2004.
 
6
D. H. Wolpert and K. Tumer. Optimal payoff functions for members of collectives. Advances in Complex Systems, 4(2/3):265--279, 2001.