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

DOI10.1613/jair.1.13904OpenAlexW4313642938WikidataQ130958839 ScholiaQ130958839MaRDI QIDQ5870537

Mauro Vallati, Francesco Percassi, Enrico Scala

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)

Uses Software

• SpaceEx
• CPCES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
• Concise finite-domain representations for PDDL planning tasks
• Engineering and compiling planning domain models to promote validity and efficiency
• Decidability and complexity of action-based temporal planning over dense time
• An approach to efficient planning with numerical fluents and multi-criteria plan quality
• Planning as satisfiability: parallel plans and algorithms for plan search
• Processes and continuous change in a SAT-based planner
• On the importance of domain model configuration for automated planning engines
• Satisfiability Modulo Theories
• Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width
• Interval-Based Relaxation for General Numeric Planning.
• CASP solutions for planning in hybrid domains
• Planning for Hybrid Systems via Satisfiability Modulo Theories
• Subgoaling Techniques for Satisficing and Optimal Numeric Planning

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