Graph partitioning techniques for Markov Decision Processes decomposition
Explore this paper's citation graph
Summary
Automated decomposition techniques for MDPs are presented, based on methods which have been developed for graph partitioning problems for solving approximately or exactly large Markov Decision Processes.
- Type
- article
- Published
- 2002-07-21
- Cited by
- 11
- References
- 15
- OpenAlex
- https://openalex.org/W23893622
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:35542467
Keywords
Computer science, Decomposition, Markov decision process, Graph partition, Graph
References
- Decomposition Techniques for Planning in Stochastic Domains
- Introduction to Reinforcement Learning
- Hierarchical Solution of Markov Decision Processes using Macro-actions
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Value-function reinforcement learning in Markov games
- Decomposition of systems governed by Markov chains
- Stochastic dynamic programming with factored representations
- Abstraction and Approximate Decision-Theoretic Planning
- Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
- PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*
- Markov Decision Processes: Discrete Stochastic Dynamic Programming
- An efficient heuristic procedure for partitioning graphs
- Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
- Dynamic Programming
- Theoretical Results on Reinforcement Learning with Temporally Abstract Options
Cited by
- Map partitioning to approximate an exploration strategy in mobile robotics
- Influence of modeling structure in probabilistic sequential decision problems
- Designing Effective Policies for Minimal Agents
- Planning large systems with MDPs: case study of inland waterways supervision
- Vers une distribution des MDP à grande échelle : étude de cas des voies navigables
- Résolution approchée par décomposition de processus décisionnels de Markov appliquée à l'exploration en robotique mobile
- Problèmes décisionnels de Markov temporels : formalisation et résolution
- Temporal Markov Decision Problems : Formalization and Resolution
- MDP à grande échelle : étude de cas des voies navigables
- Draft : Dealing with Large MDPs ,
- Autonomous Search and Rescue Rotorcraft Mission Stochastic Planning with Generic DBNs
- Dealing with Large MDPs, Case Study of Waterway Networks Supervision
Related papers
- Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
- Influence of modeling structure in probabilistic sequential decision problems
- Efficient solution of Markov decision problems with multiscale representations
- A simulation-based learning automata framework for solving semi-Markov decision problems under long-run average reward
- Markov Decision Processes: Discrete Stochastic Dynamic Programming
- Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
- Solving Concurrent Markov Decision Processes
- Path-Constrained Markov Decision Processes: bridging the gap between probabilistic model-checking and decision-theoretic planning