Computer Science – Artificial Intelligence
Scientific paper
2012-03-15
Computer Science
Artificial Intelligence
Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)
Scientific paper
Decentralized POMDPs provide an expressive framework for multi-agent sequential decision making. While fnite-horizon DECPOMDPs have enjoyed signifcant success, progress remains slow for the infnite-horizon case mainly due to the inherent complexity of optimizing stochastic controllers representing agent policies. We present a promising new class of algorithms for the infnite-horizon case, which recasts the optimization problem as inference in a mixture of DBNs. An attractive feature of this approach is the straightforward adoption of existing inference techniques in DBNs for solving DEC-POMDPs and supporting richer representations such as factored or continuous states and actions. We also derive the Expectation Maximization (EM) algorithm to optimize the joint policy represented as DBNs. Experiments on benchmark domains show that EM compares favorably against the state-of-the-art solvers.
Kumar Akshat
Zilberstein Shlomo
No associations
LandOfFree
Anytime Planning for Decentralized POMDPs using Expectation Maximization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Anytime Planning for Decentralized POMDPs using Expectation Maximization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Anytime Planning for Decentralized POMDPs using Expectation Maximization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-32206