Efficient solutions to factored MDPs with imprecise transition probabilities

DOI10.1016/J.ARTINT.2011.01.001MaRDI QIDQ646498zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

Markov decision processprobabilistic planningrobust planning

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Dynamic programming (90C39) Sensitivity, stability, parametric optimization (90C31) Markov and semi-Markov decision processes (90C40)

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

Cites work

• scientific article; zbMATH DE number 48344 (Why is no real title available?)
• scientific article; zbMATH DE number 1315585 (Why is no real title available?)
• scientific article; zbMATH DE number 2000828 (Why is no real title available?)
• An Analysis of Stochastic Shortest Path Problems
• Bounded-parameter Markov decision processes
• Credal networks
• Graph-Based Algorithms for Boolean Function Manipulation
• Graphical models for imprecise probabilities
• Markov Decision Processes with Imprecise Transition Probabilities
• Markovian Decision Processes with Uncertain Transition Probabilities
• Optimal control of diffusion processes with reflection
• Robust Control of Markov Decision Processes with Uncertain Transition Matrices
• Stochastic Games
• Using probability trees to compute marginals with imprecise probabilities

Cited in

(16)

• Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
• scientific article; zbMATH DE number 2000828 (Why is no real title available?)
• scientific article; zbMATH DE number 2247690 (Why is no real title available?)
• On the Complexity of Reachability in Parametric Markov Decision Processes
• Solving factored MDPs using non-homogeneous partitions
• A sufficient statistic for influence in structured multiagent environments
• Bounded-parameter partially observable Markov decision processes: framework and algorithm
• Anytime algorithms for solving possibilistic MDPs and hybrid MDPs
• The complexity of reachability in parametric Markov decision processes
• Advanced SMT techniques for weighted model integration
• Robust topological policy iteration for infinite horizon bounded Markov decision processes
• Robust planning with incomplete domain models
• Parameter synthesis for Markov models: covering the parameter space
• Efficient approximate linear programming for factored MDPs
• Real-time dynamic programming for Markov decision processes with imprecise probabilities
• A survey of decision making and optimization under uncertainty

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)