Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/19

Information filtering for planning in partially observable stochastic domains

Authors Zhang, Nevin Lianwen
Boerlage, Brent
Issue Date 1995-01-24
Summary Partially observable decision processes (POMDP) can be used as a model for planning in stochastic domains. This paper considers the problem of computing an optimal policy for a finite horizon POMDP. The task is difficult because the decision at any time point depends upon information from all previous time points. We propose to filter out inconsistencies and insignificant details in the collection of information being passed from one time point to the next. This reduces the number of possible information states and hence speeds up computation. A bound on the sacrifice of optimality due to information filtering is given, which provides a way for rading off between computational complexity and optimality.
Language English
Format Technical report
Access
Files in this item:
File Description Size Format
tr94-36.pdf 226915 B Adobe PDF