Constraint-Based Dynamic Programming for Decentralized POMDPs with Structured Interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited scalability of solution techniques has restricted the applicability of the model. To overcome this computational barrier, r...
Saved in:
Main Authors: | KUMAR, Akshat, ZILBERSTEIN, Shlomo |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2009
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2212 https://ink.library.smu.edu.sg/context/sis_research/article/3212/viewcontent/Constraint_Based_Dynamic_Programming_for_Decentralized_POMDPs_with_Structured_Interactions.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) -
Anytime Planning for Decentralized POMDPs using Expectation Maximization
by: KUMAR, Akshat, et al.
Published: (2010) -
Automated Generation of Interaction Graphs for Value-Factored Decentralized POMDPs
by: YEOH, William, et al.
Published: (2013) -
Point-Based Backup for Decentralized POMPDs: Complexity and New Algorithms
by: KUMAR, Akshat, et al.
Published: (2010) -
Dynamic Programming Approximations for Partially Observable Stochastic Games
by: KUMAR, Akshat, et al.
Published: (2009)