Towards Efficient Computation of Quality Bounded Solutions in POMDPs: Expected Value Approximation and Dynamic Disjunctive Beliefs

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...

Full description

Saved in:
Bibliographic Details
Main Authors: VARAKANTHAM, Pradeep Reddy, Maheswaran, Rajiv, GUPTA, Tapana, Tambe, Milind
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2007
Subjects:
Artificial Intelligence and Robotics
Business
Operations Research, Systems Engineering and Industrial Engineering
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

Internet

https://ink.library.smu.edu.sg/sis_research/956
https://ink.library.smu.edu.sg/context/sis_research/article/1955/viewcontent/IJCAI07.pdf

Similar Items