Efficient solutions to factored MDPs with imprecise transition probabilities
From MaRDI portal
Publication:646498
DOI10.1016/j.artint.2011.01.001zbMath1230.90115OpenAlexW2145495721WikidataQ62047361 ScholiaQ62047361MaRDI QIDQ646498
Leliane Nunes de Barros, Scott Sanner, Karina Valdivia Delgado
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
Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Related Items (10)
The complexity of reachability in parametric Markov decision processes ⋮ BOUNDED-PARAMETER PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES: FRAMEWORK AND ALGORITHM ⋮ Efficient approximate linear programming for factored MDPs ⋮ Real-time dynamic programming for Markov decision processes with imprecise probabilities ⋮ Robust topological policy iteration for infinite horizon bounded Markov decision processes ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes ⋮ A survey of decision making and optimization under uncertainty ⋮ Robust planning with incomplete domain models ⋮ Advanced SMT techniques for weighted model integration ⋮ A Sufficient Statistic for Influence in Structured Multiagent Environments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal control of diffusion processes with reflection
- Using probability trees to compute marginals with imprecise probabilities
- Credal networks
- Bounded-parameter Markov decision processes
- Graphical models for imprecise probabilities
- Graph-Based Algorithms for Boolean Function Manipulation
- An Analysis of Stochastic Shortest Path Problems
- Markov Decision Processes with Imprecise Transition Probabilities
- Markovian Decision Processes with Uncertain Transition Probabilities
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Stochastic Games
This page was built for publication: Efficient solutions to factored MDPs with imprecise transition probabilities