Conference Proceeding Article
Decentralized POMDPs provide a rigorous framework for multi-agent decision-theoretic planning. However, their high complexity has limited scalability. In this work, we present a promising new class of algorithms based on probabilistic inference for infinite-horizon ND-POMDPs---a restricted Dec-POMDP model. We first transform the policy optimization problem to that of likelihood maximization in a mixture of dynamic Bayes nets (DBNs). We then develop the Expectation-Maximization (EM) algorithm for maximizing the likelihood in this representation. The EM algorithm for ND-POMDPs lends itself naturally to a simple message-passing paradigm guided by the agent interaction graph. It is thus highly scalable w.r.t. the number of agents, can be easily parallelized, and produces good quality solutions.
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
International Conference on Autonomous Agents and Multiagent Systems (AAMAS)
KUMAR, Akshat and Zilberstein, S..
Message-Passing Algorithms for Large Structured Decentralized POMDPs (extended abstract). (2011). International Conference on Autonomous Agents and Multiagent Systems (AAMAS). 1087-1088. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/2207