PDDL+ planning via constraint answer set programming

Marcello Balduccini; Daniele Magazzeni; Marco Maratea

PDDL+ planning via constraint answer set programming

Marcello Balduccini, Daniele Magazzeni, Marco Maratea

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

3 Citations (Scopus)

Abstract

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.

Original language	English
Pages	1-12
Number of pages	12
Publication status	Published - 1 Jan 2016
Event	9th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2016, co-located and Affiliated with the 32nd International Conference on Logic Programming, ICLP 2016 - New York City, United States Duration: 16 Oct 2016 → …

Conference

Conference	9th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2016, co-located and Affiliated with the 32nd International Conference on Logic Programming, ICLP 2016
Country/Territory	United States
City	New York City
Period	16/10/2016 → …

Cite this

@conference{6a2842ccb47d4a77b0db71f4212e42cc,

title = "PDDL+ planning via constraint answer set programming",

abstract = "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.",

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

year = "2016",

month = jan,

day = "1",

language = "English",

pages = "1--12",

note = "9th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2016, co-located and Affiliated with the 32nd International Conference on Logic Programming, ICLP 2016 ; Conference date: 16-10-2016",

}

PDDL+ planning via constraint answer set programming. / Balduccini, Marcello; Magazzeni, Daniele; Maratea, Marco.
2016. 1-12 Paper presented at 9th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2016, co-located and Affiliated with the 32nd International Conference on Logic Programming, ICLP 2016, New York City, United States.

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

TY - CONF

T1 - PDDL+ planning via constraint answer set programming

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 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.

AB - 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.

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

M3 - Paper

SP - 1

EP - 12

T2 - 9th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2016, co-located and Affiliated with the 32nd International Conference on Logic Programming, ICLP 2016

Y2 - 16 October 2016

ER -

PDDL+ planning via constraint answer set programming

Abstract

Conference

Other files and links

Fingerprint

Cite this