Extracting Lifted Mutual Exclusion Invariants from Temporal Planning Domains

02/07/2017
by   Sara Bernardini, et al.
0

We present a technique for automatically extracting mutual exclusion invariants from temporal planning instances. It first identifies a set of invariant templates by inspecting the lifted representation of the domain and then checks these templates against properties that assure invariance. Our technique builds on other approaches to invariant synthesis presented in the literature, but departs from their limited focus on instantaneous actions by addressing temporal domains. To deal with time, we formulate invariance conditions that account for the entire structure of the actions and the possible concurrent interactions between them. As a result, we construct a significantly more comprehensive technique than previous methods, which is able to find not only invariants for temporal domains, but also a broader set of invariants for non-temporal domains. The experimental results reported in this paper provide evidence that identifying a broader set of invariants results in the generation of fewer multi-valued state variables with larger domains. We show that, in turn, this reduction in the number of variables reflects positively on the performance of a number of temporal planners that use a variable/value representation by significantly reducing their running time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2023

Enhancing Temporal Planning Domains by Sequential Macro-actions (Extended Version)

Temporal planning is an extension of classical planning involving concur...
research
05/27/2011

The Automatic Inference of State Invariants in TIM

As planning is applied to larger and richer domains the effort involved ...
research
05/05/2022

Low Dimensional Invariant Embeddings for Universal Geometric Learning

This paper studies separating invariants: mappings on d-dimensional semi...
research
03/30/2020

Templates and Recurrences: Better Together

This paper is the confluence of two streams of ideas in the literature o...
research
05/25/2023

Minimally Comparing Relational Abstract Domains

Value-based static analysis techniques express computed program invarian...
research
06/26/2018

A Constraint-based Encoding for Domain-Independent Temporal Planning

We present a general constraint-based encoding for domain-independent ta...
research
07/12/2023

Rethinking Answer Set Programming Templates

In imperative programming, the Domain-Driven Design methodology helps in...

Please sign up or login with your details

Forgot password? Click here to reset