PDDL+ Planning via Constraint Answer Set Programming

08/31/2016
by   Marcello Balduccini, et al.
0

PDDL+ is an extension of PDDL that enables modelling planning domains with mixed discrete-continuous dynamics. In this paper we present a new approach to PDDL+ planning based on Constraint Answer Set Programming (CASP), i.e. ASP rules plus numerical constraints. To the best of our knowledge, ours is the first attempt to link PDDL+ planning and logic programming. We provide an encoding of PDDL+ models into CASP problems. The encoding can handle non-linear hybrid domains, and represents a solid basis for applying logic programming to PDDL+ planning. As a case study, we consider the EZCSP CASP solver and obtain promising results on a set of PDDL+ benchmark problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2017

CASP Solutions for Planning in Hybrid Domains

CASP is an extension of ASP that allows for numerical constraints to be ...
research
01/08/2013

Planning and Scheduling in Hybrid Domains Using Answer Set Programming

In this paper we present an Action Language-Answer Set Programming based...
research
06/12/2018

Augmenting Stream Constraint Programming with Eventuality Conditions

Stream constraint programming is a recent addition to the family of cons...
research
02/11/2022

Answer Set Planning: A Survey

Answer Set Planning refers to the use of Answer Set Programming (ASP) to...
research
05/23/2021

Learning First-Order Representations for Planning from Black-Box States: New Results

Recently Bonet and Geffner have shown that first-order representations f...
research
12/20/2013

Hybrid Automated Reasoning Tools: from Black-box to Clear-box Integration

Recently, researchers in answer set programming and constraint programmi...
research
04/26/2018

Experimenting with robotic intra-logistics domains

We introduce the asprilo [1] framework to facilitate experimental studie...

Please sign up or login with your details

Forgot password? Click here to reset