Introducing communication in Dis-POMDPs with locality of interaction

Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008

Volumn , Issue , 2008, Pages 169-175

  Tasaki, Makoto ^a   Yabu, Yuichi ^a   Iwanari, Yuki ^a   Yokoo, Makoto ^a   Tambe, Milind ^b   Marecki, Janusz ^b   Varakantham, Pradeep ^c  

^a KYUSHU UNIVERSITY   (Japan)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIAL GROWTHS; FIXED NUMBERS; LOCAL POLICIES; MULTI-AGENT SYSTEMS; POINT-BASED; REPRESENTATIVE POINTS; SCALE-UP; TIME HORIZONS; VALUE FUNCTIONS; VALUE ITERATION ALGORITHMS;

ALGORITHMS; COMMUNICATION;

AGENTS;

EID: 62949185084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIIAT.2008.316     Document Type: Conference Paper

References (10)

1. D. S. Bernstein, S. Zilberstein, and N. Immerman. The complexity of decentralized control of markov decision processes. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence (UAI-00), pages 32-37, 2000.
2. C. V. Goldman and S. Zilberstein. Optimizing information exchange in cooperative multi-agent systems. In Proceedings of the Second International Joint Conference on Autonomous Agents and Multi-agent Systems (AAMAS-03), pages 137-144, 2003.
3. R. Nair, M. Roth, M. Yokoo, and M. Tambe. Communication for improving policy computation in distributed pomdps. In Proceedings of the Third International joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-04), pages 1096-1103, 2004.
4. R. Nair, P. Varakantham, M. Tambe, and M. Yokoo. Networked distributed POMDPs: A synthesis of distributed constraint optimization and POMDPs. In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), pages 133-139, 2005.
5. J. Pineau, G. Gordon, and S. Thrun. Anytime point-based approximations for large POMDPs. Journal of Artificial Intelligence Research, 227:335-380, 2006.
6. M. Roth, R. Simmons, and M. Veloso. Exploiting factored representations for decentralized execution in multiagent teams. In Proceedings of the 6th International joint conference on Autonomous agents and Multi-agent Systems (AAMAS-07), pages 457-463, 2007.
7. J. Shen, R. Becker, and V. Lesser. Agent interaction in distributed pomdps and its implications on complexity. In Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (AAMAS-06), pages 529-536, 2006.
8. *: A heuristic search algorithm for solving decentralized POMDPs. In Proceedings of the 21th Conference on Uncertainty in Artificial Intelligence (UAI-05), pages 576-590, 2005.
9. P. Varakantham, J. Marecki, Y. Yabu, M. Tambe, and M. Yokoo. Letting loose a SPIDER on a network of POMDPs: Generating quality guaranteed policies. In Proceedings of the 6th International Joint Conference on Autonomous Agents and Multi-agent Systems (AAMAS-07), pages 822-829, May 2007.
10. M. Yokoo and K. Hirayama. Distributed breakout algorithm for solving distributed constraint satisfaction problems. In Proceeding of the Second International Conference on Multiagent Systems (ICMAS-96), pages 401-408, 1996.