Plotting: a case study in lifted planning with constraints

DOI10.1007/S10601-024-09370-XMaRDI QIDQ7031951zbMATH OpenFDO

Authors Joan Espasa, Ian Miguel, Peter W. Nightingale, András Z. Salamon, Mateu Villaret

Publication date 6 February 2025

Published in Constraints (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10601-024-09370-X

zbMATH Keywords

AI planningcase studyconstraint programmingmodelling

Mathematics Subject Classification ID

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

Cites work

• An introduction to the planning domain definition language
• Automatically improving constraint models in Savile Row
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• Concise finite-domain representations for PDDL planning tasks
• Encoding domain transitions for constraint-based planning
• Fast planning through planning graph analysis
• Functional strips: A more flexible language for planning and problem solving
• scientific article; zbMATH DE number 2038893 (Why is no real title available?)
• scientific article; zbMATH DE number 2201583 (Why is no real title available?)
• Implementing logical connectives in constraint programming
• In defense of PDDL axioms
• Modelling and solving English peg solitaire
• Planning as heuristic search
• Planning as satisfiability: parallel plans and algorithms for plan search
• Search in the patience game `Black Hole'
• The fast downward planning system

This page was built for publication: Plotting: a case study in lifted planning with constraints

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