A CASP-based approach to PDDL+ planning

Marcello Balduccini; Daniele Magazzeni; Marco Maratea

A CASP-based approach to PDDL+ planning

Marcello Balduccini, Daniele Magazzeni, Marco Maratea

Research output: Contribution to conference types › Paper › peer-review

1 Citation (Scopus)

Abstract

PDDL+ is an extension of PDDL that makes it possible to model planning domains with mixed discrete-continuous dynamics. In this paper we present a new approach to PDDL+ planning based on the paradigm of Constraint Answer Set Programming (CASP), an extension of Answer Set Programming that supports efficient reasoning on numerical constraints. 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 an implementation of our approach based on CASP solver EZCSP and present very promising results on a set of PDDL+ benchmark problems.

Original language	English
Pages	5-14
Number of pages	10
Publication status	Published - 1 Jan 2016
Event	11th Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2016 - London, United Kingdom Duration: 13 Jun 2016 → 14 Jun 2016

Conference

Conference	11th Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2016
Country/Territory	United Kingdom
City	London
Period	13/06/2016 → 14/06/2016

Cite this

@conference{4d66255a56df40f59696619d6a2901e9,

title = "A CASP-based approach to PDDL+ planning",

abstract = "PDDL+ is an extension of PDDL that makes it possible to model planning domains with mixed discrete-continuous dynamics. In this paper we present a new approach to PDDL+ planning based on the paradigm of Constraint Answer Set Programming (CASP), an extension of Answer Set Programming that supports efficient reasoning on numerical constraints. 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 an implementation of our approach based on CASP solver EZCSP and present very promising results on a set of PDDL+ benchmark problems.",

author = "Marcello Balduccini and Daniele Magazzeni and Marco Maratea",

year = "2016",

month = jan,

day = "1",

language = "English",

pages = "5--14",

note = "11th Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2016 ; Conference date: 13-06-2016 Through 14-06-2016",

}

TY - CONF

T1 - A CASP-based approach to PDDL+ planning

AU - Balduccini, Marcello

AU - Magazzeni, Daniele

AU - Maratea, Marco

PY - 2016/1/1

Y1 - 2016/1/1

N2 - PDDL+ is an extension of PDDL that makes it possible to model planning domains with mixed discrete-continuous dynamics. In this paper we present a new approach to PDDL+ planning based on the paradigm of Constraint Answer Set Programming (CASP), an extension of Answer Set Programming that supports efficient reasoning on numerical constraints. 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 an implementation of our approach based on CASP solver EZCSP and present very promising results on a set of PDDL+ benchmark problems.

AB - PDDL+ is an extension of PDDL that makes it possible to model planning domains with mixed discrete-continuous dynamics. In this paper we present a new approach to PDDL+ planning based on the paradigm of Constraint Answer Set Programming (CASP), an extension of Answer Set Programming that supports efficient reasoning on numerical constraints. 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 an implementation of our approach based on CASP solver EZCSP and present very promising results on a set of PDDL+ benchmark problems.

UR - http://www.scopus.com/inward/record.url?scp=85025117315&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:85025117315

SP - 5

EP - 14

T2 - 11th Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2016

Y2 - 13 June 2016 through 14 June 2016

ER -

A CASP-based approach to PDDL+ planning

Abstract

Conference

Other files and links

Fingerprint

Cite this