Probabilistic Relational Planning with First Order Decision Diagrams

DOI10.1613/jair.3205zbMath1219.68145arXiv1401.3882OpenAlexW3101500910MaRDI QIDQ3009013

Roni Khardon, Saket Joshi

Publication date: 23 June 2011

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

Full work available at URL: https://arxiv.org/abs/1401.3882

zbMATH Keywords

dynamic programmingstochastic planningplanning under uncertaintyalgebraic decision diagramsfirst order decision diagrams (FODD)FODD-Planner

Mathematics Subject Classification ID

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

Related Items

Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm ⋮ The complexity of reasoning with FODD and GFODD ⋮ Decision-theoretic planning with generalized first-order decision diagrams ⋮ FODD-Planner

Uses Software

• Graphplan
• FluCaP