CASP Solutions for Planning in Hybrid Domains
Artificial Intelligence
2018-06-26 v2
Abstract
CASP is an extension of ASP 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.
Cite
@article{arxiv.1704.03574,
title = {CASP Solutions for Planning in Hybrid Domains},
author = {Marcello Balduccini and Daniele Magazzeni and Marco Maratea and Emily LeBlanc},
journal= {arXiv preprint arXiv:1704.03574},
year = {2018}
}
Comments
Under consideration in Theory and Practice of Logic Programming (TPLP)