DeepAI AI Chat
Log In Sign Up

Generalized Planning with Positive and Negative Examples

by   Javier Segovia-Aguas, et al.

Generalized planning aims at computing an algorithm-like structure (generalized plan) that solves a set of multiple planning instances. In this paper we define negative examples for generalized planning as planning instances that must not be solved by a generalized plan. With this regard the paper extends the notion of validation of a generalized plan as the problem of verifying that a given generalized plan solves the set of input positives instances while it fails to solve a given input set of negative examples. This notion of plan validation allows us to define quantitative metrics to asses the generalization capacity of generalized plans. The paper also shows how to incorporate this new notion of plan validation into a compilation for plan synthesis that takes both positive and negative instances as input. Experiments show that incorporating negative examples can accelerate plan synthesis in several domains and leverage quantitative metrics to evaluate the generalization capacity of the synthesized plans.


page 1

page 2

page 3

page 4


Discovering State and Action Abstractions for Generalized Task and Motion Planning

Generalized planning accelerates classical planning by finding an algori...

Finding plans subject to stipulations on what information they divulge

Motivated by applications where privacy is important, we consider planni...

Phase Transitions of Plan Modification in Conformant Planning

We explore phase transitions of plan modification, which mainly focus on...

Operator Selection While Planning Under Uncertainty

This paper describes the best first search strategy used by U-Plan (Mans...

Guarantees for Sound Abstractions for Generalized Planning (Extended Paper)

Generalized planning is about finding plans that solve collections of pl...

Generalized Planning With Procedural Domain Control Knowledge

Generalized planning is the task of generating a single solution that is...

A new life of Pearson's skewness

In this work we show how coupling and stochastic dominance methods can b...