Decentralized control of cooperative systems: Categorization and complexity analysis

Journal of Artificial Intelligence Research

Volumn 22, Issue , 2004, Pages 143-174

  Goldman, Claudia V ^a   Zilberstein, Shlomo ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECENTRALIZED CONTROL; DECISION MAKING; DISTRIBUTED COMPUTER SYSTEMS; PLANNING; POLYNOMIALS; PROBLEM SOLVING;

COOPERATIVE SYSTEMS; DIRECT COMMUNICATION; INFORMATION SHARING; PLANNING ALGORITHMS;

COMPUTER SUPPORTED COOPERATIVE WORK;

EID: 27344449757     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1427     Document Type: Article

References (39)

1. Aumann, R. J., & Hart, S. (Eds.). (1994). Handbook of Game Theory with Economic Applications, Vol. 2. Elsevier, North Holland.
2. Balch, T., & Arkin, R. C. (1994). Communication in reactive multiagent robotic systems. Autonomous Robots, 1, 1-25.
3. Becker, R., Zilberstein, S., Lesser, V., & Goldman, C. V. (2003). Transition-independent decentralized Markov decision processes. In Proceedings of the Second International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 41-48, Melbourne, Australia.
4. Bernstein, D., Givan, R., Immerman, N., & Zilberstein, S. (2002). The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research, 27(4), 819-840.
5. Blume, A., & Sobel, J. (1995). Communication-proof equilibria in cheap-talk games. Journal of Economic Theory, 65, 359-382.
6. Boutilier, C. (1999). Sequential optimality and coordination in multiagent systems. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 478-485, Stockholm, Sweden.
7. Boutilier, C., Dearden, R., & Goldszmidt, M. (1995). Exploiting structure in policy construction. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 1104-1111, Montreal, Canada.
8. Claus, C., & Boutilier, C. (1998). The dynamics of reinforcement learning in cooperative multiagent systems. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pp. 746-752, Madison, WI.
9. Dean, T., Kaelbling, L. P., Kirman, J., & Nicholson, A. (1995). Planning under time constraints in stochastic domains. Artificial Intelligence, 76, 35-74.
10. Decker, K. S., & Lesser, V. R. (1992). Generalizing the partial global planning algorithm. International Journal of Intelligent Cooperative Information Systems, 1(2), 319-346.
11. Durfee, E. H. (1988). Coordination of Distributed Problem Solvers. Kluwer Academic Publishers, Boston.
12. Feng, Z., & Hansen, E. A. (2002). Symbolic heuristic search for factored Markov decision processes. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, pp. 455-460, Edmonton, Alberta, Canada.
13. Finin, T., Labrou, Y., & Mayfield, J. (1997). KQML as an agent communication language. In Bradshaw, J. (Ed.), Software Agents. MIT Press.
14. Goldman, C. V., Allen, M., & Zilberstein, S. (2004). Decentralized language learning through acting. In Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1006-1013, New York City, NY.
15. Goldman, C. V., & Zilberstein, S. (2003). Optimizing information exchange in cooperative multi-agent systems. In Proceedings of the Second International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 137-144, Melbourne, Australia.
16. Goldman, C. V., & Zilberstein, S. (2004). Goal-oriented Dec-MDPs with direct communication. Technical report 04-44, University of Massachusetts at Amherst, Computer Science.
17. Grosz, B. J., & Kraus, S. (1996). Collaborative plans for complex group action. Artificial Intelligence, 86(2), 269-357.
18. Guestrin, C., & Gordon, G. (2002). Distributed planning in hierarchical factored MDPs. In Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence, pp. 197-206, Edmonton, Canada.
19. Guestrin, C., Koller, D., & Parr, R. (2001). Multiagent planning with factored MDPs. In Advances in Neural Information Processing Systems, pp. 1523-1530, Vancouver, British Columbia.
20. Guestrin, C., Koller, D., Parr, R., & Venkataraman, S. (2003). Efficient solution algorithms for factored MDPs. Journal of Artificial Intelligence Research, 19, 399-468.
21. Hansen, E., Bernstein, D., & Zilberstein, S. (2004). Dynamic programming for partially observable stochastic games. In Proceedings of the Nineteenth National Conference on Artificial Intelligence, pp. 709-715, San Jose, California.
22. Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998). Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101.
23. Luce, R. D., & Raiffa, H. (1957). Games and Decisions. John Wiley and Sons, Inc.
24. Nair, R., Tambe, M., Yokoo, M., Pynadath, D., & Marsella, S. (2003). Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 705-711, Acapulco, Mexico.
25. Papadimitriou, C. H., & Tsitsiklis, J. (1982). On the complexity of designing distributed protocols. Information and Control, 53, 211-218.
26. Papadimitriou, C. H., & Tsitsiklis, J. (1986). Intractable problems in control theory. SIAM Journal on Control and Optimization, 24(4:), 639-654.
27. Papadimitriou, C. H., & Tsitsiklis, J. (1987). The complexity of Markov decision processes. Mathematics of Operations Research, 12(3), 441-450.
28. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann Publishers, Inc., San Mateo, California.
29. Peshkin, L., Kim, K.-E., Meuleau, N., & Kaelbling, L. P. (2000). Learning to cooperate via policy search. In Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, pp. 489-496, Stanford, CA.
30. Pynadath, D. V., & Tambe, M. (2002). The communicative multiagent team decision problem: Analyzing teamwork theories and models. Journal of Artificial Intelligence Research, 16, 389-423.
31. Rabinovich, Z., Goldman, C. V., & Rosenschein, J. S. (2003). The complexity of multiagent systems: The price of silence. In Proceedings of the Second International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 1102-1103, Melbourne, Australia.
32. Roth, M., Vail, D., & Veloso, M. (2003). A real-time world model for multi-robot teams with high-latency communication. In Proceedings of IROS, pp. 2494-2499.
33. Russell, S., & Wefald, E. (1991). Principles of metareasoning. Artificial Intelligence, 49, 361-395.
34. Schneider, J., Wong, W.-K., Moore, A., & Riedmiller, M. (1999). Distributed value functions. In Proceedings of the Sixteenth International Conference on Machine Learning, pp. 371-378.
35. Smallwood, R. D., & Sondik, E. J. (1973). The optimal control of partially observable Markov processes over a finite horizon. Operations Research, 21(5), 1071-1088.
36. Smith, R. G. (1988). The contract net protocol: High level communication and control in a distributed problem solver. In Bond, A. H., & Gasser, L. (Eds.), Readings in Distributed Artificial Intelligence, pp. 357-366. Morgan Kaufmann Publishers, Inc., San Mateo, California.
37. Wärneryd, K. (1993). Cheap talk, coordination, and evolutionary stability. Games and Economic Behavior, 5, 532-546.
38. Wolpert, D. H., Wheeler, K. R., & Tumer, K. (1999). General principles of learning-based multi-agent systems. In Proceedings of the Third International Conference on Autonomous Agents, pp. 77-83, Seattle, Washington.
39. Xuan, P., Lesser, V., & Zilberstein, S. (2001). Communication decisions in multi-agent cooperation: Model and experiments. In Proceedings of the Fifth International Conference on Autonomous Agents, pp. 616-623, Montreal, Canada.