{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:33:54Z","timestamp":1725831234887},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319244884"},{"type":"electronic","value":"9783319244891"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24489-1_13","type":"book-chapter","created":{"date-parts":[[2015,9,29]],"date-time":"2015-09-29T07:00:40Z","timestamp":1443510040000},"page":"166-180","source":"Crossref","is-referenced-by-count":1,"title":["An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search"],"prefix":"10.1007","author":[{"given":"Silvan","family":"Sievers","sequence":"first","affiliation":[]},{"given":"Martin","family":"Wehrle","sequence":"additional","affiliation":[]},{"given":"Malte","family":"Helmert","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Katz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"key":"13_CR1","unstructured":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI 2015. AAAI Press (2015)"},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1111\/j.1467-8640.1995.tb00052.x","volume":"11","author":"C B\u00e4ckstr\u00f6m","year":"1995","unstructured":"B\u00e4ckstr\u00f6m, C., Nebel, B.: Complexity results for SAS $$^{+}$$ planning. Computational Intelligence 11(4), 625\u2013655 (1995)","journal-title":"Computational Intelligence"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"JC Culberson","year":"1998","unstructured":"Culberson, J.C., Schaeffer, J.: Pattern databases. Computational Intelligence 14(3), 318\u2013334 (1998)","journal-title":"Computational Intelligence"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1609\/icaps.v22i1.13531"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013302. AAAI Press (2013)","DOI":"10.1609\/icaps.v23i1.13595"},{"key":"13_CR6","unstructured":"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)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1016\/j.artint.2011.02.001","volume":"175","author":"A Felner","year":"2011","unstructured":"Felner, A., Zahavi, U., Holte, R., Schaeffer, J., Sturtevant, N., Zhang, Z.: Inconsistent heuristics in theory and practice. Artificial Intelligence 175, 1570\u20131603 (2011)","journal-title":"Artificial Intelligence"},{"key":"13_CR8","unstructured":"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\u2013108. Professional Book Center (2005)"},{"key":"13_CR9","unstructured":"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\u2013961. Morgan Kaufmann (1999)"},{"key":"13_CR10","unstructured":"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\u201391. AAAI Press (2002)"},{"key":"13_CR11","unstructured":"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\u20131012. AAAI Press (2007)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10462-007-9049-y","volume":"26","author":"M Helmert","year":"2006","unstructured":"Helmert, M.: The Fast Downward planning system. Journal of Artificial Intelligence Research 26, 191\u2013246 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"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\u201363 (2014)","DOI":"10.1145\/2559951"},{"issue":"1\u20132","key":"13_CR14","first-page":"41","volume":"9","author":"CN Ip","year":"1996","unstructured":"Ip, C.N., Dill, D.L.: Better verification through symmetry. Formal Methods in System Design 9(1\u20132), 41\u201375 (1996)","journal-title":"Formal Methods in System Design"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013149. SIAM (2007)","DOI":"10.1137\/1.9781611972870.13"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013175 (1993)","DOI":"10.1090\/dimacs\/011\/11"},{"key":"13_CR17","unstructured":"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\u20131990 (2011)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"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\u20131009. AAAI Press (2011)","DOI":"10.1609\/aaai.v25i1.8014"},{"key":"13_CR19","unstructured":"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\u201340. AAAI Press (2003)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"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\u2013297. AAAI Press (2014)","DOI":"10.1609\/icaps.v24i1.13639"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"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\u20133377 (2015)","DOI":"10.1609\/aaai.v29i1.9649"},{"key":"13_CR22","unstructured":"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\u00f3pez, C., Ruml, W., Sturtevant, N. (eds.) Proceedings of the Fifth Annual Symposium on Combinatorial Search, SoCS 2012, pp. 105\u2013111. AAAI Press (2012)"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"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\u20132366. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.9028"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"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\u20133385 (2015)","DOI":"10.1609\/aaai.v29i1.9642"},{"issue":"4\u20135","key":"13_CR25","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.artint.2007.10.019","volume":"172","author":"U Zahavi","year":"2008","unstructured":"Zahavi, U., Felner, A., Holte, R.C., Schaeffer, J.: Duality in permutation state spaces and the dual search algorithm. Artificial Intelligence 172(4\u20135), 514\u2013540 (2008)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","KI 2015: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24489-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T18:05:10Z","timestamp":1692036310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24489-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319244884","9783319244891"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24489-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}