CASP solutions for planning in hybrid domains

DOI10.1017/S1471068417000187zbMATH Open1379.68039arXiv1704.03574OpenAlexW2606948271MaRDI QIDQ4593097FDOQ4593097

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)

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.

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

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

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)

Cites Work

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

Cited In (6)

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

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)