Planning with Noisy Probabilistic Relational Rules

DOI10.1613/jair.3093zbMath1205.68379arXiv1401.3860OpenAlexW3104565117MaRDI QIDQ3055800

Marc Toussaint, Tobias Lang

Publication date: 10 November 2010

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

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

zbMATH Keywords

look-ahead treesUpper Confidence Bounds applied to Trees algorithm

Mathematics Subject Classification ID

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 (2)

Planning in hybrid relational MDPs ⋮ Unnamed Item

Uses Software

• Graphplan
• FODD-Planner

This page was built for publication: Planning with Noisy Probabilistic Relational Rules