Deterministic oversubscription planning as heuristic search: abstractions and reformulations

DOI10.1613/JAIR.4443MaRDI QIDQ2940591zbMATH OpenOpenAlexWikidataFDO

Authors Carmel Domshlak, Vitaly Mirkis

Publication date 27 January 2015

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

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

Mathematics Subject Classification ID

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

Recommendations

• Selecting goals in oversubscription planning using relaxed plans
• Set-structured and cost-sharing heuristics for classical planning
• Landmark-enhanced abstraction heuristics
• Optimal admissible composition of abstraction heuristics
• scientific article; zbMATH DE number 2243372

Cited in

(3)

• Heuristic search for one-to-many shortest path queries
• Selecting goals in oversubscription planning using relaxed plans
• State space search nogood learning: online refinement of critical-path dead-end detectors in planning

This page was built for publication: Deterministic oversubscription planning as heuristic search: abstractions and reformulations

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