CASP solutions for planning in hybrid domains

DOI10.1017/S1471068417000187MaRDI QIDQ4593097zbMATH OpenOpenAlexFDO

Authors Marcello Balduccini, Daniele Magazzeni, Marco Maratea, Emily LeBlanc

Publication date 9 November 2017

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1704.03574

zbMATH Keywords

planninganswer set programminghybrid domains

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

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.

Recommendations

• Modelling mixed discrete-continuous domains for planning
• Constraint answer set programming without grounding
• plasp 3: towards effective ASP planning
• ASP with non-herbrand partial functions: a language and system for practical use
• Industrial-size scheduling with ASP+CP

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 2085342 (Why is no real title available?)
• scientific article; zbMATH DE number 1820675 (Why is no real title available?)
• scientific article; zbMATH DE number 2201583 (Why is no real title available?)
• ASP modulo CSP: the clingcon system
• Abstraction, discretization, and robustness in temporal logic control of dynamical systems
• Answer set based design of knowledge systems
• Answer set programming and plan generation
• COLIN: planning with continuous linear numeric change
• Falsification of LTL Safety Properties in Hybrid Systems
• Handbook of constraint programming.
• Integrating answer set programming and constraint logic programming
• Iterative temporal motion planning for hybrid systems in partially unknown environments
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming
• Logic programs with stable model semantics as a constraint programming paradigm
• Model measuring for hybrid systems
• Modelling mixed discrete-continuous domains for planning
• Plan-based policies for efficient multiple battery load management
• Processes and continuous change in a SAT-based planner
• Relating constraint answer set programming languages and algorithms
• Representing action and change by logic programs
• Representing constraint satisfaction problems in answer set programming
• SMT-based analysis of virtually synchronous distributed hybrid systems

Cited in

(6)

• The Seventh Answer Set Programming Competition: Design and Results
• A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning
• Planning for hybrid systems via satisfiability modulo theories
• Modelling mixed discrete-continuous domains for planning
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Planning in hybrid relational MDPs

Describes a project that uses

Uses Software

• Clingcon
• COLIN

This page was built for publication: CASP solutions for planning in hybrid domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593097)