Sciweavers

Share
QEST
2005
IEEE

An approximation algorithm for labelled Markov processes: towards realistic approximation

10 years 10 days ago
An approximation algorithm for labelled Markov processes: towards realistic approximation
Abstract— Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not been clear whether this scheme could be used in practice since it involves inverting a stochastic kernel. We describe a Monte-Carlobased implementation scheme for this approximation algorithm. This is, to the best of our knowledge, the first implementation of this approximation scheme. The implementation involves some novel ideas about how to estimate infs using sampling and also replacing the explicit description of subsets of the state space by tests for membership. It is hoped that this work will enable more applications of continuous probabilistic LMP theory to emerge.
Alexandre Bouchard-Côté, Norm Ferns,
Added 25 Jun 2010
Updated 25 Jun 2010
Type Conference
Year 2005
Where QEST
Authors Alexandre Bouchard-Côté, Norm Ferns, Prakash Panangaden, Doina Precup
Comments (0)
books