{"type":"ScholarlyArticle","title":"Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning","authors":[{"name":"Silvan Sievers","slug":"silvan-sievers","given":"Silvan","family":"Sievers","affiliation":"University of Basel , Switzerland"},{"name":"Florian Pommerening","slug":"florian-pommerening","given":"Florian","family":"Pommerening","affiliation":"University of Basel , Switzerland"},{"name":"Thomas Keller","slug":"thomas-keller","given":"Thomas","family":"Keller","affiliation":"University of Basel , Switzerland"},{"name":"Malte Helmert","slug":"malte-helmert","given":"Malte","family":"Helmert","affiliation":"University of Basel , Switzerland"}],"abstract":"Cost partitioning is a method for admissibly combining admissible heuristics.\r\nIn this work, we extend this concept to merge-and-shrink (M&S) abstractions\r\nthat may use labels that do not directly correspond to operators. We\r\ninvestigate how optimal and saturated cost partitioning (SCP) interact with\r\nM&S transformations and develop a method to compute SCPs during the\r\ncomputation of M&S. Experiments show that SCP significantly improves M&S on\r\nstandard planning benchmarks.","doi":"10.24963/ijcai.2020/574","url":"https://ijcai.org/proceedings/2020/574","pdf":"https://ijcai.org/proceedings/2020/0574.pdf","markdown":"https://ijcai.org/proceedings/2020/574.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/574","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Planning and Scheduling","track":"Main track","number":574,"pages":{"first":4152,"last":4160},"keywords":["Heuristic Search and Game Playing: Heuristic Search","Planning and Scheduling: Planning Algorithms","Planning and Scheduling: Search in Planning and Scheduling"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24354/file_24354.m3u8","length_sec":275,"provider":"hls"}],"references":[{"position":1,"raw":"[Bäckström and Nebel, 1995] Christer Bäckström and Bern- hard Nebel. Complexity results for SAS + planning. Com- putational Intelligence, 11(4):625-655, 1995.","title":"Christer Bäckström and Bernhard Nebel","authors":"Nebel Bäckström","year":"1995","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Dräger et al., 2009] Klaus Dräger, Bernd Finkbeiner, and Andreas Podelski. Directed model checking with distance- preserving abstractions. International Journal on Software Tools for Technology Transfer, 11(1):27-37, 2009.","title":"Directed model checking with distancepreserving abstractions","authors":"Dräger","year":"2009","venue":"International Journal on Software Tools for Technology Transfer","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Edelkamp, 2001] Stefan Edelkamp. Planning with pattern databases. In Amedeo Cesta and Daniel Borrajo, editors, Proceedings of the Sixth European Conference on Plan- ning (ECP 2001), pages 84-90. AAAI Press, 2001.","title":"Planning with pattern databases","authors":"Stefan Edelkamp","year":"2001","venue":"Proceedings of the Sixth European Conference on Planning (ECP 2001)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Ghallab et al., 2004] Malik Ghallab, Dana Nau, and Paolo Traverso. Automated Planning: Theory and Practice.","title":"Automated Planning: Theory and Practice","authors":"Malik Ghallab, Dana Nau, Paolo Traverso","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"Morgan Kaufmann, 2004.","title":null,"authors":"Morgan Kaufmann","year":"2004","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Hart et al., 1968] Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100-107, 1968.","title":"A formal basis for the heuristic determination of minimum cost paths","authors":"Peter E Hart, Nils J Nilsson, Bertram Raphael","year":"1968","venue":"IEEE Transactions on Systems Science and Cybernetics","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Helmert et al., 2014] Malte Helmert, Patrik Haslum, Jörg Hoffmann, and Raz Nissim. Merge-and-shrink abstrac- tion: A method for generating lower bounds in factored state spaces. Journal of the ACM, 61(3):16:1-63, 2014.","title":"Merge-and-shrink abstraction: A method for generating lower bounds in factored state spaces","authors":"Malte Helmert, Patrik Haslum, Jörg Hoffmann, Raz Nissim","year":"2014","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Helmert, 2006] Malte Helmert. The Fast Downward plan- ning system. Journal of Artificial Intelligence Research, 26:191-246, 2006.","title":"The Fast Downward planning system","authors":"Malte Helmert","year":"2006","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Katz and Domshlak, 2010] Michael Katz and Carmel Domshlak. Optimal admissible composition of abstraction heuristics. Artificial Intelligence, 174(12-13):767-798, 2010.","title":"Optimal admissible composition of abstraction heuristics","authors":"Domshlak Katz, Michael Katz, Carmel Domshlak","year":"2010","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Nissim et al., 2011] Raz Nissim, Jörg Hoffmann, and Malte Helmert. Computing perfect heuristics in polynomial time: On bisimulation and merge-and-shrink abstraction in opti- mal planning. In Toby Walsh, editor, Proceedings of the 22nd International Joint Conference on Artificial Intelli- gence (IJCAI 2011), pages 1983-1990. AAAI Press, 2011.","title":"Computing perfect heuristics in polynomial time: On bisimulation and merge-and-shrink abstraction in optimal planning","authors":"Raz Nissim, Jörg Hoffmann, Malte Helmert","year":"2011","venue":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011)","doi":null,"url":null,"internal_url":"/proceedings/2011/331"},{"position":11,"raw":"[Pearl, 1984] Judea Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison- Wesley, 1984.","title":"Judea Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving","authors":"Pearl","year":"1984","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Pommerening et al., 2015] Florian Pommerening, Malte Helmert, Gabriele Röger, and Jendrik Seipp. From non-negative to general operator cost partitioning. In Blai Bonet and Sven Koenig, editors, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015), pages 3335-3341. AAAI Press, 2015.","title":"From non-negative to general operator cost partitioning","authors":"Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Seipp and Helmert, 2018] Jendrik Seipp and Malte Helmert. Counterexample-guided Cartesian abstrac- tion refinement for classical planning. Journal of Artificial Intelligence Research, 62:535-577, 2018.","title":"Jendrik Seipp and Malte Helmert. Counterexample-guided Cartesian abstraction refinement for classical planning","authors":"Helmert Seipp","year":"2018","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Seipp et al., 2017a] Jendrik Seipp, Thomas Keller, and Malte Helmert. A comparison of cost partitioning algo- rithms for optimal classical planning. In Laura Barbulescu, Jeremy Frank, Mausam, and Stephen F. Smith, editors, Proceedings of the Twenty-Seventh International Con- ference on Automated Planning and Scheduling (ICAPS 2017), pages 259-268. AAAI Press, 2017.","title":"A comparison of cost partitioning algorithms for optimal classical planning","authors":"Seipp","year":"2017","venue":"Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Seipp et al., 2017b] Jendrik Seipp, Florian Pommerening, Silvan Sievers, and Malte Helmert. Downward Lab. https: //doi.org/10.5281/zenodo.790461, 2017.","title":"Downward Lab","authors":"Seipp","year":"2017","venue":null,"doi":"10.5281/zenodo.790461","url":"https://doi.org/10.5281/zenodo.790461,2017","internal_url":null},{"position":16,"raw":"[Seipp et al., 2020] Jendrik Seipp, Thomas Keller, and Malte Helmert. Saturated cost partitioning for optimal classi- cal planning. Journal of Artificial Intelligence Research, 67:129-167, 2020.","title":"Saturated cost partitioning for optimal classical planning","authors":"Seipp","year":"2020","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Sievers et al., 2014] Silvan Sievers, Martin Wehrle, and Malte Helmert. Generalized label reduction for merge- and-shrink heuristics. In Carla E. Brodley and Peter Stone, editors, Proceedings of the Twenty-Eighth AAAI Confer- ence on Artificial Intelligence (AAAI 2014), pages 2358- 2366. AAAI Press, 2014.","title":"Generalized label reduction for mergeand-shrink heuristics","authors":"Sievers","year":"2014","venue":"Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Sievers et al., 2016] Silvan Sievers, Martin Wehrle, and Malte Helmert. An analysis of merge strategies for merge-and-shrink heuristics. In Amanda Coles, Andrew Coles, Stefan Edelkamp, Daniele Magazzeni, and Scott Sanner, editors, Proceedings of the Twenty-Sixth Interna- tional Conference on Automated Planning and Scheduling (ICAPS 2016), pages 294-298. AAAI Press, 2016.","title":"An analysis of merge strategies for merge-and-shrink heuristics","authors":"Sievers","year":"2016","venue":"Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Sievers et al., 2020a] Silvan Sievers, Florian Pommeren- ing, Thomas Keller, and Malte Helmert. Code, bench- marks and experiment data for the IJCAI 2020 paper \"Cost-Partitioned Merge-and-Shrink Heuristics for Opti- mal Classical Planning\". https://doi.org/10.5281/zenodo. 3775871, 2020.","title":"Code, benchmarks and experiment data for the IJCAI 2020 paper","authors":"Sievers","year":"2020","venue":"Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning","doi":"10.5281/zenodo.3775871","url":"https://doi.org/10.5281/zenodo.3775871,2020","internal_url":null},{"position":20,"raw":"[Sievers et al., 2020b] Silvan Sievers, Florian Pommerening, Thomas Keller, and Malte Helmert. Cost-partitioned merge-and-shrink heuristics for optimal classical plan- ning: Technical report. Technical Report CS-2020-001, University of Basel, Department of Mathematics and Computer Science, 2020.","title":"Cost-partitioned merge-and-shrink heuristics for optimal classical planning","authors":"Sievers","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Sievers, 2018] Silvan Sievers. Merge-and-shrink heuristics for classical planning: Efficient implementation and par- tial abstractions. In Vadim Bulitko and Sabine Storandt, editors, Proceedings of the 11th Annual Symposium on Combinatorial Search (SoCS 2018), pages 90-98. AAAI Press, 2018.","title":"Merge-and-shrink heuristics for classical planning: Efficient implementation and partial abstractions","authors":"Silvan Sievers, Sievers","year":"2018","venue":"Proceedings of the 11th Annual Symposium on Combinatorial Search (SoCS 2018)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}