A multi-cluster time aggregation approach for Markov chains
From MaRDI portal
Publication:1716687
DOI10.1016/j.automatica.2018.10.027zbMath1427.60148OpenAlexW2900455167MaRDI QIDQ1716687
Edilson F. Arruda, Fabrício O. Ourique, Marcelo Dutra Fragoso
Publication date: 5 February 2019
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/128227/1/Edilson_A%20multi-cluster%20time%20aggregation%20approach_Automatica2019Pos.pdf
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An iterative aggregation and disaggregation method for the steady state solution of large scale continuous systems
- Time aggregated Markov decision processes via standard dynamic programming
- Iterative aggregation/disaggregation method for computing stationary probability vectors of Markov type operators
- A time aggregation approach to Markov decision processes
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
- On a two-level multigrid solution method for finite Markov chains
- Exact finite approximations of average-cost countable Markov decision processes
- Optimal Kullback–Leibler Aggregation via Information Bottleneck
- Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
- Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
- Aggregation of the policy iteration method for nearly completely decomposable Markov chains
- Multilayer control of large Markov chains
- Markov Chains
- Markov Chains
- Finite Markov Chains and Algorithmic Applications
- Convergent Iterations for Computing Stationary Distributions of Markov Chains
- Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain
- Approximate Dynamic Programming
This page was built for publication: A multi-cluster time aggregation approach for Markov chains
