Using mathematical programming to solve factored Markov decision processes with imprecise probabilities

DOI10.1016/j.ijar.2011.04.002zbMath1229.90255OpenAlexW2152240460WikidataQ62047364 ScholiaQ62047364MaRDI QIDQ648368

Karina Valdivia Delgado, Scott Sanner, Fabio Gagliardi Cozman, Leliane Nunes de Barros

Publication date: 22 November 2011

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2011.04.002

zbMATH Keywords

probabilistic planningimprecise Markov decision processes (MDPIPs)multilinear programming

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Related Items (3)

Robust topological policy iteration for infinite horizon bounded Markov decision processes ⋮ A survey of decision making and optimization under uncertainty ⋮ A Sufficient Statistic for Influence in Structured Multiagent Environments

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An inexact-restoration method for nonlinear bilevel programming problems
• Symmetric approximate linear programming for factored MDPs with application to constrained problems
• Discrete time Markov chains with interval probabilities
• A tutorial on geometric programming
• Statistical decision theory and Bayesian analysis. 2nd ed
• Generalized polynomial approximations in Markovian decision processes
• Convex two-level optimization
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• Optimal control of diffusion processes with reflection
• The steepest descent direction for the nonlinear bilevel programming problem
• Problems in multilinear programming.
• Credal networks
• Bounded-parameter Markov decision processes
• Graphical models for imprecise probabilities
• Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
• A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
• Linear Programming and Sequential Decisions
• The Complexity of Markov Decision Processes
• 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
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming

This page was built for publication: Using mathematical programming to solve factored Markov decision processes with imprecise probabilities