A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning

DOI10.1613/JAIR.1.13904MaRDI QIDQ5870537zbMATH OpenOpenAlexWikidataFDO

Authors Francesco Percassi, Enrico Scala, Mauro Vallati

Publication date 9 January 2023

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.13904

zbMATH Keywords

planningknowledge engineering

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Modelling mixed discrete-continuous domains for planning
• Planning for hybrid systems via satisfiability modulo theories
• CASP solutions for planning in hybrid domains
• scientific article; zbMATH DE number 2038893
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Cites work

• scientific article; zbMATH DE number 2038893 (Why is no real title available?)
• scientific article; zbMATH DE number 2038902 (Why is no real title available?)
• scientific article; zbMATH DE number 1467489 (Why is no real title available?)
• scientific article; zbMATH DE number 1820675 (Why is no real title available?)
• scientific article; zbMATH DE number 1444348 (Why is no real title available?)
• An approach to efficient planning with numerical fluents and multi-criteria plan quality
• CASP solutions for planning in hybrid domains
• CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
• Compiling uncertainty away in conformant planning problems with bounded width
• Concise finite-domain representations for PDDL planning tasks
• Decidability and complexity of action-based temporal planning over dense time
• Engineering and compiling planning domain models to promote validity and efficiency
• Interval-based relaxation for general numeric planning
• Modelling mixed discrete-continuous domains for planning
• On the importance of domain model configuration for automated planning engines
• Planning as satisfiability: parallel plans and algorithms for plan search
• Planning for hybrid systems via satisfiability modulo theories
• Processes and continuous change in a SAT-based planner
• Satisfiability modulo theories
• Subgoaling techniques for satisficing and optimal numeric planning

Describes a project that uses

Uses Software

• SpaceEx
• CPCES

This page was built for publication: A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning

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