DocumentCode :
2805701
Title :
A New Interpolation Scheme in Grid-Based Approximation for POMDPs
Author :
Zhang, Jing ; Kountanis, Dionysios I.
Author_Institution :
Dept. of Comput. Sci., Western Michigan Univ., Kalamazoo, MI, USA
fYear :
2009
fDate :
11-13 Dec. 2009
Firstpage :
1
Lastpage :
4
Abstract :
Finding a solution to the scalable partially observable Markov decision process (POMDP) has received considerable attention, since the POMDP framework represents an important tool to model a rich variety of real world sequential decision processes. Due to the intractability of computing exact solutions for POMDPs the researchers in the literature are seeking approximation solutions. The approximation by value iterating over a finite set of belief points is know as grid-based method. This paper proposes a special interpolation scheme collecting reachable belief points to form the finite belief set. The approach is based on the observation that reachable beliefs are what we are really interested in other than those arbitrary ones. The experiments on three benchmark problems show that our approach generates very good results.
Keywords :
Markov processes; grid computing; interpolation; software agents; grid based approximation; interpolation scheme; partially observable Markov decision process; sequential decision process; value iteration approximation; Artificial intelligence; Computer science; Intelligent agent; Intelligent sensors; Interpolation; Nearest neighbor searches; Polynomials; Probability distribution; Stochastic processes; Uncertainty;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-4507-3
Electronic_ISBN :
978-1-4244-4507-3
Type :
conf
DOI :
10.1109/CISE.2009.5362704
Filename :
5362704
Link To Document :
بازگشت