Planning with SAT, Admissible Heuristics and A*
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:
|Collections||ANU Research Publications|
|Source:||On Qualitative Route Descriptions: Representation and Computational Complexity|
|01_Rintanen_Planning_with_SAT,_Admissible_2011.pdf||656.01 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.