Discovering hidden structure in factored MDPs
type: Item
instance of: scholarly article
title: Discovering hidden structure in factored MDPs
zbMATH Open document ID: 1251.68206
author: Mausam
author: Daniel S. Weld
author: A. V. Kolobov
published in: Artificial Intelligence
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6106692
zbMATH Keywords: Markov decision process
zbMATH Keywords: MDP
zbMATH Keywords: planning under uncertainty
zbMATH Keywords: generalization
zbMATH Keywords: abstraction
zbMATH Keywords: basis function
zbMATH Keywords: nogood
zbMATH Keywords: heuristic
zbMATH Keywords: dead end
describes a project that uses: Graphplan
MaRDI profile type: Publication
full work available at URL: j.artint.2012.05.002
OpenAlex ID: W2123557770
cites work: Q3241581
cites work: Q4257216
cites work: Q4368722
cites work: Fast planning through planning graph analysis
cites work: Q5715734
cites work: The factored policy-gradient planner
cites work: The computational complexity of propositional STRIPS planning
cites work: Q4449304
cites work: Q4434179
cites work: LAO*: A heuristic search algorithm that finds solutions with loops
cites work: The FF planning system: Fast plan generation through heuristic search
cites work: Failure driven dynamic search control for partial order planners: an explanation based approach
cites work: Practical solution techniques for first-order MDPs
DOI: 10.1016/J.ARTINT.2012.05.002
description: scientific article; zbMATH DE number 6106692