On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning

DOI10.1613/JAIR.4936MaRDI QIDQ3460384zbMATH OpenOpenAlexFDO

Authors Tatsuya Imai, Alex Fukunaga

Publication date 7 January 2016

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

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mixed integer programming (90C11)

Recommendations

• A practical, integer-linear programming model for the delete-relaxation in cost-optimal planning
• Cost-optimal planning, delete relaxation, approximability, and heuristics
• Solving delete free planning with relaxed decision diagram based heuristics
• Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
• Incremental constraint deletion in systems of linear constraints
• An LP-Based Heuristic for Optimal Planning
• Red-black planning: a new systematic approach to partial delete relaxation
• Interval based relaxation heuristics for numeric planning with action costs
• Solving planning and scheduling problems with combined integer and constraint programming

Cited in

(5)

• An LP-Based Heuristic for Optimal Planning
• A practical, integer-linear programming model for the delete-relaxation in cost-optimal planning
• Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
• The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
• Capturing (optimal) relaxed plans with stable and supported models of logic programs

This page was built for publication: On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning

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