Efficient solutions to factored MDPs with imprecise transition probabilities
DOI10.1016/J.ARTINT.2011.01.001zbMATH Open1230.90115OpenAlexW2145495721WikidataQ62047361 ScholiaQ62047361MaRDI QIDQ646498FDOQ646498
Authors: Karina Valdivia Delgado, Scott Sanner, Leliane Nunes de Barros 
Publication date: 17 November 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2011.01.001
Recommendations
- scientific article; zbMATH DE number 2000828
- Solving factored MDPs using non-homogeneous partitions
- Efficient approximate linear programming for factored MDPs
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
- Solving factored mdps with hybrid state and action variables
- Markov Decision Processes with Imprecise Transition Probabilities
- Generalizing Markov decision processes to imprecise probabilities
- Stochastic dynamic programming with factored representations
- Partially observable Markov decision processes with imprecise parameters
Management decision making, including multiple objectives (90B50) Dynamic programming (90C39) Sensitivity, stability, parametric optimization (90C31) Markov and semi-Markov decision processes (90C40)
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- Stochastic Games
- Title not available (Why is that?)
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- An Analysis of Stochastic Shortest Path Problems
- Title not available (Why is that?)
- Optimal control of diffusion processes with reflection
- Credal networks
- Title not available (Why is that?)
- Graphical models for imprecise probabilities
- Bounded-parameter Markov decision processes
- Using probability trees to compute marginals with imprecise probabilities
- Markov Decision Processes with Imprecise Transition Probabilities
- Markovian Decision Processes with Uncertain Transition Probabilities
Cited In (16)
- Robust topological policy iteration for infinite horizon bounded Markov decision processes
- Anytime algorithms for solving possibilistic MDPs and hybrid MDPs
- Parameter synthesis for Markov models: covering the parameter space
- A survey of decision making and optimization under uncertainty
- A Sufficient Statistic for Influence in Structured Multiagent Environments
- Bounded-parameter partially observable Markov decision processes: framework and algorithm
- The complexity of reachability in parametric Markov decision processes
- On the Complexity of Reachability in Parametric Markov Decision Processes
- Title not available (Why is that?)
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
- Advanced SMT techniques for weighted model integration
- Solving factored MDPs using non-homogeneous partitions
- Efficient approximate linear programming for factored MDPs
- Real-time dynamic programming for Markov decision processes with imprecise probabilities
- Title not available (Why is that?)
- Robust planning with incomplete domain models
This page was built for publication: Efficient solutions to factored MDPs with imprecise transition probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646498)
