Abstract
Symmetries provide the basis for well-established approaches to tackle the state explosion problem in state space search and in AI planning. However, although by now there are various symmetry-based techniques available, these techniques have not yet been empirically evaluated and compared to each other in a common setting. In particular, it is unclear which of them should be preferably applied, and whether there are techniques with stronger performance than others. In this paper, we shed light on this issue by providing an empirical case study. We combine and evaluate several symmetry-based techniques for cost-optimal planning as heuristic search. For our evaluation, we use state-of-the-art abstraction heuristics on a large set of benchmarks from the international planning competitions.
This is a preview of subscription content, log in via an institution to check access.
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
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI 2015. AAAI Press (2015)
Bäckström, C., Nebel, B.: Complexity results for SAS\(^{+}\) planning. Computational Intelligence 11(4), 625–655 (1995)
Culberson, J.C., Schaeffer, J.: Pattern databases. Computational Intelligence 14(3), 318–334 (1998)
Domshlak, C., Katz, M., Shleyfman, A.: Enhanced symmetry breaking in cost-optimal planning as forward search. In: McCluskey, L., Williams, B., Silva, J.R., Bonet, B. (eds.) Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012. AAAI Press (2012)
Domshlak, C., Katz, M., Shleyfman, A.: Symmetry breaking: Satisficing planning and landmark heuristics. In: Borrajo, D., Kambhampati, S., Oddi, A., Fratini, S. (eds.) Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, ICAPS 2013, pp. 298–302. AAAI Press (2013)
Domshlak, C., Katz, M., Shleyfman, A.: Symmetry breaking in deterministic planning as forward search: Orbit space search algorithm. Tech. Rep. IS/IE-2015-03, Technion, Haifa (2015)
Felner, A., Zahavi, U., Holte, R., Schaeffer, J., Sturtevant, N., Zhang, Z.: Inconsistent heuristics in theory and practice. Artificial Intelligence 175, 1570–1603 (2011)
Felner, A., Zahavi, U., Schaeffer, J., Holte, R.C.: Dual lookups in pattern databases. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of the 19th International Joint Conference on Artificial Intelligence, IJCAI 2005, pp. 103–108. Professional Book Center (2005)
Fox, M., Long, D.: The detection and exploitation of symmetry in planning problems. In: Dean, T. (ed.) Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 1999, pp. 956–961. Morgan Kaufmann (1999)
Fox, M., Long, D.: Extending the exploitation of symmetries in planning. In: Ghallab, M., Hertzberg, J., Traverso, P. (eds.) Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling, AIPS 2002, pp. 83–91. AAAI Press (2002)
Haslum, P., Botea, A., Helmert, M., Bonet, B., Koenig, S.: Domain-independent construction of pattern database heuristics for cost-optimal planning. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, AAAI 2007, pp. 1007–1012. AAAI Press (2007)
Helmert, M.: The Fast Downward planning system. Journal of Artificial Intelligence Research 26, 191–246 (2006)
Helmert, M., Haslum, P., Hoffmann, J., Nissim, R.: Merge-and-shrink abstraction: A method for generating lower bounds in factored state spaces. Journal of the ACM 61(3), 16:1–63 (2014)
Ip, C.N., Dill, D.L.: Better verification through symmetry. Formal Methods in System Design 9(1–2), 41–75 (1996)
Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments, ALENEX 2007, pp. 135–149. SIAM (2007)
Luks, E.M.: Permutation groups and polynomial-time computation. In: Groups and Computation, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 11, pp. 139–175 (1993)
Nissim, R., Hoffmann, J., Helmert, M.: Computing perfect heuristics in polynomial time: On bisimulation and merge-and-shrink abstraction in optimal planning. In: Walsh, T. (ed.) Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, pp. 1983–1990 (2011)
Pochter, N., Zohar, A., Rosenschein, J.S.: Exploiting problem symmetries in state-based planners. In: Burgard, W., Roth, D. (eds.) Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, pp. 1004–1009. AAAI Press (2011)
Rintanen, J.: Symmetry reduction for SAT representations of transition systems. In: Giunchiglia, E., Muscettola, N., Nau, D. (eds.) Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, ICAPS 2003, pp. 32–40. AAAI Press (2003)
Seipp, J., Helmert, M.: Diverse and additive Cartesian abstraction heuristics. In: Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, ICAPS 2014, pp. 289–297. AAAI Press (2014)
Shleyfman, A., Katz, M., Helmert, M., Sievers, S., Wehrle, M.: Heuristics and symmetries in classical planning. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI 2015 [1], pp. 3371–3377 (2015)
Sievers, S., Ortlieb, M., Helmert, M.: Efficient implementation of pattern database heuristics for classical planning. In: Borrajo, D., Felner, A., Korf, R., Likhachev, M., Linares López, C., Ruml, W., Sturtevant, N. (eds.) Proceedings of the Fifth Annual Symposium on Combinatorial Search, SoCS 2012, pp. 105–111. AAAI Press (2012)
Sievers, S., Wehrle, M., Helmert, M.: Generalized label reduction for merge-and-shrink heuristics. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2014, pp. 2358–2366. AAAI Press (2014)
Sievers, S., Wehrle, M., Helmert, M., Shleyfman, A., Katz, M.: Factored symmetries for merge-and-shrink abstractions. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI 2015 [1], pp. 3378–3385 (2015)
Zahavi, U., Felner, A., Holte, R.C., Schaeffer, J.: Duality in permutation state spaces and the dual search algorithm. Artificial Intelligence 172(4–5), 514–540 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Sievers, S., Wehrle, M., Helmert, M., Katz, M. (2015). An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search. In: Hölldobler, S., , Peñaloza, R., Rudolph, S. (eds) KI 2015: Advances in Artificial Intelligence. KI 2015. Lecture Notes in Computer Science(), vol 9324. Springer, Cham. https://doi.org/10.1007/978-3-319-24489-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-24489-1_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24488-4
Online ISBN: 978-3-319-24489-1
eBook Packages: Computer ScienceComputer Science (R0)