Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization

DOI10.1613/JAIR.5057MaRDI QIDQ5739833zbMATH OpenOpenAlexWikidataFDO

Authors Maximilian Fickert, J. Hoffmann, Marcel Steinmetz

Publication date 5 July 2016

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

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

zbMATH Keywords

classical planningdelete relaxationheuristic search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Improving delete relaxation heuristics through explicitly represented conjunctions
• Cost-optimal planning, delete relaxation, approximability, and heuristics
• A practical, integer-linear programming model for the delete-relaxation in cost-optimal planning
• 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 7278081
• A new approach for approximating node deletion problems
• A unified approximation algorithm for node-deletion problems
• A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
• A complexity dichotomy for finding disjoint solutions of vertex deletion problems
• Solving delete free planning with relaxed decision diagram based heuristics

Cited in

(13)

• 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
• Strengthening landmark heuristics via hitting sets
• Analyzing search topology without running any search: on the connection between causal graphs and \(h^{+}\)
• 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
• Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
• Solving delete free planning with relaxed decision diagram based heuristics
• State space search nogood learning: online refinement of critical-path dead-end detectors in planning
• Cost-optimal planning, delete relaxation, approximability, and heuristics
• A practical, integer-linear programming model for the delete-relaxation in cost-optimal planning
• Improving delete relaxation heuristics through explicitly represented conjunctions
• scientific article; zbMATH DE number 2243410 (Why is no real title available?)

This page was built for publication: Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization

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