Solving factored MDPs using non-homogeneous partitions

DOI10.1016/S0004-3702(02)00377-6MaRDI QIDQ814475zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 7 February 2006

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0004-3702(02)00377-6

zbMATH Keywords

Factored Markov decision processesNon-homogeneous partitioning methodPlanning under uncertainty

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• scientific article; zbMATH DE number 2000828
• Efficient solutions to factored MDPs with imprecise transition probabilities
• Solving factored mdps with hybrid state and action variables
• Discovering hidden structure in factored MDPs
• Efficient approximate linear programming for factored MDPs
• Stochastic dynamic programming with factored representations
• scientific article; zbMATH DE number 1929153
• scientific article; zbMATH DE number 2247690

Cites work

• A sparse sampling algorithm for near-optimal planning in large Markov decision processes
• Adaptive aggregation methods for infinite horizon dynamic programming
• An upper bound on the loss from approximate optimal-value functions
• Bounded-parameter Markov decision processes
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 67800 (Why is no real title available?)
• scientific article; zbMATH DE number 1216123 (Why is no real title available?)
• scientific article; zbMATH DE number 1315585 (Why is no real title available?)
• scientific article; zbMATH DE number 1321699 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 2000828 (Why is no real title available?)
• Linear least-squares algorithms for temporal difference learning
• Markov Decision Processes with Imprecise Transition Probabilities
• Stochastic dynamic programming with factored representations
• Technical update: Least-squares temporal difference learning
• The Complexity of Markov Decision Processes

Cited in

(7)

• scientific article; zbMATH DE number 5957399 (Why is no real title available?)
• Influence of modeling structure in probabilistic sequential decision problems
• scientific article; zbMATH DE number 2000828 (Why is no real title available?)
• scientific article; zbMATH DE number 1929153 (Why is no real title available?)
• scientific article; zbMATH DE number 2247690 (Why is no real title available?)
• Efficient solutions to factored MDPs with imprecise transition probabilities
• Equivalence notions and model minimization in Markov decision processes

Describes a project that uses

Uses Software

• CUDD

This page was built for publication: Solving factored MDPs using non-homogeneous partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814475)