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

DOI10.1613/jair.5057zbMath1362.68258OpenAlexW2469551589WikidataQ129489359 ScholiaQ129489359MaRDI QIDQ5739833

Maximilian Fickert, Jörg 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

heuristic searchclassical planningdelete relaxation

Mathematics Subject Classification ID

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

Related Items (2)

State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning

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