Message-Passing Algorithms for Large Structured Decentralized POMDPs
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...
Saved in:
Main Authors: | KUMAR, Akshat, ZILBERSTEIN, Shlomo |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2011
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2207 https://ink.library.smu.edu.sg/context/sis_research/article/3207/viewcontent/Message_Passing_Algorithms_for_Large_Structured_Decentralized_POMDPs__extended_abstract_.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Constraint-Based Dynamic Programming for Decentralized POMDPs with Structured Interactions
by: KUMAR, Akshat, et al.
Published: (2009) -
Anytime Planning for Decentralized POMDPs using Expectation Maximization
by: KUMAR, Akshat, et al.
Published: (2010) -
Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation
by: KUMAR, Akshat, et al.
Published: (2011) -
Message Passing Algorithms for MAP Estimation using DC Programming
by: KUMAR, Akshat, et al.
Published: (2012) -
Point-Based Backup for Decentralized POMPDs: Complexity and New Algorithms
by: KUMAR, Akshat, et al.
Published: (2010)