An LP-Based Heuristic for Optimal Planning

DOI10.1007/978-3-540-74970-7_46MaRDI QIDQ3523080zbMATH OpenOpenAlexFDO

Authors Menkes H. L. van den Briel, Jessica Benton, Subbarao Kambhampati, Thomas W. M. Vossen

Publication date 2 September 2008

Published in Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74970-7_46

zbMATH Keywords

automated planningimproving admissible heuristicsoptimal relaxed planning

Mathematics Subject Classification ID

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

Recommendations

• On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
• A practical, integer-linear programming model for the delete-relaxation in cost-optimal planning
• Improving delete relaxation heuristics through explicitly represented conjunctions
• Cost-optimal planning, delete relaxation, approximability, and heuristics
• Solving delete free planning with relaxed decision diagram based heuristics

Cited in

(23)

• Set-structured and cost-sharing heuristics for classical planning
• Red-black planning: a new systematic approach to partial delete relaxation
• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
• A Lagrangian heuristic for sprint planning in agile software development
• FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION
• On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
• Improving heuristics through relaxed search - an analysis of TP4 and HSP*a in the 2004 planning competition
• scientific article; zbMATH DE number 2038902 (Why is no real title available?)
• Interval-based relaxation for general numeric planning
• A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning
• On transformation of STRIPS planning to linear programming
• Lifted heuristics for timeline-based planning
• Interval based relaxation heuristics for numeric planning with action costs
• Solving delete free planning with relaxed decision diagram based heuristics
• A practical, integer-linear programming model for the delete-relaxation in cost-optimal planning
• Optimal planning in the presence of conditional effects: extending LM-cut with context splitting
• KI 2004: Advances in Artificial Intelligence
• Improving delete relaxation heuristics through explicitly represented conjunctions
• The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
• Concise finite-domain representations for PDDL planning tasks
• Anytime heuristic search for partial satisfaction planning
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Optimal admissible composition of abstraction heuristics

Describes a project that uses

Uses Software

• Graphplan

This page was built for publication: An LP-Based Heuristic for Optimal Planning

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