Efficient solutions to factored MDPs with imprecise transition probabilities

Artificial Intelligence 175 (9-10):1498-1527 (2011)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Solving factored MDPs using non-homogeneous partitions.Kee-Eung Kim & Thomas Dean - 2003 - Artificial Intelligence 147 (1-2):225-251.
Propagating imprecise probabilities in Bayesian networks.Gernot D. Kleiter - 1996 - Artificial Intelligence 88 (1-2):143-161.
Decentralized MDPs with sparse interactions.Francisco S. Melo & Manuela Veloso - 2011 - Artificial Intelligence 175 (11):1757-1789.
Practical solution techniques for first-order MDPs.Scott Sanner & Craig Boutilier - 2009 - Artificial Intelligence 173 (5-6):748-788.

Analytics

Added to PP
2020-12-22

Downloads
14 (#1,020,370)

6 months
10 (#308,815)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Credal networks.Fabio G. Cozman - 2000 - Artificial Intelligence 120 (2):199-233.
Bounded-parameter Markov decision processes.Robert Givan, Sonia Leach & Thomas Dean - 2000 - Artificial Intelligence 122 (1-2):71-109.

Add more references