Performance Models for Large Scale Multiagent Systems: Using Distributed POMDP Building Blocks

Proceedings of the Interantional Conference on Autonomous Agents

Volumn 2, Issue , 2003, Pages 297-304

  Jung, Hyuckchul ^a   Tambe, Milind ^a  

^a University of Southern California ^*  (United States)

Author keywords

Performance Measurement

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; LARGE SCALE SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS; PERFORMANCE; SENSORS; SET THEORY;

BUILDING BLOCKS; MARKOV DECISION PROCESS;

MULTI AGENT SYSTEMS;

EID: 1142280947     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. D. S. Bernstein, S. Zilberstein, and N. Immerman. The complexity of decentralized control of mdps. In Proceedings of the International Conference on Uncertainty in Artificial Intelligence, 2000.
2. T. Dean and S. Lin. Decomposition techniques for planning in stochastic domains. In Proceedings of the International Joint Conference on Artificial Intelligence, 1995.
3. C. Excelente-Toledo and N. Jennings. Learning to select a coordination mechanism. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, 2002.
4. C. Gomes, B. Selman, N. Crato, and H. Kautz. Heavy-tailed phenomenon in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning, 24, 2000.
5. H. Jung, M. Tambe, and S. Kulkarni. Argumentation as distributed constraint satisfaction: Applications and results. In Proceedings of the International Conference on Autonomous Agents, 2001.
6. L. Lobjois and M. Lemaitre. Branch and bound algorithm selection by performance prediction. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, 1998.
7. S. Minton, M. D. Johnston, A. Philips, and P. Laird. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In Proceedings of the National Conference on Artificial Intelligence, 1990.
8. P. Modi, H. Jung, M. Tambe, W. Shen, and S. Kulkarni. A dynamic distributed constraint satisfaction approach to resource allocation. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, 2001.
9. R. Musick and S. Russell. How long it will take? In Proceedings of the National Conference on Artificial Intelligence, 1992.
10. R. Parr. Flexible decomposition algorithms for weakly coupled Markov decision problems. In Proceedings of the International Conference on Uncertainty in Artificial Intelligence, 1998.
11. J. Pineau, N. Roy, and S. Thrun. A hierarchical approach to POMDP planning and execution. In Proceedings of the ICML Workshop on Hierarchy and Memory in Reinforcement Learning, 2001.
12. N. Prasad and V. Lesser. The use of meta-level information in learning situation-specific coordination. In Proceedings of the International Joint Conference on Artificial Intelligence, 1997.
13. D. Pynadath and M. Tambe. The communicative multiagent team decision problem: analyzing teamwork theories and models. Journal of Artificial Intelligence Research, 2002.
14. O. Rana. Performance management of mobile agent systems. In Proceedings of the International Conference on Autonomous Agents, 2000.
15. M. C. Silaghi, D. Sam-Haroud, and B. V. Fallings. Asynchronous search with aggregations. In Proceedings of the National Conference on Artificial Intelligence, 2000.
16. P. Xuan and V. Lesser. Multi-agent policies: from centralized ones to decentralized ones. In Proceedings of the International Conference on Autonomous Agents, 2002.
17. M. Yokoo and K. Hirayama. Distributed constraint satisfaction algorithm for complex local problems. In Proceedings of the International Conference on Multi-Agent Systems, 1998.
18. W. Zhang and L. Wittenburg. Distributed breakout revisited. In Proceedings of the National Conference on Artificial Intelligence, 2002.