Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+

DOI10.1613/jair.3276zbMath1218.68160arXiv1401.3890OpenAlexW1886279298WikidataQ129519214 ScholiaQ129519214MaRDI QIDQ3007563

Jörg Hoffmann

Publication date: 16 June 2011

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

Full work available at URL: https://arxiv.org/abs/1401.3890

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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) Software, source code, etc. for problems pertaining to computer science (68-04)

Related Items (3)

State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ TorchLight ⋮ Red-black planning: a new systematic approach to partial delete relaxation

Uses Software

• Graphplan

This page was built for publication: Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+