2000 character limit reached
CASP Solutions for Planning in Hybrid Domains (1704.03574v2)
Published 12 Apr 2017 in cs.AI
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.
- Marcello Balduccini (17 papers)
- Daniele Magazzeni (42 papers)
- Marco Maratea (23 papers)
- Emily LeBlanc (2 papers)