Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes
When treating Markov decision processes (MDPs) with large state spaces, using explicit representations quickly becomes unfeasible. Lately, Wimmer et al. have proposed a so-called symblicit algorithm for the synthesis of optimal strategies in MDPs, in the quantitative setting of expected mean-payoff....
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artikulua |
| Hizkuntza: | English |
| Argitaratua: |
Open Publishing Association
2014-07-01
|
| Saila: | Electronic Proceedings in Theoretical Computer Science |
| Sarrera elektronikoa: | http://arxiv.org/pdf/1407.5396v1 |