Planning with SAT, Admissible Heuristics and A*
Abstract
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:
Description
Citation
Collections
Source
On Qualitative Route Descriptions: Representation and Computational Complexity
Type
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31