Resumen
Models that are suitable for planning are not always easy to specify. In this paper we investigate the conversion of Petri nets into factored Markov decision processes: the former are relatively easy to build while the latter are adequate for policy generation. To represent probabilities that are needed when planning under uncertainty, we introduce factored Petri nets; we then describe the conversion of factored Petri nets in Markov decision processes. © 2010 Springer-Verlag.
| Idioma original | Inglés estadounidense |
|---|---|
| Título de la publicación alojada | Markov decision processes from colored Petri nets |
| Páginas | 72-81 |
| Número de páginas | 10 |
| ISBN (versión digital) | 3642161375, 9783642161377 |
| DOI | |
| Estado | Publicada - 14 dic 2010 |
| Publicado de forma externa | Sí |
| Evento | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - Duración: 1 ene 2018 → … |
Serie de la publicación
| Nombre | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volumen | 6404 LNAI |
| ISSN (versión impresa) | 0302-9743 |
Conferencia
| Conferencia | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Período | 1/01/18 → … |
Huella Profundice en los temas de investigación de 'Markov decision processes from colored Petri nets'. En conjunto forman una huella única.
Citar esto
Eboli, M. G., & Cozman, F. G. (2010). Markov decision processes from colored Petri nets. En Markov decision processes from colored Petri nets (pp. 72-81). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6404 LNAI). https://doi.org/10.1007/978-3-642-16138-4_8