Loading...
Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning
We characterize the class of nondeterministic [Formula: see text]-automata that can be used for the analysis of finite Markov decision processes (MDPs). We call these automata ‘good-for-MDPs’ (GFM). We show that GFM automata are closed under classic simulation as well as under more powerful simulati...
Na minha lista:
| Udgivet i: | Tools and Algorithms for the Construction and Analysis of Systems |
|---|---|
| Main Authors: | , , , , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
2020
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7439745/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-45190-5_17 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|