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
- OpenAlex
- https://openalex.org/W51537834
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:17842611
Keywords
Mathematical optimization, Markov decision process, Computer science, Bottleneck, Markov chain Monte Carlo
References
- Planning under uncertainty in complex structured environments
- Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
- Exploiting Structure in Policy Construction
- The Linear Programming Approach to Approximate Dynamic Programming
- Introduction to linear optimization
- Auxiliary Variable Methods for Markov Chain Monte Carlo with Applications
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Polynomial approximation—a new computational technique in dynamic programming: Allocation processes
- A model for reasoning about persistence and causation
- Optimization by Simulated Annealing
- Generalized polynomial approximations in Markovian decision processes
- Equation of State Calculations by Fast Computing Machines
- Hybrid Monte Carlo
- Rao-Blackwellisation of sampling schemes
- Markov Decision Processes: Discrete Stochastic Dynamic Programming
- Max-norm Projections for Factored MDPs
- An Introduction to MCMC for Machine Learning
- Monte Carlo Sampling Methods Using Markov Chains and Their Applications
- Linear Program Approximations for Factored Continuous-State Markov Decision Processes
- Direct value-approximation for factored MDPs
Cited by
- Approximate Linear Programming for Solving Hybrid Factored MDPs
- Learning Basis Functions in Hybrid Domains
- Probabilistic inference for solving (PO) MDPs
- Solving Factored MDPs with Exponential-Family Transition Models
- Efficient approximate linear programming for factored MDPs
- Planning in hybrid structured stochastic domains
- Integrated resource allocation and planning in stochastic multiagent environments
- Partitioned Linear Programming Approximations for MDPs
- Clinical time series prediction: towards a hierarchical dynamical system framework
- Probabilistic inference for solving discrete and continuous state Markov Decision Processes
- Solving Factored MDPs with Hybrid State and Action Variables
- Continuous Time Bayesian Networks for Reasoning and Decision Making in Finance
- Bayesian inference for motion control and planning
- Planning with Markov Decision Processes: An AI Perspective
- Intelligent Planning for Autonomous Underwater Vehicles RSMG Report 3 - Thesis Proposal
- On the Smoothness of Linear Value Function Approximations
- Overview of Linear Program Approximations for Factored Continuous and Hybrid-State Markov Decision Processes
- Expectation-maximization Methods for Solving (po)mdps and Optimal Control Problems
- Bayesian Time Series Models: Expectation maximisation methods for solving (PO)MDPs and optimal control problems
Related papers
- Efficient Solution Algorithms for Factored MDPs
- Exploiting Structure in Policy Construction
- Computing Factored Value Functions for Policies in Structured MDPs
- Generalized polynomial approximations in Markovian decision processes
- A model for reasoning about persistence and causation
- Dynamic Programming
- Markov Decision Processes: Discrete Stochastic Dynamic Programming
- Greedy linear value-approximation for factored Markov decision processes
- The Linear Programming Approach to Approximate Dynamic Programming
- Solving Factored MDPs with Continuous and Discrete Variables