Towards Efficient Computation of Quality Bounded Solutions in POMDPs: Expected Value Approximation and Dynamic Disjunctive Beliefs
While POMDPs (partially observable markov decision problems) are a popular computational model with wide-ranging applications, the computational cost for optimal policy generation is prohibitive. Researchers are investigating ever-more efficient algorithms, yet many applications demand such algorith...
Saved in:
Main Authors: | VARAKANTHAM, Pradeep Reddy, Maheswaran, Rajiv, GUPTA, Tapana, 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/956 https://ink.library.smu.edu.sg/context/sis_research/article/1955/viewcontent/IJCAI07.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Exploiting Belief Bounds: Practical POMDPs for Personal Assistant Agents
by: VARAKANTHAM, Pradeep, et al.
Published: (2005) -
Implementation Techniques for Solving POMDPs in Personal Assistant Domains
by: VARAKANTHAM, Pradeep Reddy, et al.
Published: (2006) -
Networked Distributed POMDPs: A Synthesis of Distributed Constraint Optimization and POMDPs
by: NAIR, Ranjit, et al.
Published: (2005) -
Winning back the CUP for Distributed POMDPs: Planning over continuous belief spaces
by: VARAKANTHAM, Pradeep, et al.
Published: (2006) -
Letting loose a SPIDER on a network of POMDPs: Generating quality guranteed policies
by: VARAKANTHAM, Pradeep Reddy, et al.
Published: (2007)