Automated Generation of Interaction Graphs for Value-Factored Dec-POMDPs

William Yeoh, Akshat Kumar, and Shlomo Zilberstein. Automated Generation of Interaction Graphs for Value-Factored Dec-POMDPs. Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI), 411-417, Beijing, China, 2013.

Abstract

The Decentralized Partially Observable Markov Decision Process (Dec-POMDP) is a powerful model for multiagent planning under uncertainty, but its applicability is hindered by its high complexity – solving Dec-POMDPs optimally is NEXP-hard. Recently, Kumar et al. introduced the Value Factorization (VF) framework, which exploits decomposable value functions that can be factored into subfunctions. This framework has been shown to be a generalization of several models that leverage sparse agent interactions such as TI-Dec-MDPs, ND-POMDPs and TD-POMDPs. Existing algorithms for these models assume that the interaction graph of the problem is given. In this paper, we introduce three algorithms to automatically generate interaction graphs for models within the VF framework and establish lower and upper bounds on the expected reward of an optimal joint policy. We illustrate experimentally the benefits of these techniques for sensor placement in a decentralized tracking application.

Bibtex entry:

@inproceedings{YKZijcai13,
  author	= {William Yeoh and Akshat Kumar and Shlomo Zilberstein},
  title		= {Automated Generation of Interaction Graphs for Value-Factored
                   Dec-POMDPs},
  booktitle     = {Proceedings of the Twenty-Third International Joint Conference on
                   Artificial Intelligence},
  year		= {2013},
  pages		= {411-417},
  address       = {Beijing, China},
  url		= {http://rbr.cs.umass.edu/shlomo/papers/YKZijcai13.html}
}

shlomo@cs.umass.edu