An MCMC Approach to Solving Hybrid Factored MDPs

Explore this paper's citation graph

Summary

This work proposes a novel Markov chain Monte Carlo (MCMC) method for finding the most violated constraint of a relaxed HALP, which does not require the discretization of continuous variables, searches the space of constraints intelligently based on the structure of factored MDPs, and its space complexity is linear in the number of variables.

Type
article
Published
2005-07-30
Cited by
19
References
28

Keywords

Mathematical optimization, Markov decision process, Computer science, Bottleneck, Markov chain Monte Carlo

References

Cited by

Related papers