Skip navigation
Skip navigation

Planning with SAT, Admissible Heuristics and A*

Rintanen, Jussi


We study the relationship between optimal planning algorithms, in the form of (iterative deepening) A with (forward) state-space search, and the reduction of the problem to SAT. Our results establish a strict dominance relation between the two approaches:

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
Source: On Qualitative Route Descriptions: Representation and Computational Complexity
DOI: 10.5591/978-1-57735-516-8/IJCAI11-336


File Description SizeFormat Image
01_Rintanen_Planning_with_SAT,_Admissible_2011.pdf656.01 kBAdobe PDF    Request a copy

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

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator