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

• المؤلفون الرئيسيون: VARAKANTHAM, Pradeep Reddy, Maheswaran, Rajiv, GUPTA, Tapana, Tambe, Milind
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2007
• الموضوعات: Artificial Intelligence and Robotics; Business; Operations Research, Systems Engineering and Industrial Engineering
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/956; https://ink.library.smu.edu.sg/context/sis_research/article/1955/viewcontent/IJCAI07.pdf

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