A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning
From MaRDI portal
Publication:5870537
DOI10.1613/JAIR.1.13904OpenAlexW4313642938WikidataQ130958839 ScholiaQ130958839MaRDI QIDQ5870537FDOQ5870537
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
Cites Work
- Title not available (Why is that?)
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
- Title not available (Why is that?)
- Compiling uncertainty away in conformant planning problems with bounded width
- Concise finite-domain representations for PDDL planning tasks
- Satisfiability modulo theories
- Title not available (Why is that?)
- Planning as satisfiability: parallel plans and algorithms for plan search
- An approach to efficient planning with numerical fluents and multi-criteria plan quality
- Modelling mixed discrete-continuous domains for planning
- Engineering and compiling planning domain models to promote validity and efficiency
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability and complexity of action-based temporal planning over dense time
- CASP solutions for planning in hybrid domains
- Interval-based relaxation for general numeric planning
- Planning for Hybrid Systems via Satisfiability Modulo Theories
- Subgoaling Techniques for Satisficing and Optimal Numeric Planning
- Processes and continuous change in a SAT-based planner
- On the importance of domain model configuration for automated planning engines
Uses Software
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)
