Planning with Noisy Probabilistic Relational Rules

by   Tobias Lang, et al.

Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually interpretable and they can be learned effectively from the action experiences in complex worlds. We investigate reasoning with such rules in grounded relational domains. Our algorithms exploit the compactness of rules for efficient and flexible decision-theoretic planning. As a first approach, we combine these rules with the Upper Confidence Bounds applied to Trees (UCT) algorithm based on look-ahead trees. Our second approach converts these rules into a structured dynamic Bayesian network representation and predicts the effects of action sequences using approximate inference and beliefs over world states. We evaluate the effectiveness of our approaches for planning in a simulated complex 3D robot manipulation scenario with an articulated manipulator and realistic physics and in domains of the probabilistic planning competition. Empirical results show that our methods can solve problems where existing methods fail.



There are no comments yet.


page 28


Learning Symbolic Models of Stochastic Domains

In this article, we work towards the goal of developing agents that can ...

A Probabilistic Model of Action for Least-Commitment Planning with Information Gather

AI planning algorithms have addressed the problem of generating sequence...

DeepSym: Deep Symbol Generation and Rule Learning from Unsupervised Continuous Robot Interaction for Planning

Autonomous discovery of discrete symbols and rules from continuous inter...

Learning the Structure of Dynamic Probabilistic Networks

Dynamic probabilistic networks are a compact representation of complex s...

Probabilistic Relational Planning with First Order Decision Diagrams

Dynamic programming algorithms have been successfully applied to proposi...

Taming Reasoning in Temporal Probabilistic Relational Models

Evidence often grounds temporal probabilistic relational models over tim...

Generalizing the Role of Determinization in Probabilistic Planning

The stochastic shortest path problem (SSP) is a highly expressive model ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.