Letting loose a SPIDER on a network of POMDPs: Generating quality guranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the significant complexity of solving distributed POMDPs, particularly as we scale up the numbers of agents, one popular approach...
Saved in:
Main Authors: | VARAKANTHAM, Pradeep Reddy, Marecki, Janusz, Yokoo, Makoto, Tambe, Milind |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2007
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/947 http://portal.acm.org/citation.cfm?id=1329388 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Networked Distributed POMDPs: A Synthesis of Distributed Constraint Optimization and POMDPs
by: NAIR, Ranjit, et al.
Published: (2005) -
Introducing Communication in Dis-POMDPs with Locality of Interaction
by: TASAKI, Makoto, et al.
Published: (2010) -
Winning back the CUP for Distributed POMDPs: Planning over continuous belief spaces
by: VARAKANTHAM, Pradeep, et al.
Published: (2006) -
Implementation Techniques for Solving POMDPs in Personal Assistant Domains
by: VARAKANTHAM, Pradeep Reddy, et al.
Published: (2006) -
Towards Efficient Computation of Quality Bounded Solutions in POMDPs: Expected Value Approximation and Dynamic Disjunctive Beliefs
by: VARAKANTHAM, Pradeep Reddy, et al.
Published: (2007)