Proceedings

Planning with SAT, Admissible Heuristics and A*

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 2015-2019.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-336

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: any iterative deepening A* search can be efficiently simulated in the SAT framework, assuming that the heuristic has been encoded in the SAT problem, but the opposite is not possible as A* and IDA* searches sometimes take exponentially longer.

Jussi Rintanen. 2011. Planning with SAT, Admissible Heuristics and A*. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 2015–2019. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-336
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards