Abstract
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performance by making the SAT solving process more application-specific. In this paper we propose a variable selection strategy for AI planning. The strategy is based on generic principles about properties of plans, and its performance with standard planning benchmarks often substantially improves on generic variable selection heuristics used in SAT solving, such as the VSIDS strategy. These improvements lift the efficiency of SAT based planning to the same level as best planners that use other search methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kautz, H., Selman, B.: Planning as satisfiability. In: Neumann, B. (ed.) Proceedings of the 10th European Conference on Artificial Intelligence, pp. 359–363. John Wiley & Sons, Chichester (1992)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th ACM/IEEE Design Automation Conference (DAC 2001), pp. 530–535. ACM Press, New York (2001)
Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence 129(1-2), 5–33 (2001)
Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151–158 (1971)
Rintanen, J., Heljanko, K., Niemelä, I.: Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence 170(12-13), 1031–1080 (2006)
Rintanen, J.: Planning and SAT. In: Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 483–504. IOS Press, Amsterdam (2009)
Rintanen, J.: Regression for classical and nondeterministic planning. In: Ghallab, M., Spyropoulos, C.D., Fakotakis, N. (eds.) ECAI 2008. Proceedings of the 18th European Conference on Artificial Intelligence, pp. 568–571. IOS Press, Amsterdam (2008)
Beame, P., Kautz, H., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research 22, 319–351 (2004)
Mitchell, D.G.: A SAT solver primer. EATCS Bulletin 85, 112–133 (2005)
Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 294–299. Springer, Heidelberg (2007)
Richter, S., Helmert, M., Westphal, M.: Landmarks revisited. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-2008), pp. 975–982. AAAI Press, Menlo Park (2008)
Rintanen, J.: Phase transitions in classical planning: an experimental study. In: Zilberstein, S., Koehler, J., Koenig, S. (eds.) ICAPS 2004. Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, pp. 101–110. AAAI Press, Menlo Park (2004)
McAllester, D.A., Rosenblitt, D.: Systematic nonlinear planning. In: Proceedings of the 9th National Conference on Artificial Intelligence, vol. 2, pp. 634–639. AAAI Press/The MIT Press (1991)
Gerevini, A., Serina, I.: Planning as propositional CSP: from Walksat to local search techniques for action graphs. Constraints Journal 8, 389–413 (2003)
Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Company, Reading (1984)
Bonet, B., Loerincs, G., Geffner, H.: A robust and fast action selection mechanism for planning. In: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI 1997) and 9th Innovative Applications of Artificial Intelligence Conference (IAAI 1997), pp. 714–719. AAAI Press, Menlo Park (1997)
Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. Artificial Intelligence 90(1-2), 281–300 (1997)
Cimatti, A., Giunchiglia, E., Giunchiglia, F., Traverso, P.: Planning via model checking: a decision procedure for \({\cal AR}\). In: Steel, S., Alami, R. (eds.) ECP 1997. LNCS, vol. 1348, pp. 130–142. Springer, Heidelberg (1997)
Kautz, H., Selman, B.: Unifying SAT-based and graph-based planning. In: Dean, T. (ed.) Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp. 318–325. Morgan Kaufmann Publishers, San Francisco (1999)
Sideris, A., Dimopoulos, Y.: Constraint propagation in propositional planning. In: ICAPS 2010. Proceedings of the Twentieth International Conference on Automated Planning and Scheduling, pp. 153–160. AAAI Press, Menlo Park (2010)
Robinson, N., Gretton, C., Pham, D.N., Sattar, A.: SAT-based parallel planning using a split representation of actions. In: Gerevini, A., Howe, A., Cesta, A., Refanidis, I. (eds.) ICAPS 2009. Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling, pp. 281–288. AAAI Press, Menlo Park (2009)
Wehrle, M., Rintanen, J.: Planning as satisfiability with relaxed ∃-step plans. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol. 4830, pp. 244–253. Springer, Heidelberg (2007)
Järvisalo, M., Junttila, T.: Limitations of restricted branching in clause learning. Constraints Journal 14, 325–356 (2009)
Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)
Grastien, A., Anbulagan, R.J., Kelareva, E.: Diagnosis of discrete-event systems using satisfiability algorithms. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007), pp. 305–310. AAAI Press, Menlo Park (2007)
Rintanen, J.: Asymptotically optimal encodings of conformant planning in QBF. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007), pp. 1045–1050. AAAI Press, Menlo Park (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rintanen, J. (2010). Heuristics for Planning with SAT. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-15396-9_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15395-2
Online ISBN: 978-3-642-15396-9
eBook Packages: Computer ScienceComputer Science (R0)