Scalable Multiagent Planning using Probabilistic Inference
Multiagent planning has seen much progress with the development of formal models such as Dec-POMDPs. However, the complexity of these models -- NEXP-Complete even for two agents -- has limited scalability. We identify certain mild conditions that are sufficient to make multiagent planning amenable t...
Saved in:
Main Authors: | KUMAR, Akshat, ZILBERSTEIN, Shlomo, TOUSSAINT, Marc |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2011
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2204 https://ink.library.smu.edu.sg/context/sis_research/article/3204/viewcontent/Scalable_Multiagent_Planning_using_Probabilistic_Inference.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Probabilistic Inference Techniques for Scalable Multiagent Decision Making
by: Akshat KUMAR,, et al.
Published: (2015) -
Message Passing Algorithms for MAP Estimation using DC Programming
by: KUMAR, Akshat, et al.
Published: (2012) -
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 Large Structured Decentralized POMDPs
by: KUMAR, Akshat, et al.
Published: (2011)