Region-Based Approximations for Planning in Stochastic Domains
classification
💻 cs.AI
keywords
pomdpsdomainsobservableplanningsolvestochasticaccuracyapproximate
read the original abstract
This paper is concerned with planning in stochastic domains by means of partially observable Markov decision processes (POMDPs). POMDPs are difficult to solve. This paper identifies a subclass of POMDPs called region observable POMDPs, which are easier to solve and can be used to approximate general POMDPs to arbitrary accuracy.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.