Exact decomposition approaches for Markov decision processes: a survey

DOI10.1155/2010/659432zbMath1198.90385OpenAlexW2091387107WikidataQ58650427 ScholiaQ58650427MaRDI QIDQ606196

Cherki Daoui, Mohamed Tkiouat, Mohammed Abbad

Publication date: 16 November 2010

Published in: Advances in Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/227280

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Temporal concatenation for Markov decision processes, On some algorithms for limiting average Markov decision processes, Unnamed Item, Approximated timed reachability graphs for the robust control of discrete event systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning and acting in partially observable stochastic domains
• Markov decision processes with exponentially representable discounting
• A decomposition approach for undiscounted two-person zero-sum stochastic games
• Algorithms for aggregated limiting average Markov decision problems
• Abstraction and approximate decision-theoretic planning.
• A decomposition algorithm for limiting average Markov decision problems.
• Hierarchical algorithms for discounted and weighted Markov decision processes
• Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
• Planning in a hierarchy of abstraction spaces
• Sample-path optimality and variance-maximization for Markov decision processes
• Average optimality for continuous-time Markov decision processes with a policy iteration approach
• Finite state Markovian decision processes
• An improved algorithm for solving communicating average reward Markov decision processes
• On some algorithms for limiting average Markov decision processes
• Using Expectation-Maximization for Reinforcement Learning
• Decomposition Principle for Linear Programs
• Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach
• Markov Decision Processes with Variance Minimization: A New Condition and Approach
• Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
• The Complexity of Markov Decision Processes
• Calculating availability and performability measures of repairable computer systems using randomization
• Weighted reward criteria in Competitive Markov Decision Processes
• Decomposition of systems governed by Markov chains
• Optimal decision procedures for finite Markov chains. Part III: General convex systems
• Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey