Anytime Planning for Decentralized POMDPs using Expectation Maximization
Decentralized POMDPs provide an expressive framework for multi-agent sequential decision making. While finite-horizon DECPOMDPs have enjoyed signifcant success, progress remains slow for the infinite-horizon case mainly due to the inherent complexity of optimizing stochastic controllers representing...
Saved in:
Main Authors: | KUMAR, Akshat, ZILBERSTEIN, Shlomo |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2010
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2209 https://ink.library.smu.edu.sg/context/sis_research/article/3209/viewcontent/Anytime_Planning_for_Decentralized_POMDPs_using_Expectation_Maximization.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Message-Passing Algorithms for Large Structured Decentralized POMDPs
by: KUMAR, Akshat, et al.
Published: (2011) -
Constraint-Based Dynamic Programming for Decentralized POMDPs with Structured Interactions
by: KUMAR, Akshat, et al.
Published: (2009) -
MAP Estimation for Graphical Models by Likelihood Maximization
by: KUMAR, Akshat, et al.
Published: (2010) -
Point-Based Backup for Decentralized POMPDs: Complexity and New Algorithms
by: KUMAR, Akshat, et al.
Published: (2010) -
Automated Generation of Interaction Graphs for Value-Factored Decentralized POMDPs
by: YEOH, William, et al.
Published: (2013)