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...
محفوظ في:
المؤلفون الرئيسيون: | VARAKANTHAM, Pradeep Reddy, Maheswaran, Rajiv, GUPTA, Tapana, Tambe, Milind |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2007
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/956 https://ink.library.smu.edu.sg/context/sis_research/article/1955/viewcontent/IJCAI07.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Singapore Management University |
اللغة: | English |
مواد مشابهة
-
Exploiting Belief Bounds: Practical POMDPs for Personal Assistant Agents
بواسطة: VARAKANTHAM, Pradeep, وآخرون
منشور في: (2005) -
Implementation Techniques for Solving POMDPs in Personal Assistant Domains
بواسطة: VARAKANTHAM, Pradeep Reddy, وآخرون
منشور في: (2006) -
Winning back the CUP for Distributed POMDPs: Planning over continuous belief spaces
بواسطة: VARAKANTHAM, Pradeep, وآخرون
منشور في: (2006) -
Networked Distributed POMDPs: A Synthesis of Distributed Constraint Optimization and POMDPs
بواسطة: NAIR, Ranjit, وآخرون
منشور في: (2005) -
Letting loose a SPIDER on a network of POMDPs: Generating quality guranteed policies
بواسطة: VARAKANTHAM, Pradeep Reddy, وآخرون
منشور في: (2007)