%0 Journal Article
%T Preprocessing for Point-Based Algorithms of POMDP<br>基于点的POMDP算法的预处理方法
%A BIAN Ai-Hua
%A WANG Chong-Jun
%A CHEN Shi-Fu
%A <br>卞爱华
%A 王崇骏
%A 陈世福
%J 软件学报
%D 2008
%I 
%X Point-Based algorithms are a class of approximation methods for partially observable Markov decision processes(POMDP).They do backup operators on a belief set only,so linear programming is avoided and fewer intermediate variables are needed,and the bottleneck turns from selecting vectors to generating vectors.But when generate vectors,there will be a great deal of repeated and meaningless computing.This paper will propose a preprocessing method for point-based algorithms(PPBA).This method preprocesses each sampled belief point,and before generating a-vectors it estimates which action and a-vectors to be selected f'trst,in so doing repeated computing is eliminated.Base-vector is also defined in this paper,which cancels meaningless computing with sparseness of problem.Experiments on Perseus show that,PPBA accelerates the performance greatly.
%K POMDP
%K value iteration
%K point-based algorithm
%K preprocessing
%K base-vector<br>POMDP
%K 值迭代
%K 基于点的算法
%K 预处理
%K 基向量
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=D79D1C5B7ADF687699CEADE0E043A831&yid=67289AFF6305E306&vid=2A8D03AD8076A2E3&iid=B31275AF3241DB2D&sid=A2484BFF38B01808&eid=525C740F5A062BF4&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=16