Interval based relaxation heuristics for numeric planning with action costs

DOI10.1007/978-3-319-67190-1_2MaRDI QIDQ5044847zbMATH OpenOpenAlexFDO

Authors Johannes Aldinger, Bernhard Nebel

Publication date 2 November 2022

Published in KI 2017: Advances in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-67190-1_2

Mathematics Subject Classification ID

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

Recommendations

• Interval-based relaxation for general numeric planning
• Subgoaling techniques for satisficing and optimal numeric planning
• scientific article; zbMATH DE number 2038902
• A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning
• An LP-Based Heuristic for Optimal Planning

Cited in

(6)

• On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
• scientific article; zbMATH DE number 2038902 (Why is no real title available?)
• Interval-based relaxation for general numeric planning
• Extending classical planning with state constraints: heuristics and search for optimal planning
• Subgoaling techniques for satisficing and optimal numeric planning
• The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions

This page was built for publication: Interval based relaxation heuristics for numeric planning with action costs

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