Decentralized communication strategies for coordinated multi-agent policies

Multi-Robot Systems. From Swarms to Intelligent Automata - Proceedings from the 2005 International Workshop on Multi-Robot Systems

Volumn 3, Issue , 2005, Pages 93-105

  Roth, Maayan ^a   Simmons, Reid ^a   Veloso, Manuela ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Communication; Decentralized POMDP; Distributed execution

Indexed keywords

COMMUNICATION; INDUSTRIAL ROBOTS; INTELLIGENT AGENTS; INTELLIGENT ROBOTS; MULTIPURPOSE ROBOTS; ROBOT LEARNING;

DECENTRALIZED COMMUNICATIONS; DECENTRALIZED POMDP; DISTRIBUTED EXECUTION; FREE COMMUNICATIONS; IMPROVE PERFORMANCE; LOCAL OBSERVATIONS; MULTI AGENT; SINGLE-AGENT;

MULTI AGENT SYSTEMS;

EID: 84903438513     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/1-4020-3389-3_8     Document Type: Conference Paper

References (15)

1. Becker, R., Zilberstein, S., Lesser, V., and Goldman, C. V. (2003). Transition-independent decentralized Markov Decision Processes. In International Joint Conference on Autonomous Agents and Multi-agent Systems.
2. Bernstein, D. S., Zilberstein, S., and Immerman, N. (2000). The complexity of decentralized control of Markov Decision Processes. In Uncertainty in Artificial Intelligence.
3. Cassandra, A. R. POMDP solver software. http://www.cassandra.org/pomdp/ code/index.shtml.
4. Emery-Montemerlo, R., Gordon, G., Schneider, J., and Thrun, S. (2004). Approximate solutions for partially observable stochastic games with common payoffs. In International Joint Conference on Autonomous Agents and Multi-Agent Systems.
5. Hansen, E. A., and Bernstein., D. S., and Zilberstein, S. (2004). Dynamic programming for partially observable stochastic games. In National Conference on Artificial Intelligence.
6. Kaelbling, L. P., and Littman., M. L., and Cassandra, A. R. (1998). Planning and acting in partially observable domains. Artificial Intelligence.
7. Littman, M. L., and Cassandra., A. R., and Kaelbling, L. P. (1995). Learning policies for partially observable environments: Scaling up. In International Conference on Machine Learning.
8. Nair, R., Pynadath, D., Yokoo, M., Tambe, M., and Marsella, S. (2003). Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In International Joint Conference on Artificial Intelligence.
9. Nair, R., Roth, M., Yokoo, M., and Tambe, M. (2004). Communication for improving policy computation in distributed POMDPs. In International Joint Conference on Autonomous Agents and Multi-agent Systems.
10. Papadimitriou, C. H. and Tsitsiklis, J. N. (1987). The complexity of Markov Decision Processes. Mathematics of Operations Research.
11. Peshkin, L., Kim, K.-E., Meuleau, N., and Kaelbling, L. P. (2000). Learning to cooperate via policy search. In Uncertainty in Artificial Intelligence.
12. Poupart, P., and Ortiz., L. E., and Boutilier, C. (2001). Value-directed sampling methods for monitoring pomdps. In Uncertainty in Artificial Intelligence.
13. Pynadath, D. V. and Tambe, M. (2002). The communicative Multiagent Team Decision Problem: Analyzing teamwork theories and models. Journal of AI Research.
14. Thrun, S. (2000). Monte carlo pomdps. In Neural Information Processing Systems.
15. Xuan, P. and Lesser, V. (2002). Multi-agent policies: From centralized ones to decentralized ones. In International Joint Conference on Autonomous Agents and Multi-agent Systems.