Point-Based Backup for Decentralized POMPDs: Complexity and New Algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up existing algorithms, largely due to the use of point-based methods. Performing point-based backup is a fundamental operati...
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/2210 https://ink.library.smu.edu.sg/context/sis_research/article/3210/viewcontent/Point_Based_Backup_for_Decentralized_POMPDs__Complexity_and_New_Algorithms.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) -
Constraint-Based Dynamic Programming for Decentralized POMDPs with Structured Interactions
by: KUMAR, Akshat, et al.
Published: (2009) -
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)