CASP solutions for planning in hybrid domains

MARCELLO BALDUCCINI*, DANIELE MAGAZZENI, MARCO MARATEA, EMILY C. LEBLANC

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)

Abstract

Constraint answer set programming (CASP) is an extension of answer set programming that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In this paper, we present CASP solutions for dealing with PDDL+ problems, i.e., encoding from PDDL+ to CASP, and extensions to the algorithm of the ezcsp CASP solver in order to solve CASP programs arising from PDDL+ domains. An experimental analysis, performed on well-known linear and non-linear variants of PDDL+ domains, involving various configurations of the ezcsp solver, other CASP solvers, and PDDL+ planners, shows the viability of our solution.

Original languageEnglish
Pages (from-to)1-43
Number of pages43
JournalTheory and Practice of Logic Programming
Early online date4 Jul 2017
DOIs
Publication statusE-pub ahead of print - 4 Jul 2017

Keywords

  • Answer set programming
  • hybrid domains
  • planning

Fingerprint

Dive into the research topics of 'CASP solutions for planning in hybrid domains'. Together they form a unique fingerprint.

Cite this