Planning with Noisy Probabilistic Relational Rules

DOI10.1613/jair.3093zbMath1205.68379arXiv1401.3860MaRDI 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 trees; Upper Confidence Bounds applied to Trees algorithm

Mathematics Subject Classification ID

68T37: Reasoning under uncertainty in the context of artificial intelligence

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

Related Items

Unnamed Item, Planning in hybrid relational MDPs

Uses Software

• Graphplan
• FODD-Planner