Discovering hidden structure in factored MDPs

DOI10.1016/j.artint.2012.05.002zbMath1251.68206MaRDI QIDQ1761300

Mausam, Daniel S. Weld, Andrey V. Kolobov

Publication date: 15 November 2012

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2012.05.002

zbMATH Keywords

Markov decision process; heuristic; generalization; abstraction; basis function; MDP; planning under uncertainty; dead end; nogood

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

90C59: Approximation methods and heuristics in mathematical programming

90C40: Markov and semi-Markov decision processes

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

A Markov decision model with dead ends for operating room planning considering dynamic patient priority, State space search nogood learning: online refinement of critical-path dead-end detectors in planning, Real-time dynamic programming for Markov decision processes with imprecise probabilities, Discovering hidden structure in factored MDPs

Uses Software

• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The factored policy-gradient planner
• Practical solution techniques for first-order MDPs
• The computational complexity of propositional STRIPS planning
• Failure driven dynamic search control for partial order planners: an explanation based approach
• Fast planning through planning graph analysis
• Discovering hidden structure in factored MDPs
• LAO*: A heuristic search algorithm that finds solutions with loops