Analysing approximability and heuristics in planning using the exponential-time hypothesis

DOI10.3233/978-1-61499-672-9-184zbMATH Open1403.68230OpenAlexW2577202245MaRDI QIDQ4576174FDOQ4576174

Authors: Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg 

Publication date: 12 July 2018

Full work available at URL: http://dx.doi.org/10.3233/978-1-61499-672-9-184

Recommendations

• Refining complexity analyses in planning by exploiting the exponential time hypothesis
• Cost-optimal planning, delete relaxation, approximability, and heuristics
• Upper and lower time and space bounds for planning
• Implicit abstraction heuristics
• Time and Space Bounds for Planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (6)

• Understanding planning tasks. Domain complexity and heuristic decomposition
• Upper and lower time and space bounds for planning
• Title not available (Why is that?)
• Refining complexity analyses in planning by exploiting the exponential time hypothesis
• FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION
• Cost-optimal planning, delete relaxation, approximability, and heuristics

This page was built for publication: Analysing approximability and heuristics in planning using the exponential-time hypothesis

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