Planning with Learned Binarized Neural Network Transition Models in Factored State and Action Spaces

11/26/2018
by   Buser Say, et al.
0

In this paper, we leverage the efficiency of Binarized Neural Networks (BNNs) to learn complex state transition models of planning domains with discretized factored state and action spaces. In order to directly exploit this transition structure for planning, we present two novel compilations of the learned factored planning problem with BNNs based on reductions to Weighted Partial Maximum Boolean Satisfiability (FD-SAT-Plan+) as well as Binary Linear Programming (FD-BLP-Plan+). Theoretically, we show that our SAT-based Bi-Directional Neuron Activation Encoding maintains the generalized arc-consistency property through unit propagation, which is one of the most important properties that certificate the efficiency of a SAT-based encoding. Experimentally, we validate the computational efficiency of our Bi-Directional Neuron Activation Encoding in comparison to the existing neuron activation encoding, demonstrate the effectiveness of learning complex transition models with BNNs, and test the runtime efficiency of both FD-SAT-Plan+ and FD-BLP-Plan+ on the learned factored planning problem. Finally, we present a finite-time incremental constraint generation algorithm based on generalized landmark constraints to improve the planning accuracy of our encodings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2018

Compact and Efficient Encodings for Planning in Factored State and Action Spaces with Learned Binarized Neural Network Transition Models

In this paper, we leverage the efficiency of Binarized Neural Networks (...
research
04/05/2019

Scalable Nonlinear Planning with Deep Neural Network Learned Transition Models

In many real-world planning problems with factored, mixed discrete and c...
research
03/09/2023

PDSketch: Integrated Planning Domain Programming and Learning

This paper studies a model learning and online planning approach towards...
research
01/18/2014

SAS+ Planning as Satisfiability

Planning as satisfiability is a principal approach to planning with many...
research
08/02/2021

Planning with Learned Binarized Neural Networks Benchmarks for MaxSAT Evaluation 2021

This document provides a brief introduction to learned automated plannin...
research
07/17/2023

Lifted Sequential Planning with Lazy Constraint Generation Solvers

This paper studies the possibilities made open by the use of Lazy Clause...
research
10/27/2020

Formally Verified SAT-Based AI Planning

We present an executable formally verified SAT encoding of classical AI ...

Please sign up or login with your details

Forgot password? Click here to reset