Saturated cost partitioning for optimal classical planning

DOI10.1613/JAIR.1.11673zbMATH Open1442.68220OpenAlexW3003267832MaRDI QIDQ5214809FDOQ5214809

Authors: Jendrik Seipp, Thomas Keller, Malte Helmert 

Publication date: 5 February 2020

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

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

Recommendations

• Set-structured and cost-sharing heuristics for classical planning
• Optimal admissible composition of abstraction heuristics
• Cost optimal planning with multi-valued landmarks
• A weighted CSP approach to cost-optimal planning
• Implicit abstraction heuristics

Mathematics Subject Classification ID

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

Cited In (3)

• On transformation of conditional, conformant and parallel planning to linear programming
• Maximisation of admissible multi-objective heuristics
• Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning

This page was built for publication: Saturated cost partitioning for optimal classical planning

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