Exact decomposition approaches for Markov decision processes: a survey
DOI10.1155/2010/659432zbMATH Open1198.90385OpenAlexW2091387107WikidataQ58650427 ScholiaQ58650427MaRDI QIDQ606196FDOQ606196
Authors: 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
Recommendations
- A decomposition algorithm for limiting average Markov decision problems.
- Algorithms for aggregated limiting average Markov decision problems
- scientific article; zbMATH DE number 3961379
- The control of a two-level Markov decision process by time aggregation
- A methodology for computation reduction for specially structured large scale Markov decision problems
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Markov and semi-Markov decision processes (90C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planning and acting in partially observable stochastic domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Complexity of Markov Decision Processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite state Markovian decision processes
- Decomposition Principle for Linear Programs
- Title not available (Why is that?)
- Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
- Title not available (Why is that?)
- Title not available (Why is that?)
- A decomposition approach for undiscounted two-person zero-sum stochastic games
- Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
- Using Expectation-Maximization for Reinforcement Learning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal decision procedures for finite Markov chains. Part III: General convex systems
- Markov Decision Processes with Variance Minimization: A New Condition and Approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Markov decision processes with exponentially representable discounting
- Average optimality for continuous-time Markov decision processes with a policy iteration approach
- Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach
- 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
- Planning in a hierarchy of abstraction spaces
- Sample-path optimality and variance-maximization for Markov decision processes
- An improved algorithm for solving communicating average reward Markov decision processes
- On some algorithms for limiting average Markov decision processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Approximated timed reachability graphs for the robust control of discrete event systems
- Time aggregated Markov decision processes via standard dynamic programming
- Decomposable Markov decision processes: A fluid optimization approach
- Aggregation of the policy iteration method for nearly completely decomposable Markov chains
- Temporal concatenation for Markov decision processes
- Algorithms for aggregated limiting average Markov decision problems
- A decomposition algorithm for limiting average Markov decision problems.
- A new parallelized of hierarchical value iteration algorithm for discounted Markov decision processes
- On some algorithms for limiting average Markov decision processes
- Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach
- Title not available (Why is that?)
This page was built for publication: Exact decomposition approaches for Markov decision processes: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606196)