Skip navigation
Skip navigation

Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces

Helmert, Malte; Haslum, Patrik; Hoffmann, Jorg; Nissim, Raz


Many areas of computer science require answering questions about reachability in compactly described discrete transition systems. Answering such questions effectively requires techniques to be able to do so without building the entire system. In particular, heuristic search uses lower-bounding ("admissible") heuristic functions to prune parts of the system known to not contain an optimal solution. A prominent technique for deriving such bounds is to consider abstract transition systems that...[Show more]

CollectionsANU Research Publications
Date published: 2014
Type: Journal article
Source: Journal of the ACM
DOI: 10.1145/2559951


File Description SizeFormat Image
01_Helmert_Merge-and-Shrink_Abstraction:_2014.pdf1.5 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator