Solving factored MDPs using non-homogeneous partitions
type: Item
instance of: scholarly article
title: Solving factored MDPs using non-homogeneous partitions
zbMATH Open document ID: 1082.68804
DOI: 10.1016/S0004-3702(02)00377-6
author: N. E. Zubov
published in: Artificial Intelligence
publication date: 2006-02-07T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 5003888
zbMATH Keywords: Planning under uncertainty
zbMATH Keywords: Factored Markov decision processes
zbMATH Keywords: Non-homogeneous partitioning method
describes a project that uses: CUDD
MaRDI profile type: Publication
cites work: Q4257216
cites work: Adaptive aggregation methods for infinite horizon dynamic programming
cites work: Q4256521
cites work: Stochastic dynamic programming with factored representations
cites work: Technical update: Least-squares temporal difference learning
cites work: Q5477859
cites work: Q4013741
cites work: Bounded-parameter Markov decision processes
cites work: Q3862379
cites work: A sparse sampling algorithm for near-optimal planning in large Markov decision processes
cites work: Q4434179
cites work: Q4215779
cites work: The Complexity of Markov Decision Processes
cites work: Q4315289
cites work: An upper bound on the loss from approximate optimal-value functions
cites work: Markov Decision Processes with Imprecise Transition Probabilities
full work available at URL: s0004-3702(02)00377-6
OpenAlex ID: W2038694949
Recommended article: Q4434179
Recommended article: Efficient solutions to factored MDPs with imprecise transition probabilities
Recommended article: Q3624032
Recommended article: Discovering hidden structure in factored MDPs
Recommended article: Efficient approximate linear programming for factored MDPs
Recommended article: Stochastic dynamic programming with factored representations
Recommended article: Q4708199
Recommended article: Q5718885
description: scientific article; zbMATH DE number 5003888